Graphs and hypergraphs

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
System of unbiased representatives for a collection of bicolorings. Discrete Applied Mathematics (Elsevier), vol. 286, pp. 116–127.(2020).

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bisecting and D-secting families for set systems. Discrete Applied Mathematics (Elsevier), vol. 280, pp. 2–13, (2020).

Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra and Sudebkumar Prasant Pal
Induced-bisecting families of bicolorings for hypergraphs, Discrete Mathematics (Elsevier), vol. 341, pp. 1732-1739 (2018).

Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Strong (r,p) Cover for Hypergraphs. CoRR abs/1507.03160 (2015)

Tapas Kumar Mishra, Sudebkumar Prasant Pal:
An extremal problem in proper (r,p)-coloring of hypergraphs. CoRR abs/1507.02463(2015)

Tapas Kumar Mishra, Sudebkumar Prasant Pal:
Bicoloring covers for graphs and hypergraphs. CoRR abs/1501.00343 (2015) 2014

Tapas Mishra and S. P. Pal ,
Lower bounds for Ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs, accepted for presentation in the Seventh Workshop on Algorithms and Computation, February 14-16, 2013, to be held in IIT Kharagpur, India (S. K. Ghosh and T. Tokuyama (Eds.): WALCOM 2013, LNCS 7748, pp. 257-264, 2013), full improved version in Journal of Graph Algorithms and Applications (special issue for WALCOM 2013), vol. 17, no. 6, pp. 671-688 (2013).

S. P. Pal,
Coding, counting, cutset incomparability and coloring of labelled graphs and hypergraphs, In “Graph Theory: Research Directions”, Editors: Pratima Panigrahi and S. B. Rao, Narosa Publishing House, February 2011, ISBN: 978-81-7319-997-4.

S. Shannigrahi (TIFR Mumbai) and S. P. Pal,
Efficient Pruffer-like coding and counting labelled hypertrees, Proceedings of the International Symposium on Algorithms and Computation, ISAAC 2006, LNCS 4288, revised version in special issue of Algorithmica, vol. 54, pp. 208-225, Springer, 2009.

Visibility with reflection

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).

Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy, Diffuse Reflection Diameter and Radius for Convex-Quadrilateralizable Polygons, accepted for publication in the journal, Discrete Applied Mathematics, Elsevier: now online at http://dx.doi.org/10.1016/j.dam.2012.12.020. Discrete Applied Mathematics, Elsevier, 161(10-11):1496-1505 (2013).

Subir Kumar Ghosh, Partha Partim Goswami, Anil Maheshwari, Subhas Chandra Nandy, Sudebkumar Prasant Pal and Swami Sarvattomananda,
Algorithms for computing diffuse reflection paths in polygons,
Proceedings of the Third International Workshop on Algorithms and Computation (WALCOM 2009), Februrary 2009, ISI Kolkata, appeared in The Visual Computer 28(12): 1229-1237 (2012).

S. P. Pal, Siddhartha Brahma (B. Tech. CSE, 2001-2005) and Dilip Sarkar (Univ. of Miami),
A linear worst-case lower bound on the number of holes in regions visible due to multiple diffuse reflections,
Journal of Geometry, vol 81, no. 1-2, December 2004, Birkhauser-Verlag.S. P. Pal and D. Sarkar (Univ. of Miami),

