Polychromatic colorings of plane graphs N Alon, R Berke, K Buchin, M Buchin, P Csorba, S Shannigrahi, ... Discrete & Computational Geometry 42 (3), 421-442, 2009 | 38 | 2009 |

Data structures for storing small sets in the bitprobe model J Radhakrishnan, S Shah, S Shannigrahi European Symposium on Algorithms, 159-170, 2010 | 20 | 2010 |

Streaming algorithms for 2-coloring uniform hypergraphs J Radhakrishnan, S Shannigrahi Workshop on Algorithms and Data Structures, 667-678, 2011 | 13* | 2011 |

Efficient prüfer-like coding and counting labelled hypertrees S Shannigrahi, SP Pal Algorithmica 54 (2), 208-225, 2009 | 8 | 2009 |

On the NP-hardness of speed scaling with sleep state G Kumar, S Shannigrahi Theoretical Computer Science 600, 1-10, 2015 | 6 | 2015 |

A lower bound on the crossing number of uniform hypergraphs A Anshu, S Shannigrahi Discrete Applied Mathematics 209, 11-15, 2016 | 5 | 2016 |

On the construction of non-2-colorable uniform hypergraphs J Mathews, MK Panda, S Shannigrahi Discrete Applied Mathematics 180, 181-187, 2015 | 5 | 2015 |

On the rectilinear crossing number of complete uniform hypergraphs A Anshu, R Gangopadhyay, S Shannigrahi, S Vusirikala Computational Geometry 61, 38-47, 2017 | 4 | 2017 |

Improved Bounds for Uniform Hypergraphs without Property B S Aglave, VA Amarnath, S Shannigrahi, S Singh Australasian Journal of Combinatorics, Volume 76 (1), pages 73-86, 2020 | 3* | 2020 |

New online algorithm for dynamic speed scaling with sleep state G Kumar, S Shannigrahi Theoretical Computer Science 593, 79-87, 2015 | 3 | 2015 |

k-Sets and rectilinear crossings in complete uniform hypergraphs R Gangopadhyay, S Shannigrahi Computational Geometry 86, 101578, 2020 | 2 | 2020 |

Rectilinear Crossings in Complete Balanced *d*-Partite *d*-Uniform HypergraphsR Gangopadhyay, S Shannigrahi Graphs and Combinatorics, 1-7, 2020 | | 2020 |

On the Simple Quasi Crossing Number of A Pitchanathan, S Shannigrahi Proc. Graph Drawing, LNCS 11904, pages 612-614, 2019 | | 2019 |