Sudebkumar Prasant Pal

50 papers B 4Misc 5Journal 34Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs. CALDAM Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal
2024	J	`jnl`	Forbidden induced subgraphs in iterative higher order line graphs. CoRR Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal
2022	J	`jnl`	Preface: CALDAM 2019. Discret. Appl. Math. Swami Sarvattamananda, Sudebkumar Prasant Pal
2020	J	`jnl`	Bisecting and D-secting families for set systems. Discret. Appl. Math. Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
2020	J	`jnl`	System of unbiased representatives for a collection of bicolorings. Discret. Appl. Math. Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
2019	—	`ed.`	Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings CALDAM Sudebkumar Prasant Pal, Ambat Vijayakumar
2018	J	`jnl`	Induced-bisecting families of bicolorings for hypergraphs. Discret. Math. Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
2017	J	`jnl`	Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards. CoRR Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Prasant Pal
2017	—	`conf`	Maximum Weighted Independent Sets with a Budget. CALDAM Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey
2017	J	`jnl`	System of unbiased representatives for a collection of bicolorings. CoRR Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
2016	J	`jnl`	Bisecting families for set systems. CoRR Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal
2015	J	`jnl`	A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research. CoRR Subir Kumar Ghosh, Sudebkumar Prasant Pal
2015	J	`jnl`	An extremal problem in proper (r, p)-coloring of hypergraphs. CoRR Tapas Kumar Mishra, Sudebkumar Prasant Pal
2015	J	`jnl`	Bicoloring covers for graphs and hypergraphs. CoRR Tapas Kumar Mishra, Sudebkumar Prasant Pal
2015	J	`jnl`	Guest Editors' foreword. Theor. Comput. Sci. Sudebkumar Prasant Pal, Kunihiko Sadakane
2015	J	`jnl`	Maximum weighted independent sets with a budget. CoRR Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey
2015	J	`jnl`	Strong (r, p) Cover for Hypergraphs. CoRR Tapas Kumar Mishra, Sudebkumar Prasant Pal
2014	B	`ed.`	Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings WALCOM Sudebkumar Prasant Pal, Kunihiko Sadakane
2014	J	`jnl`	Guest Editors' Foreword. J. Graph Algorithms Appl. Sudebkumar Prasant Pal, Kunihiko Sadakane
2013	J	`jnl`	An Algorithm for Computing Constrained Reflection Paths in Simple Polygon CoRR Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda
2013	J	`jnl`	Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discret. Appl. Math. Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy
2013	B	`conf`	Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs. WALCOM Tapas Kumar Mishra, Sudebkumar Prasant Pal
2013	J	`jnl`	Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs. J. Graph Algorithms Appl. Tapas Kumar Mishra, Sudebkumar Prasant Pal
2012	J	`jnl`	Algorithms for computing diffuse reflection paths in polygons. Vis. Comput. Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2009	B	`conf`	Algorithms for Computing Diffuse Reflection Paths in Polygons. WALCOM Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2009	J	`jnl`	Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. Algorithmica Saswata Shannigrahi, Sudebkumar Prasant Pal
2006	B	`conf`	Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. ISAAC Saswata Shannigrahi, Sudebkumar Prasant Pal
2004	J	`jnl`	A combinatorial approach for studying LOCC transformations of multipartite states CoRR Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar, R. Srikanth
2004	J	`jnl`	A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial. Int. J. Comput. Math. Siddhartha Brahma, P. H. D. Ramakrishna, Sudebkumar Prasant Pal
2004	J	`jnl`	Computations that require higher than double precision for robust and exact decision making. Int. J. Comput. Math. Sudebkumar Prasant Pal, Rakesh Kumar Koul, Frahad Musadeekh, P. H. D. Ramakrishna, Hironmay Basu
2004	Misc	`conf`	Fair Leader Election by Randomized Voting. ICDCIT Siddhartha Brahma, Sandeep Macharla, Sudebkumar Prasant Pal, Sudhir Kumar Singh
2004	J	`jnl`	Virtual video caching: A scalable and generic technique for improved quality of video service. J. High Speed Networks Sudebkumar Prasant Pal, Rajiv Ranjan Suman, G. Sudha Anil Kumar, Ruchi Malhotra
2003	J	`jnl`	A scalable, efficient and general Monte Carlo scheme for generating synthetic web request streams. Comput. Syst. Sci. Eng. Smruti R. Sarangi, P. N. Sireesh, Sudebkumar Prasant Pal
2003	J	`jnl`	Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials CoRR P. H. D. Ramakrishna, Sudebkumar Prasant Pal, Samir Bhalla, Hironmay Basu, Sudhir Kumar Singh
2003	J	`jnl`	On multiple connectedness of regions visible due to multiple diffuse reflections CoRR Sudebkumar Prasant Pal, Dilip Sarkar
1998	J	`jnl`	An algorithm for finding a non-trivial lower bound for channel routing1. Integr. Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal
1998	J	`jnl`	Recognizing weakly convex visible polygons. Comput. Geom. Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal
1998	J	`jnl`	Visibility with Multiple Reflections. Discret. Comput. Geom. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
1998	J	`jnl`	Visibility with One Reflection. Discret. Comput. Geom. Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
1998	J	`jnl`	Visibility with multiple diffuse reflections. Comput. Geom. D. Chithra Prasad, Sudebkumar Prasant Pal, Tamal K. Dey
1997	Misc	`conf`	An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. VLSI Design Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal
1996	—	`conf`	Visibility with Multiple Reflections. SWAT Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
1995	Misc	`conf`	A general graph theoretic framework for multi-layer channel routing. VLSI Design Rajat Kumar Pal, A. K. Datta, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
1995	Misc	`conf`	Computing area and wire length efficient routes for channels. VLSI Design Rajat Kumar Pal, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal
1995	—	`conf`	Visibility with Reflection. SCG Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad
1994	—	`conf`	Algorithms for Convex Visibility Problems. FSTTCS Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal
1994	J	`jnl`	An algorithm for recognizing palm polygons. Vis. Comput. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan
1993	J	`jnl`	Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan
1993	Misc	`conf`	NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic. VLSI Design Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal, Alak K. Dutta
1991	—	`conf`	Computing the Shortest Path Tree in a Weak Visibility Polygon. FSTTCS Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan