default search action
Sudebkumar Prasant Pal
Person information
- affiliation: ERNET, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j21]Swami Sarvattamananda, Sudebkumar Prasant Pal:
Preface: CALDAM 2019. Discret. Appl. Math. 319: 1 (2022) - 2020
- [j20]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting and D-secting families for set systems. Discret. Appl. Math. 280: 2-13 (2020) - [j19]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. Discret. Appl. Math. 286: 116-127 (2020)
2010 – 2019
- 2019
- [e2]Sudebkumar Prasant Pal, Ambat Vijayakumar:
Algorithms and Discrete Applied Mathematics - 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings. Lecture Notes in Computer Science 11394, Springer 2019, ISBN 978-3-030-11508-1 [contents] - 2018
- [j18]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Induced-bisecting families of bicolorings for hypergraphs. Discret. Math. 341(6): 1732-1739 (2018) - 2017
- [c13]Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey:
Maximum Weighted Independent Sets with a Budget. CALDAM 2017: 254-266 - [i12]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. CoRR abs/1704.07716 (2017) - [i11]Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Prasant Pal:
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards. CoRR abs/1712.05492 (2017) - 2016
- [i10]Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting families for set systems. CoRR abs/1604.01482 (2016) - 2015
- [j17]Sudebkumar Prasant Pal, Kunihiko Sadakane:
Guest Editors' foreword. Theor. Comput. Sci. 575: 1-2 (2015) - [i9]Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bicoloring covers for graphs and hypergraphs. CoRR abs/1501.00343 (2015) - [i8]Tushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey:
Maximum weighted independent sets with a budget. CoRR abs/1506.07773 (2015) - [i7]Tapas Kumar Mishra, Sudebkumar Prasant Pal:
An extremal problem in proper (r, p)-coloring of hypergraphs. CoRR abs/1507.02463 (2015) - [i6]Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Strong (r, p) Cover for Hypergraphs. CoRR abs/1507.03160 (2015) - [i5]Subir Kumar Ghosh, Sudebkumar Prasant Pal:
A National Effort for Motivating Indian Students and Teachers towards Algorithmic Research. CoRR abs/1507.06056 (2015) - 2014
- [j16]Sudebkumar Prasant Pal, Kunihiko Sadakane:
Guest Editors' Foreword. J. Graph Algorithms Appl. 18(4): 491-492 (2014) - [e1]Sudebkumar Prasant Pal, Kunihiko Sadakane:
Algorithms and Computation - 8th International Workshop, WALCOM 2014, Chennai, India, February 13-15, 2014, Proceedings. Lecture Notes in Computer Science 8344, Springer 2014, ISBN 978-3-319-04656-3 [contents] - 2013
- [j15]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): 1496-1505 (2013) - [j14]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): 671-688 (2013) - [c12]Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs. WALCOM 2013: 257-264 - [i4]Arijit Bishnu, Subir Kumar Ghosh, Partha P. Goswami, Sudebkumar Prasant Pal, Swami Sarvattomananda:
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon. CoRR abs/1304.4320 (2013) - 2012
- [j13]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): 1229-1237 (2012)
2000 – 2009
- 2009
- [j12]Saswata Shannigrahi, Sudebkumar Prasant Pal:
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. Algorithmica 54(2): 208-225 (2009) - [c11]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: 47-58 - 2006
- [c10]Saswata Shannigrahi, Sudebkumar Prasant Pal:
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees. ISAAC 2006: 588-597 - 2004
- [j11]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): 595-605 (2004) - [j10]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): 1549-1557 (2004) - [j9]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): 249-263 (2004) - [c9]Siddhartha Brahma, Sandeep Macharla, Sudebkumar Prasant Pal, Sudhir Kumar Singh:
Fair Leader Election by Randomized Voting. ICDCIT 2004: 22-31 - [i3]Sudhir Kumar Singh, Sudebkumar Prasant Pal, Somesh Kumar, R. Srikanth:
A combinatorial approach for studying LOCC transformations of multipartite states. CoRR quant-ph/0406135 (2004) - 2003
- [j8]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): 121-128 (2003) - [i2]Sudebkumar Prasant Pal, Dilip Sarkar:
On multiple connectedness of regions visible due to multiple diffuse reflections. CoRR cs.CG/0306010 (2003) - [i1]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 cs.NA/0306015 (2003)
1990 – 1999
- 1998
- [j7]Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal:
Recognizing weakly convex visible polygons. Comput. Geom. 10(3): 171-186 (1998) - [j6]D. Chithra Prasad, Sudebkumar Prasant Pal, Tamal K. Dey:
Visibility with multiple diffuse reflections. Comput. Geom. 10(3): 187-196 (1998) - [j5]Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with One Reflection. Discret. Comput. Geom. 19(4): 553-574 (1998) - [j4]Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Multiple Reflections. Discret. Comput. Geom. 20(1): 61-78 (1998) - [j3]Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal:
An algorithm for finding a non-trivial lower bound for channel routing1. Integr. 25(1): 71-84 (1998) - 1997
- [c8]Rajat Kumar Pal, Sudebkumar Prasant Pal, Ajit Pal:
An Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing. VLSI Design 1997: 531-533 - 1996
- [c7]Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Multiple Reflections. SWAT 1996: 284-295 - 1995
- [c6]Boris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad:
Visibility with Reflection. SCG 1995: 316-325 - [c5]Rajat Kumar Pal, Sudebkumar Prasant Pal, M. M. Das, Ajit Pal:
Computing area and wire length efficient routes for channels. VLSI Design 1995: 196-201 - [c4]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: 202-207 - 1994
- [j2]Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan:
An algorithm for recognizing palm polygons. Vis. Comput. 10(8): 443-451 (1994) - [c3]Supriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal:
Algorithms for Convex Visibility Problems. FSTTCS 1994: 181-192 - 1993
- [j1]Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan:
Characterizing and Recognizing Weak Visibility Polygons. Comput. Geom. 3: 213-233 (1993) - [c2]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: 80-83 - 1991
- [c1]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: 369-389
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint