Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Sudebkumar Prasant Pal
Observed names:
Pal, Sudebkumar,
Pal, Sudebkumar Prasant,
Sudebkumar P. Pal
Institution:
Indian Institute of Technology Kharagpur
Observed institutions:
Raman Research Institute,
Indian Institute of Technology Kharagpur,
Institute of Electrical and Electronics Engineers
OpenAlex ID:
A5109046454
Recognizing weakly convex visible polygons
1998
·
Supriya Biswas
, D.Chithra Prasad
, et al.
·
Computational Geometry
·
29
PDF
Characterizing and recognizing weak visibility polygons
1993
·
Subir Kumar Ghosh
, Anil Maheshwari
, et al.
·
Computational Geometry
·
21
PDF
Multi-partite Quantum Entanglement versus Randomization: Fair and Unbiased Leader Election in Networks
2003
·
Pal, Sudebkumar Prasant
, Singh, Sudhir Kumar
, et al.
·
arXiv (Cornell University)
·
17
PDF
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
2017
·
Bhattacharya, Pritam
, Ghosh, Subir Kumar
, et al.
·
arXiv (Cornell University)
·
14
PDF
Fair Leader Election by Randomized Voting
2004
·
Siddhartha Brahma
, Sandeep Macharla
, et al.
·
Lecture notes in computer science
·
14
Visibility with multiple diffuse reflections
1998
·
D.Chithra Prasad
, Sudebkumar P. Pal
, et al.
·
Computational Geometry
·
14
PDF
Maximum Weighted Independent Sets with a Budget
2017
·
Tushar Kalra
, Rogers Mathew
, et al.
·
Lecture notes in computer science
·
12
PDF
A combinatorial approach for studying local operations and classical communication transformations of multipartite states
2005
·
Sudhir Kumar Singh
, Sudebkumar Prasant Pal
, et al.
·
Journal of Mathematical Physics
·
11
A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections
2004
·
Siddhartha Brahma
, Sudebkumar Prasant Pal
, et al.
·
Journal of Geometry
·
8
Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement
2003
·
Singh, Sudhir Kumar
, Kumar, Somesh
, et al.
·
arXiv (Cornell University)
·
8
PDF
Algorithms for computing diffuse reflection paths in polygons
2012
·
Subir Kumar Ghosh
, Partha Pratim Goswami
, et al.
·
The Visual Computer
·
7
Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
2007
·
Saswata Shannigrahi
, Sudebkumar Prasant Pal
·
Algorithmica
·
6
Visibility with reflection
1995
·
Boris Aronov
, Alan R. Davis
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
6
Visibility with multiple reflections
1996
·
Boris Aronov
, Alan R. Davis
, et al.
·
Lecture notes in computer science
·
5
An algorithm for recognizing palm polygons
1994
·
Subir Kumar Ghosh
, Anil Maheshwari
, et al.
·
The Visual Computer
·
5
Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications
2006
·
Sudebkumar Prasant Pal
, Somesh Kumar
, et al.
·
AIP conference proceedings
·
4
Computing the shortest path tree in a weak visibility polygon
1991
·
Subir Kumar Ghosh
, Anil Maheshwari
, et al.
·
Lecture notes in computer science
·
4
Bisecting and D -secting families for set systems
2017
·
Niranjan Balachandran
, Rogers Mathew
, et al.
·
Discrete Applied Mathematics
·
3
An Algorithm for Computing Constrained Reflection Paths in Simple Polygon
2013
·
Bishnu, Arijit
, Ghosh, Subir Kumar
, et al.
·
arXiv (Cornell University)
·
3
PDF
System of unbiased representatives for a collection of bicolorings
2019
·
Niranjan Balachandran
, Rogers Mathew
, et al.
·
Discrete Applied Mathematics
·
2
Bisecting and D-secting families for set systems
2016
·
Balachandran, Niranjan
, Mathew, Rogers
, et al.
·
arXiv (Cornell University)
·
2
PDF
Bicoloring covers for graphs and hypergraphs
2015
·
Mishra, Tapas Kumar
, Pal, Sudebkumar Prasant
·
arXiv (Cornell University)
·
2
PDF
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
2013
·
Arindam Khan
, Sudebkumar P. Pal
, et al.
·
Discrete Applied Mathematics
·
2
PDF
Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs
2013
·
Tapas Kumar Mishra
, Sudebkumar Prasant Pal
·
Journal of Graph Algorithms and Applications
·
2
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs
2013
·
Tapas Kumar Mishra
, Sudebkumar Prasant Pal
·
Lecture notes in computer science
·
2
Show more works
View as search
Works count:
59
Citation count:
218
H-index:
8
I10-index:
8
Year
Topic
Type
