Education

06.2011 — M.Sc. and Ph.D. in Computer Science
Institution: Tata Institute of Fundamental Research (Mumbai)
Thesis title: Coloring, Embedding, Compression and Data Structure Problems on Uniform Hypergraphs
Advisor: J. Radhakrishnan

05.2005 — B.E. in Computer Science and Engineering
Institution: Jadavpur University (Kolkata)

Scientific interests

Discrete geometry, graph theory, algorithms.

Selected publications

1. R. Gangopadhyay and S. Shannigrahi. Rectilinear Crossings in Complete Balanced d-Partite d-Uniform Hypergraphs. Graphs and Combinatorics 36, 905–911, 2020.
2. R. Gangopadhyay and S. Shannigrahi. k-Sets and rectilinear crossings in complete uniform hypergraphs. Computational Geometry: Theory and Applications 86, 101578, 2020.
3. A. Anshu, R. Gangopadhyay, S. Shannigrahi and S. Vusirikala. On the rectilinear crossing number of complete uniform hypergraphs. Computational Geometry: Theory and Applications 61, 38–47, 2017.
4. J. Mathews, M. K. Panda and S. Shannigrahi. On the construction of non-2-colorable uniform hypergraphs. Discrete Applied Mathematics 180, 181–187, 2015.
5. J. Radhakrishnan, S. Shah and S. Shannigrahi. Data structures for storing small sets in the bitprobe model. Proc. 18th Annual European Symposium on Algorithms (ESA), 159–170, 2010.

Additional Information

saswata.shannigrahi@gmail.com

See my curriculum vitae (in English).

Teaching