Sudebkumar Prasant Pal

VLDB 2026 Research / reviewers in the wild / expert

dblp:p/SudebkumarPrasantPal · DBLP profile ↗

← Back

18ranked-venue papers

1as first author

1since 2021 · last 2022

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 10 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 7Systems, architecture and hardware · 1

Year	Publication	Venue	Position
2022	Preface: CALDAM 2019 Swami Sarvattomananda, Sudebkumar Prasant Pal	Discret. Appl. Math.	2
2020	System of unbiased representatives for a collection of bicolorings Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra 0001, Sudebkumar Prasant Pal	Discret. Appl. Math.	4
2020	Bisecting and D-secting families for set systems Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra 0001, Sudebkumar Prasant Pal	Discret. Appl. Math.	4
2015	Guest Editors' foreword Sudebkumar Prasant Pal, Kunihiko Sadakane	Theor. Comput. Sci.	1
2013	Diffuse reflection diameter and radius for convex-quadrilateralizable polygons Arindam Khan 0001, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy	Discret. Appl. Math.	2
2012	Algorithms for computing diffuse reflection paths in polygons Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda	Vis. Comput.	5
2009	Efficient Prüfer-Like Coding and Counting Labelled Hypertrees Saswata Shannigrahi, Sudebkumar Prasant Pal	Algorithmica	2
2006	Efficient Prüfer-Like Coding and Counting Labelled Hypertrees Saswata Shannigrahi, Sudebkumar Prasant Pal	ISAAC	2
1998	Recognizing weakly convex visible polygons Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal	Comput. Geom.	3
1998	Visibility with multiple diffuse reflections D. Chithra Prasad, Sudebkumar Prasant Pal, Tamal K. Dey	Comput. Geom.	2
1998	Visibility with Multiple Reflections Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad	Discret. Comput. Geom.	4
1998	Visibility with One Reflection Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad	Discret. Comput. Geom.	4
1998	An algorithm for finding a non-trivial lower bound for channel routing1 Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal	Integr.	2
1995	Visibility with Reflection abstract Article Free Access Share on Visibility with reflection Authors: Boris Aronov Computer Science Department, Polytechnic University, Brooklyn, NY Computer Science Department, Polytechnic University, Brooklyn, NYView Profile , Alan R. Davis Div. of Computer Science, Math. and Science, St. Johns University, Jamaica, NY Div. of Computer Science, Math. and Science, St. Johns University, Jamaica, NYView Profile , Tamal K. Dey Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, India Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, IndiaView Profile , Sudebkumar P. Pal Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, India Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, IndiaView Profile , D. Chithra Prasad Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, India Dept. of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, Kharagpur 721302, IndiaView Profile Authors Info & Claims SCG '95: Proceedings of the eleventh annual symposium on Computational geometrySeptember 1995 Pages 316–325https://doi.org/10.1145/220279.220313Published:01 September 1995Publication History 3citation320DownloadsMetricsTotal Citations3Total Downloads320Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad	SCG	4
1994	Algorithms for Convex Visibility Problems Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal	FSTTCS	3
1994	An algorithm for recognizing palm polygons Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan	Vis. Comput.	3
1993	Characterizing and Recognizing Weak Visibility Polygons Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan	Comput. Geom.	3
1991	Computing the Shortest Path Tree in a Weak Visibility Polygon Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan	FSTTCS	3