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, 1991)

NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic. - Rajat Kumar Pal; Sudebkumar Prasant Pal; Ajit Pal; Alak K. Dutta (VLSI Design, 1993)

Characterizing and Recognizing Weak Visibility Polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; Sanjeev Saluja; C. E. Veni Madhavan (Comput. Geom., 1993)

Algorithms for Convex Visibility Problems. - Supriya Biswas; D. Chithra Prasad; Sudebkumar Prasant Pal (FSTTCS, 1994)

An algorithm for recognizing palm polygons. - Subir Kumar Ghosh; Anil Maheshwari; Sudebkumar Prasant Pal; C. E. Veni Madhavan (Vis. Comput., 1994)

Visibility with Reflection. - Boris Aronov; Alan R. Davis; Tamal K. Dey; Sudebkumar Prasant Pal; D. Chithra Prasad (SCG, 1995)

A general graph theoretic framework for multi-layer channel routing. - Rajat Kumar Pal; A. K. Datta; Sudebkumar Prasant Pal; M. M. Das; Ajit Pal (VLSI Design, 1995)

Computing area and wire length efficient routes for channels. - Rajat Kumar Pal; Sudebkumar Prasant Pal; M. M. Das; Ajit Pal (VLSI Design, 1995)

An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. - Rajat Kumar Pal; Sudebkumar Prasant Pal; Ajit Pal (VLSI Design, 1997)

Recognizing weakly convex visible polygons. - Supriya Biswas; D. Chithra Prasad; Sudebkumar Prasant Pal (Comput. Geom., 1998)

Visibility with multiple diffuse reflections. - D. Chithra Prasad; Sudebkumar Prasant Pal; Tamal K. Dey (Comput. Geom., 1998)

Visibility with Multiple Reflections. - Boris Aronov; Alan R. Davis; Tamal K. Dey; Sudebkumar Prasant Pal; D. Chithra Prasad (Discret. Comput. Geom., 1998)

Visibility with One Reflection. - Boris Aronov; Alan R. Davis; Tamal K. Dey; Sudebkumar Prasant Pal; D. Chithra Prasad (Discret. Comput. Geom., 1998)

An algorithm for finding a non-trivial lower bound for channel routing1. - Rajat Kumar Pal; Sudebkumar Prasant Pal; Ajit Pal (Integr., 1998)

On multiple connectedness of regions visible due to multiple diffuse reflections - Sudebkumar Prasant Pal; Dilip Sarkar (CoRR, 2003)

Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials - P. H. D. Ramakrishna; Sudebkumar Prasant Pal; Samir Bhalla; Hironmay Basu; Sudhir Kumar Singh (CoRR, 2003)

A scalable, efficient and general Monte Carlo scheme for generating synthetic web request streams. - Smruti R. Sarangi; P. N. Sireesh; Sudebkumar Prasant Pal (Comput. Syst. Sci. Eng., 2003)

Fair Leader Election by Randomized Voting. - Siddhartha Brahma; Sandeep Macharla; Sudebkumar Prasant Pal; Sudhir Kumar Singh (ICDCIT, 2004)

A combinatorial approach for studying LOCC transformations of multipartite states - Sudhir Kumar Singh; Sudebkumar Prasant Pal; Somesh Kumar; R. Srikanth 001 (CoRR, 2004)

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. - Siddhartha Brahma; P. H. D. Ramakrishna; Sudebkumar Prasant Pal (Int. J. Comput. Math., 2004)

Computations that require higher than double precision for robust and exact decision making. - Sudebkumar Prasant Pal; Rakesh Kumar Koul; Frahad Musadeekh; P. H. D. Ramakrishna; Hironmay Basu (Int. J. Comput. Math., 2004)

Virtual video caching: A scalable and generic technique for improved quality of video service. - Sudebkumar Prasant Pal; Rajiv Ranjan Suman; G. Sudha Anil Kumar; Ruchi Malhotra (J. High Speed Networks, 2004)

Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. - Saswata Shannigrahi; Sudebkumar Prasant Pal (Algorithmica, 2009)

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., 2012)

An Algorithm for Computing Constrained Reflection Paths in Simple Polygon - Arijit Bishnu; Subir Kumar Ghosh; Partha P. Goswami; Sudebkumar Prasant Pal; Swami Sarvattomananda (CoRR, 2013)

Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. - Arindam Khan 001; Sudebkumar Prasant Pal; Mridul Aanjaneya; Arijit Bishnu; Subhas C. Nandy (Discret. Appl. Math., 2013)

Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs. - Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (J. Graph Algorithms Appl., 2013)

A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research. - Subir Kumar Ghosh; Sudebkumar Prasant Pal (CoRR, 2015)

Bicoloring covers for graphs and hypergraphs. - Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (CoRR, 2015)

An extremal problem in proper (r, p)-coloring of hypergraphs. - Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (CoRR, 2015)

Strong (r, p) Cover for Hypergraphs. - Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (CoRR, 2015)

Guest Editors' foreword. - Sudebkumar Prasant Pal; Kunihiko Sadakane (Theor. Comput. Sci., 2015)

Bisecting families for set systems. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (CoRR, 2016)

Maximum Weighted Independent Sets with a Budget. - Tushar Kalra; Rogers Mathew; Sudebkumar Prasant Pal; Vijay Pandey (CALDAM, 2017)

Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards. - Pritam Bhattacharya; Subir Kumar Ghosh; Sudebkumar Prasant Pal (CoRR, 2017)

Induced-bisecting families of bicolorings for hypergraphs. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (Discret. Math., 2018)

System of unbiased representatives for a collection of bicolorings. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (Discret. Appl. Math., 2020)

Bisecting and D-secting families for set systems. - Niranjan Balachandran; Rogers Mathew; Tapas Kumar Mishra 001; Sudebkumar Prasant Pal (Discret. Appl. Math., 2020)

Preface: CALDAM 2019. - Swami Sarvattamananda; Sudebkumar Prasant Pal (Discret. Appl. Math., 2022)

Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs. - Aryan Sanghi; Devsi Bantva; Sudebkumar Prasant Pal (CALDAM, 2025)