In 1993, I received the Rajiv Gandhi Research Grant for Innovative Ideas in Science and Technology, 1993, from The Rajiv Gandhi Foundation and Jawaharlal Nehru Centre for Advanced Scientific Research (JNCASR), Jakkur, Bangalore. This marked the initiation of research on visibility problems where (multiple) reflections were considered for visibility between two points.

My current research encompasses the design and analysis of approximation and online algorithms for combinatorial and geometric problems, graph labelling, quantum computing for approximate problem solving and machine learning, and scalable blockchain design.

Euclidean shortest paths, link paths and reflection paths between points inside polygons provide local information about the shape of the entire polygonal region. I am working on some problems about characterizing the shape and combinatorial properties of polygonal regions in terms of properties of such paths.

I am also working on estimating bounds on the sizes of separating and bisecting families for set systems (hypergraphs).

You can take a look at all my citations over here.

Following is a list of some of my research collaborators in alphabetical order-

Aronov, Boris– Brooklyn Polytechnic, New York, USA (Professor).

Dey, Tamal Krishna– Professor, Purdue University, USA.

Kumar, Somesh– Department of Mathematics, Indian Institute of Technology, Kharagpur, 721302, India.

Maheshwari, Anil– Professor, Carleton University, Ontario.

Nandy, Subhas Chandra– ACM Unit, Professor, ISI Kolkata.

Prasad, D. Chithra– Ph D (CSE, 1997) T K M College of Engineering, Retired Professor and Head, Quilon, Kerala, India.

Ramakrishna, P. H. D.– M Tech (CSE) 2002, DSP, Andhra Pradesh, India.

Sarangi, Smruti — B Tech (CSE) 1998-2002, UIUC (Ph. D.), in IIT Delhi CSE faculty.

Sarkar, Dilip– Department of Computer Science, University of Miami, Coral Gables, Florida, USA.

Swami Sarvottamananda, Vice-Chancellor, RKMVERI, Belur Math, Belur, Howrah, India.

Singh, Sudhir Kumar– M Sc (4th year, 1999-2004), Department of Mathematics, Indian Institute of Technology, Kharagpur, done Ph D from UCLA.

R. Srikanth, Poornaprajna Institute of Scientific Research, Devanahalli, Bengaluru.

Veni Madhavan, C. E.– Indian Institute of Science, Bangalore, 560012, India (Retired)

Partial list of students:

Undergraduates who worked in Computational Geometry– Siddhartha Brahma (B Tech 2005, PGM winner), and Mridul Aanjaneya (B. Tech. 2008, PhD Stanford University, now in Rutgers University faculty).

Anupam Prakash (B. Tech. 2007) worked on approximation algorithms, did Ph D from UC Berkeley

Arindam Khan worked on art gallery theorems and algorithms for visibility with reflections (dual degree M. Tech. 2009, now in the CSA faculty of IISc Bangalore.)

Arijit Ghosh (now in the faculty of ISI Kolkata) and Virendra Singh Shekhawat (both B. Tech 2007), worked on combinatorial (hypergraph-theoretic) aspects of multi-partite entanglements.

PhD students-

Tapas Kumar Mishra. PhD Thesis, Bisecting families for set systems and related problems, 2017.

D. Chithra Prasad, worked on visibility with reflections, Ph D 1997.

And some earlier B Tech and M Tech theses-

Development of a quantum circuit builder by Payardha Manoj, July 2008, B Tech thesis.

Fault-tolerant quantum computation by Arijit Ghosh (co-supervisor Prof. Raussendorf, University of British Columbia), May 2008, M Tech thesis.

Polygon and fortress guarding by diffuse reflection by Abhinav Anand, May 2010, B Tech thesis.

Diffuse visibility problems in simple polytopes in 2 and 3 dimensions by Siddhartha Brahma, May 7, 2005, B Tech thesis.

Bounding the communication complexity of hypergraph bicoloring games by Nitin Kumar, May 2008, M Tech thesis.

Classical and entanglement-assisted communication complexity of hypergraph bicoloring games by Rahul Bhalchandra Gokhale, April 2007, M Tech thesis.

Visibility regions in polygons: VC-dimensions and approximation algorithms by Satheesh Dannuri, April 2014, M Tech thesis.

Applications of Lovasz local lemma: Existence and computation of combinatorial structures by Ramneet Kaur, April 2014, M Tech thesis.