Sudebkumar Prasant Pal - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2025

Forbidden Induced Subgraphs in Iterative Higher Order Line GraphsAryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal. caldam 2025: 307-318 [doi]

2022

Preface: CALDAM 2019Swami Sarvattamananda, Sudebkumar Prasant Pal. DAM, 319:1, 2022. [doi]

2020

Bisecting and D-secting families for set systemsNiranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra 0001, Sudebkumar Prasant Pal. DAM, 280:2-13, 2020. [doi]

System of unbiased representatives for a collection of bicoloringsNiranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra 0001, Sudebkumar Prasant Pal. DAM, 286:116-127, 2020. [doi]

2018

Induced-bisecting families of bicolorings for hypergraphsNiranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra 0001, Sudebkumar Prasant Pal. DM, 341(6):1732-1739, 2018. [doi]

2017

Maximum Weighted Independent Sets with a BudgetTushar Kalra, Rogers Mathew, Sudebkumar Prasant Pal, Vijay Pandey. caldam 2017: 254-266 [doi]

2015

Guest Editors' forewordSudebkumar Prasant Pal, Kunihiko Sadakane. TCS, 575:1-2, 2015. [doi]

2014

Guest Editors' ForewordSudebkumar Prasant Pal, Kunihiko Sadakane. jgaa, 18(4):491-492, 2014. [doi]

2013

Diffuse reflection diameter and radius for convex-quadrilateralizable polygonsArindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy. DAM, 161(10-11):1496-1505, 2013. [doi]

Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite SubgraphsTapas Kumar Mishra, Sudebkumar Prasant Pal. walcom 2013: 257-264 [doi]

Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphsTapas Kumar Mishra, Sudebkumar Prasant Pal. jgaa, 17(6):671-688, 2013. [doi]

2012

Algorithms for computing diffuse reflection paths in polygonsSubir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda. vc, 28(12):1229-1237, 2012. [doi]

2009

Algorithms for Computing Diffuse Reflection Paths in PolygonsSubir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda. walcom 2009: 47-58 [doi]

Efficient Prüfer-Like Coding and Counting Labelled HypertreesSaswata Shannigrahi, Sudebkumar Prasant Pal. algorithmica, 54(2):208-225, 2009. [doi]

2006

Efficient Prüfer-Like Coding and Counting Labelled HypertreesSaswata Shannigrahi, Sudebkumar Prasant Pal. isaac 2006: 588-597 [doi]

2004

2003

A scalable, efficient and general Monte Carlo scheme for generating synthetic web request streamsSmruti R. Sarangi, P. N. Sireesh, Sudebkumar Prasant Pal. csse, 18(3):121-128, 2003.

1998

Visibility with One ReflectionBoris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad. dcg, 19(4):553-574, 1998. [doi]

Visibility with Multiple ReflectionsBoris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad. dcg, 20(1):61-78, 1998. [doi]

Recognizing weakly convex visible polygonsSupriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal. comgeo, 10(3):171-186, 1998.

An algorithm for finding a non-trivial lower bound for channel routing1Rajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal. integration, 25(1):71-84, 1998. [doi]

Visibility with multiple diffuse reflectionsD. Chithra Prasad, Sudebkumar Prasant Pal, Tamal K. Dey. comgeo, 10(3):187-196, 1998.

1997

An Algorithm for Finding a Non-Trivial Lower Bound for Channel RoutingRajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal. vlsid 1997: 531-533 [doi]

1996

Visibility with Multiple ReflectionsBoris Aronov, Alan R. Davis, Tamal K. Dey, Sudebkumar Prasant Pal, D. Chithra Prasad. swat 1996: 284-295

1995

1994

Algorithms for Convex Visibility ProblemsSupriya Biswas, D. Chithra Prasad, Sudebkumar Prasant Pal. fsttcs 1994: 181-192

An algorithm for recognizing palm polygonsSubir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, C. E. Veni Madhavan. vc, 10(8):443-451, 1994.

1993

Characterizing and Recognizing Weak Visibility PolygonsSubir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan. comgeo, 3:213-233, 1993.

NP-Completeness of Multi-Layer No-Dogleg Channel Routing and an Efficient HeuristicRajat K. Pal, Sudebkumar Prasant Pal, Ajit Pal, Alak K. Dutta. vlsid 1993: 80-83

1991

Computing the Shortest Path Tree in a Weak Visibility PolygonSubir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan. fsttcs 1991: 369-389

Sign in or sign up to see more results.

runs on WebDSL