| Visibility with one reflection B Aronov, AR Davis, TK Dey, SP Pal, DC Prasad Discrete & Computational Geometry 19, 553-574, 1998 | 37 | 1998 |
| Visibility with multiple reflections B Aronov, AR Davis, TK Dey, SP Pal, DC Prasad Discrete & Computational Geometry 20, 61-78, 1998 | 31 | 1998 |
| A general graph theoretic framework for multi-layer channel routing RK Pal, AK Datta, SP Pal, MM Das, A Pal Proceedings of the 8th International Conference on VLSI Design, 202-207, 1995 | 31 | 1995 |
| Characterizing and recognizing weak visibility polygons SK Ghosh, A Maheshwari, SP Pal, S Saluja, CEV Madhavan Computational Geometry 3 (4), 213-233, 1993 | 31 | 1993 |
| Resolving horizontal constraints and minimizing net wire length for multi-layer channel routing RK Pal, AK Datta, SP Pal, A Pal Proceedings of TENCON'93. IEEE Region 10 International Conference on …, 1993 | 29 | 1993 |
| Constant approximation algorithms for guarding simple polygons using vertex guards P Bhattacharya, SK Ghosh, S Pal arXiv preprint arXiv:1712.05492, 2017 | 21 | 2017 |
| Visibility with multiple diffuse reflections DC Prasad, SP Pal, TK Dey Computational Geometry 10 (3), 187-196, 1998 | 20 | 1998 |
| Characterizing Weak Visiblity Polygons and Related Problems," Indian Institute of Science, Bangalore, Department of Computer Science and Automation TR IISc-CSA-90-1, 1990 … S Ghosh, A Maheshwari, S Pal, S Saluja, CV Madhavan Proceedings 2nd Canadian Conference in Computational Geometry, Ottawa, 93-97, 1990 | 17 | 1990 |
| Maximum weighted independent sets with a budget T Kalra, R Mathew, SP Pal, V Pandey Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 16 | 2017 |
| Fair leader election by randomized voting S Brahma, S Macharla, SP Pal, SK Singh Distributed Computing and Internet Technology: First International …, 2005 | 15 | 2005 |
| Visibility with reflection B Aronov, AR Davis, TK Dey, SP Pal, DC Prasad Proceedings of the eleventh annual symposium on Computational geometry, 316-325, 1995 | 15 | 1995 |
| Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks SP Pal, SK Singh, S Kumar arXiv preprint quant-ph/0306195, 2003 | 11 | 2003 |
| NP-completeness of multi-layer no-dogleg channel routing and an efficient heuristic RK Pal, SP Pal, A Pal, AK Dutta The Sixth International Conference on VLSI Design, 80, 81, 82, 83-80, 81, 82, 83, 1993 | 11 | 1993 |
| Algorithms for computing diffuse reflection paths in polygons SK Ghosh, PP Goswami, A Maheshwari, SC Nandy, SP Pal, ... The Visual Computer 28, 1229-1237, 2012 | 10 | 2012 |
| A combinatorial approach for studying local operations and classical communication transformations of multipartite states SK Singh, SP Pal, S Kumar, R Srikanth Journal of mathematical physics 46 (12), 2005 | 10 | 2005 |
| An algorithm for finding a non-trivial lower bound for channel routing RK Pal, SP Pal, A Pal Integration 25 (1), 71-84, 1998 | 10 | 1998 |
| Resolving horizontal constraints and minimizing net wire length for VHV channel routing RK Pal, AK Datta, SP Pal, A Pal Department of Computer Science and Engineering, IIT, Kharagpur, 1992 | 9 | 1992 |
| A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections S Brahma, SP Pal, D Sarkar Journal of Geometry 81, 5-14, 2004 | 8 | 2004 |
| An algorithm for recognizing palm polygons SK Ghosh, A Maheshwari, SP Pal, CEV Madhavan The Visual Computer 10, 443-451, 1994 | 8 | 1994 |
| A new lower bound for channel routing RK Pal, SP Pal, A Pal Proceedings of TENCON'93. IEEE Region 10 International Conference on …, 1993 | 8 | 1993 |
Tamal K. DeyProfessor Computer Science, Purdue Universityכתובת אימייל מאומתת בדומיין purdue.edu