On multiple-connectedness of regions visible due to multiple diffuse reflections (click here to download from http://arXiv.org) ,
Technical Report, TR/IIT/CSE/SPP1, May 2001, Department of Computer Science and Engineering, IIT Kharagpur, 721302, India, Proceedings of the International Conference on Analysis and Discrete Structures (ICADS 2002), IIT Kharagpur, India, Dec 22-24, 2002.D.

Chithra Prasad (Ph. D. 1994-1996), S. P. Pal and T. K. Dey. Visibility with multiple diffuse reflections (download gzipped postscript file).. Computational Geometry:Theory and Applications, Vol. 10, (1998), 187–196.

B. Aronov (Brooklyn Polytechnic, NY, USA), A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad (Ph. D. 1994-1996) Visibility with multiple reflections (download gzipped postscript file). Discrete & Computational Geometry, Vol. 20, No. 61, (1998), 61–78. Preliminary version in 5th Scandinavian Workshop on Algorithms Theory, 1996, LNCS 1097, 284-295.

B. Aronov (Brooklyn Polytechnic, NY, USA), A. Davis, T. K. Dey, S. P. Pal and D. Chithra Prasad (Ph. D. 1994-1996) Visibility with one reflection (download gzipped postscript file). Discrete & Computational Geometry, Vol. 19, No. 4, (1998), 553-574. Preliminary version in 11th ACM Symp. on Computational Geometry, 1995, 316-325.

D. C. Prasad, T. K. Dey and S. P. Pal, Art gallery problems for visibility with reflection, Proceedings of the Fifth National Seminar on Theoretical Computer Science, Bombay, pp. 105-114, August 1995.

Quantum Computation and Quantum Information Processing

V. S. Shekhawat (B. Tech. CSE (2007)), A. Ghosh (B. Tech. CSE (2007 Dual Degree)), A. Prakash (B. Tech. CSE (2008)) and S. P. Pal, Hypergraph-theoretic characterizations for LOCC incomparable ensembles of multiple multipartite CAT states, presented in AQIS 2007, Kyoto, Japan, Sept. 03-06, 2007.

S. P. Pal, S. Kumar and R. Srikanth, Multipartite entanglement configurations: Combinatorial offshoots into (hyper)graph theory and their ramifications, Quantum Computing: Back Action, IIT Kanpur, March 2006, AIP Conference Proceedings, vol. 864, pp. 156-170.

S. P. Pal, S. Das and Somesh Kumar, Constant communication complexity protocols for multiparty accumulative boolean functions.

Sudhir Kumar Singh (M. Sc. Maths and Computing 1999-2004, currently in UCLA), S. P. Pal, Somesh Kumar (Dept. of Mathematics, IIT Kharagpur), and R. Srikanth (RRI Bangalore), A combinatorial approach for studying LOCC transformations of multipartite states, Journal of Mathematical Physics, 46, 122105 (2005).

Sudhir Kumar Singh (M. Sc. Maths and Computing 1999-2004), Somesh Kumar and S. P. Pal, Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks.

Sudhir Kumar Singh (M. Sc. Maths and Computing 1999-2004), Somesh Kumar and S. P. Pal, Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement,

Convex Visibility

S. Biswas, D. C. Prasad and S. P. Pal,
Recognizing weakly convex visible
polygons, Computational Geometry: Theory and Applications,
Elsevier, North-Holland, 10 (1998), pp. 171-186.

S. K. Ghosh,
A. Maheshwari, S. P.Pal and C. E. Veni Madhavan,
An algorithm for recognizing palm polygons,
The Visual Computer: Special issue on Computational
Geometry (Invited paper), 10 (1994), pp. 443-451, Springer-Verlag.

S. Biswas, D. C. Prasad and S. P. Pal, Algorithms for convex
visibility problems, Proceedings of the fourteenth conference on
Foundations of Software Technology and Theoretical Computer Science,
New Delhi, India, Lecture Notes in Computer Science, vol. 880,
pp. 181-192, 1994, Springer-Verlag.

S. K. Ghosh, A. Maheshwari, S. P.Pal and C. E. Veni Madhavan,
An algorithm for recognizing palm polygons,
Proceedings of the Second Canadian Conference on
Computational Geometry, pp. 246-251, August 1990.

Channel Routing

R. K. Pal (Ph. D. 1991-1993), S. P. Pal and A. Pal,
An algorithm for finding a non-trivial
lower bound for channel
routing, INTEGRATION: The VLSI Journal,  25 (1998), pp. 71-84, Elsevier, North-Holland.

 R. K. Pal, S. P. Pal and A. Pal, A general graph theoretic framework
for multi-layer channel routing,
Proceedings of the Eighth International IEEE
Conference on VLSI Design, pp. 202-207, Delhi, Jan 1995.

R. K. Pal, S. P. Pal and A. Pal, Computing area and wire length
efficient routes for channels, Proceedings of the Eighth International IEEE
Conference on VLSI Design, pp. 196-201, Delhi, Jan 1995.

 R. K. Pal, S. P. Pal, and A. Pal, Minimizing net wire length in
multi-layer channel routing, Proceedings of the Silver Jubilee Workshop
on Computing and Intelligent Systems (Invited paper), pp. 171-188,
Indian Institute of Science, Bangalore, Dec 1993

R.K. Pal, S. P. Pal, A. K. Datta and A. Pal, NP-completeness of multi-layer
no-dogleg channel routing and an efficient heuristic, Proceedings of the
Fourth International Conference on VLSI Design, pp. 80-83, January 1993.

Others

S. P. Pal, B. Dasgupta and C. E. Veni Madhavan,
Optimal polygon placement by translation,
International Journal of Computer Mathematics,
52 (1994), pp. 139-148, Gordon and Breach Science Publishers.

S. P. Pal,
The union of billiard-ball paths: Structure and complexity (download postscript file),
Invited presentation, Workshop on Computational Geometry, Indian Statistical Institute, Kolkata, March 2002.

S. P. Pal,
Snapshots from the frontiers of computing (download postscript file),
Technology Alumni Association Journal, Golden Jubilee Commemorative Issue, August 2001,
pp. 25-32, Technology Alumni Association, IIT Kharagpur.

S. P. Pal,
Reflections on convexity, connectedness and visibility: Rich unions and elegant intersections (download pdf file) ,
National Science Day 2003 issue brought out by Nehru Museum of Science and Technology, IIT Kharagpur, pp. 57-68.

M. Mukherjee, S. P. Pal, M. K. Varvani and M. Tripathi,
Safe computation of set operators using finite precision,
Proceedings of CSG 96 on Set-theoretic Solid Modelling: Techniques and
Applications, Winchester, UK, pp. 291-305, April 1996.

Internet modelling and simulation, Distributed computing

Smruti Sarangi (B. Tech. 1998-2002), P. N. Sireesh (B. Tech. 1998-2002) and S. P. Pal,
A Scalable, Efficient and General Monte Carlo Scheme for Generating Synthetic Web Request Streams,
International Journal of Computer Systems Science and Engineering, CRL Publishing Ltd., UK, Vol. 18, no. 3, pp. 121-128, May 2003.

Smruti Sarangi (B. Tech. 1998-2002), P. N. Sireesh (B. Tech. 1998-2002) and S. P. Pal,
Generating synthetic web request streams,
Technical Report, TR/IIT/CSE/SPP3, Nov 2001, Department of Computer Science and Engineering, IIT Kharagpur, 721302, India,

Enhancing the performance of a mesh of caches by appropriately distributing cache, Joydeep Chandra (M. Tech. CSE Jan 2002), S. P. Pal, Rajiv Ranjan Suman (M. Tech. CSE Jan 2003), G. Sudha Anil Kumar (M. Tech (Integrated) 1999-2004) and Dilip Sarkar (Univ. of Miami), a previous version is documented as Technical Report No. IIT/TR/CSE/SPP1/2003, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, 721302, India, May 2003.

Virtual video caching: A scalable and generic technique for improved quality of video service, S. P. Pal, R. R. Suman, G. S. Anil Kumar and R. Malhotra, Proc. of the 2nd Trusted Internet Workshop, HiPC 2003, Hyderabad, India, December 17, 2003 (Journal of High Speed Networks, vol. 13, no. 4, 2004, IOS Press).

Fair leader election by randomized voting, Siddhartha Brahma (B. Tech. CSE, 2001-2005), Sandeep Macharla (M. Tech. CSE 2004), S. P. Pal and Sudhir Kumar Singh (M. Sc. Maths. and Computing, 2004), presented in the 1st International Conference on Distributed Computing and Internet Technology, Bhubaneshwar, India, Dec. 2004.

Exact and Robust Computing

S. P. Pal, Rakesh Kumar Koul (M. S. 1998-2000), Frahad Musadeekh, P. H. D. Ramakrishna (M. Tech. CSE 1998-2000) and Hironmay Basu (B. Tech. CSE 1999-2003)
Computations that require higher than double precision for robust and exact decision making, International Journal of Computer Mathematics, vol. 81, no. 5, pp. 595-605, May 2004.

Frahad Musadeekh and S. P. Pal,
Using very small error bounds for exactly computing signs of expressions,
Proc. of the National Conference on Mathematical and Computational Models, December 27-28, 2001, PSG College of Technology, Coimbatore, Tamil Nadu, India.

P. H. D. Ramakrishna (M. Tech. 1998-2000), Sudebkumar Prasant Pal, Samir Bhalla (M. Tech. 2001-2003), Hironmay Basu (B. Tech. 1999-2003) and Sudhir Kumar Singh (M. Sc. Maths and Computing, 1999-2004),
Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials (click here to download from http://arXiv.org),
Proceedings of the International Conference on Analysis and Discrete Structures, December 2002 (ICADS 2002).

Siddhartha Brahma (B Tech CSE 2001-2005), P. H. D. Ramakrishna (M Tech CSE 1998-2000) and S. P. 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, International Journal of Computer Mathematics, vol. 81, no. 12, pp. 1549-1557, December 2004.

Tilings

Mridul Aanjaneya (B. Tech. CSE 2004-08) and S. P. Pal, Faultfree Tromino Tilings of Rectangles, eprint math.CO/0610925 http://www.arxiv.org

Weak Visibility

S. K. Ghosh (TIFR Mumbai), A. Maheshwari, S. P. Pal, S. Saluja and C. E. Veni
Madhavan (IISc Bangalore),
Characterizing and recognizing weak visibility polygons,
Computational Geometry:
Theory and Applications, 3 (1993), pp. 213-233, Elsevier, North-Holland.

S. K. Ghosh (TIFR Mumbai), A. Maheshwari, S. P. Pal, S. Saluja and C. E. Veni
Madhavan (IISc Bangalore), Computing the shortest path tree in a weak visibility polygon,
Proceedings of the eleventh conference on
Foundations of Software Technology and Theoretical Computer Science,
New Delhi, India, Lecture Notes in Computer Science,
vol. 560, pp. 369-389, Springer-Verlag, 1991.
 
 A. R. Satapathy, S. P. Pal and M. Mukherjee, Accessibility by
manipulator with multiple stretchable links,
Proceedings of the Seventh National Seminar on Theoretical
Computer Science, Chennai, pp. C1-C6, June 1997.

S. K. Ghosh, A. Maheshwari, S. P. Pal, S. Saluja and C. E. Veni Madhavan,
Characterizing weak visibility polygons and related problems,
Proceedings of the Second Canadian Conference on
Computational Geometry, pp. 93-97, August 1990.