| The planar k-means problem is NP-hard M Mahajan, P Nimbhorkar, K Varadarajan Theoretical Computer Science 442, 13-21, 2012 | 756 | 2012 |
| Planar graph isomorphism is in log-space S Datta, N Limaye, P Nimbhorkar, T Thierauf, F Wagner 2009 24th Annual IEEE Conference on Computational Complexity, 203-214, 2009 | 92 | 2009 |
| Pseudorandom generators for group products M Koucký, P Nimbhorkar, P Pudlák Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 64 | 2011 |
| Graph Isomorphism for K_ {3, 3}-free and K_5-free graphs is in Log-space S Datta, P Nimbhorkar, T Thierauf, F Wagner IARCS Annual Conference on Foundations of Software Technology and …, 2009 | 26 | 2009 |
| 3-connected planar graph isomorphism is in log-space S Datta, N Limaye, P Nimbhorkar arXiv preprint arXiv:0806.1041, 2008 | 26 | 2008 |
| Log-space algorithms for paths and matchings in k-trees B Das, S Datta, P Nimbhorkar Theory of Computing Systems 53 (4), 669-689, 2013 | 24 | 2013 |
| Popularity at minimum cost T Kavitha, M Nasre, P Nimbhorkar Journal of Combinatorial Optimization 27 (3), 574-596, 2014 | 17* | 2014 |
| Longest paths in planar dags in unambiguous logspace N Limaye, M Mahajan, P Nimbhorkar arXiv preprint arXiv:0802.1699, 2008 | 17 | 2008 |
| Classified rank-maximal matchings and popular matchings–algorithms and hardness M Nasre, P Nimbhorkar, N Pulath International Workshop on Graph-Theoretic Concepts in Computer Science, 244-257, 2019 | 15* | 2019 |
| Popular matching with lower quotas M Nasre, P Nimbhorkar arXiv preprint arXiv:1704.07546, 2017 | 14 | 2017 |
| Erdős-rényi sequences and deterministic construction of expanding cayley graphs V Arvind, P Mukhopadhyay, P Nimbhorkar Latin American Symposium on Theoretical Informatics, 37-48, 2012 | 9 | 2012 |
| Rank-maximal matchings–structure and algorithms P Ghosal, M Nasre, P Nimbhorkar International Symposium on Algorithms and Computation, 593-605, 2014 | 7* | 2014 |
| Envy-freeness and relaxed stability: Hardness and approximation algorithms P Krishnaa, G Limaye, M Nasre, P Nimbhorkar International Symposium on Algorithmic Game Theory, 193-208, 2020 | 6 | 2020 |
| Dynamic rank-maximal and popular matchings P Nimbhorkar, VA Rameshwar Journal of Combinatorial Optimization 37 (2), 523-545, 2019 | 5* | 2019 |
| Matchings with group fairness constraints: Online and offline algorithms GS Sankar, A Louis, M Nasre, P Nimbhorkar arXiv preprint arXiv:2105.09522, 2021 | 4 | 2021 |
| Expanding generating sets for solvable permutation groups V Arvind, P Mukhopadhyay, P Nimbhorkar, Y Vasudev SIAM Journal on Discrete Mathematics 32 (3), 1721-1740, 2018 | 4* | 2018 |
| Computing the maximum using (min,+) formulas M Mahajan, P Nimbhorkar, A Tawari 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017 | 3 | 2017 |
| Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas M Nasre, P Nimbhorkar, K Ranjan, A Sarkar 41st IARCS Annual Conference on Foundations of Software Technology and …, 2021 | 2 | 2021 |
| Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties K Gopal, M Nasre, P Nimbhorkar, TP Reddy International Computing and Combinatorics Conference, 193-205, 2019 | 2 | 2019 |
| Shortest path length with bounded-alternation ( min , + ) formulas M Mahajan, P Nimbhorkar, A Tawari International Journal of Advances in Engineering Sciences and Applied …, 2019 | 2 | 2019 |
Meena MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, IndiaVerified email at imsc.res.in
