| The planar k-means problem is NP-hard M Mahajan, P Nimbhorkar, K Varadarajan Theoretical Computer Science 442, 13-21, 2012 | 894 | 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 | 107 | 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 | 67 | 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 | 29 | 2009 |
| 3-connected planar graph isomorphism is in log-space S Datta, N Limaye, P Nimbhorkar arXiv preprint arXiv:0806.1041, 2008 | 26 | 2008 |
| Popular matching with lower quotas M Nasre, P Nimbhorkar arXiv preprint arXiv:1704.07546, 2017 | 25 | 2017 |
| Log-Space Algorithms for Paths and Matchings in k-Trees B Das, S Datta, P Nimbhorkar Theory of Computing Systems 53, 669-689, 2013 | 25 | 2013 |
| Envy-freeness and relaxed stability: hardness and approximation algorithms P Krishnaa, G Limaye, M Nasre, P Nimbhorkar Journal of Combinatorial Optimization 45 (1), 41, 2023 | 19 | 2023 |
| Matchings with group fairness constraints: Online and offline algorithms GS Sankar, A Louis, M Nasre, P Nimbhorkar arXiv preprint arXiv:2105.09522, 2021 | 18 | 2021 |
| Longest paths in planar dags in unambiguous logspace N Limaye, M Mahajan, P Nimbhorkar arXiv preprint arXiv:0802.1699, 2008 | 17 | 2008 |
| Popularity at minimum cost T Kavitha, M Nasre, P Nimbhorkar Journal of Combinatorial Optimization 27 (3), 574-596, 2014 | 16 | 2014 |
| Dynamic rank-maximal and popular matchings P Nimbhorkar, VA Rameshwar Journal of Combinatorial Optimization 37, 523-545, 2019 | 15* | 2019 |
| How good are Popular Matchings? M Nasre, P Nimbhorkar, A Rawat arXiv preprint arXiv:1805.01311, 2018 | 13 | 2018 |
| 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 | 9 | 2021 |
| Rank-maximal matchings–structure and algorithms P Ghosal, M Nasre, P Nimbhorkar International Symposium on Algorithms and Computation, 593-605, 2014 | 9* | 2014 |
| Erdős-rényi sequences and deterministic construction of expanding cayley graphs V Arvind, P Mukhopadhyay, P Nimbhorkar LATIN 2012: Theoretical Informatics: 10th Latin American Symposium, Arequipa …, 2012 | 9 | 2012 |
| Computing the maximum using (min,+) formulas M Mahajan, P Nimbhorkar, A Tawari 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017 | 8 | 2017 |
| 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 | 6 | 2019 |
| Shortest path length with bounded-alternation formulas M Mahajan, P Nimbhorkar, A Tawari International Journal of Advances in Engineering Sciences and Applied …, 2019 | 4 | 2019 |
| 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 |
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, India在 imsc.res.in 的电子邮件经过验证
