Sudebkumar Prasant Pal

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 8

Top Topics

Diffuse Reflection

Educational Experiences

Top Venues

Discret. Appl. Math.

J. Graph Algorithms Appl.

Publications

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