| 2013 | WALCOM | Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs. | Tapas Kumar Mishra, Sudebkumar Prasant Pal |
| 2009 | WALCOM | Algorithms for Computing Diffuse Reflection Paths in Polygons. | Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda |
| 2006 | ISAAC | Efficient Prfer-Like Coding and Counting Labelled Hypertrees. | Saswata Shannigrahi, Sudebkumar Prasant Pal |
| 2004 | ICDCIT | Fair Leader Election by Randomized Voting. | Siddhartha Brahma, Sandeep Macharla, Sudebkumar Prasant Pal, Sudhir Kumar Singh |
| 1997 | VLSID | An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. | Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal |
| 1995 | VLSID | A general graph theoretic framework for multi-layer channel routing. | Rajat Kumar Pal, A. K. Datta, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal |
| 1995 | VLSID | Computing area and wire length efficient routes for channels. | Rajat Kumar Pal, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal |
| 1993 | VLSID | NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient Heuristic. | Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal, Alak K. Dutta |