| Improved algorithms for the evacuation route planning problem G Mishra, S Mazumdar, A Pal Combinatorial Optimization and Applications: 9th International Conference …, 2015 | 20 | 2015 |
| On triangle estimation using tripartite independent set queries A Bhattacharya, A Bishnu, A Ghosh, G Mishra Theory of Computing Systems 65 (8), 1165-1192, 2021 | 16 | 2021 |
| Parameterized query complexity of hitting set using stability of sunflowers A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh 29th International Symposium on Algorithms and Computation (ISAAC 2018), 25 …, 2018 | 14 | 2018 |
| Methods and systems for planning evacuation paths A Pal, G Mishra, S Mazumdar US Patent 9,972,176, 2018 | 13 | 2018 |
| Faster counting and sampling algorithms using colorful decision oracle A Bhattacharya, A Bishnu, A Ghosh, G Mishra ACM Transactions on Computation Theory 16 (2), 1-19, 2024 | 11 | 2024 |
| Hyperedge estimation using polylogarithmic subset queries A Bhattacharya, A Bishnu, A Ghosh, G Mishra arXiv preprint arXiv:1908.04196, 2019 | 11 | 2019 |
| Testing of index-invariant properties in the huge object model S Chakraborty, E Fischer, A Ghosh, G Mishra, S Sen The Thirty Sixth Annual Conference on Learning Theory, 3065-3136, 2023 | 8 | 2023 |
| Exploring the gap between tolerant and non-tolerant distribution testing S Chakraborty, E Fischer, A Ghosh, G Mishra, S Sen Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022 | 7 | 2022 |
| Even the Easiest (?) Graph Coloring Problem Is Not Easy in Streaming! A Bhattacharya, A Bishnu, G Mishra, A Upasana arXiv preprint arXiv:2010.13143, 2020 | 7 | 2020 |
| Triangle estimation using polylogarithmic queries A Bhattacharya, A Bishnu, A Ghosh, G Mishra CoRR, abs/1808.00691, 2018 | 7 | 2018 |
| On parallel k-center clustering S Coy, A Czumaj, G Mishra Proceedings of the 35th ACM symposium on parallelism in algorithms and …, 2023 | 6 | 2023 |
| Query complexity of global minimum cut A Bishnu, A Ghosh, G Mishra, M Paraashar arXiv preprint arXiv:2007.09202, 2020 | 6 | 2020 |
| On the streaming complexity of fundamental geometric problems A Bishnu, A Ghosh, G Mishra, S Sen arXiv preprint arXiv:1803.06875, 2018 | 5 | 2018 |
| Parallel derandomization for coloring S Coy, A Czumaj, P Davies-Peck, G Mishra Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 31-32, 2024 | 4 | 2024 |
| Optimal (degree+ 1)-coloring in Congested Clique S Coy, A Czumaj, P Davies, G Mishra arXiv preprint arXiv:2306.12071, 2023 | 4 | 2023 |
| Grid obstacle representation of graphs A Bishnu, A Ghosh, R Mathew, G Mishra, S Paul arXiv preprint arXiv:1708.01765, 2017 | 4* | 2017 |
| A tight lower bound for 3-coloring grids in the online-local model YJ Chang, G Mishra, HT Nguyen, M Yang, YC Yeh Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing …, 2024 | 3 | 2024 |
| Fast parallel degree+ 1 list coloring S Coy, A Czumaj, P Davies, G Mishra arXiv e-prints, arXiv: 2302.04378, 2023 | 3 | 2023 |
| Distance estimation between unknown matrices using sublinear projections on hamming cube A Bishnu, A Ghosh, G Mishra arXiv preprint arXiv:2107.02666, 2021 | 3 | 2021 |
| Fixed parameter tractability of graph deletion problems over data streams A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh International Computing and Combinatorics Conference, 652-663, 2020 | 3 | 2020 |
