| Popular mixed matchings T Kavitha, J Mestre, M Nasre Theoretical Computer Science 412 (24), 2679-2690, 2011 | 94 | 2011 |
| Betweenness centrality–incremental and faster M Nasre, M Pontecorvi, V Ramachandran International Symposium on Mathematical Foundations of Computer Science, 577-588, 2014 | 59 | 2014 |
| Optimal popular matchings T Kavitha, M Nasre Discrete Applied Mathematics 157 (14), 3181-3186, 2009 | 52 | 2009 |
| Enumerating all possible biosynthetic pathways in metabolic networks A Ravikrishnan, M Nasre, K Raman Scientific reports 8 (1), 9932, 2018 | 35 | 2018 |
| Rainbow connectivity: Hardness and tractability P Ananth, M Nasre, KK Sarpatwar IARCS annual conference on foundations of software technology and …, 2011 | 34 | 2011 |
| Bounded unpopularity matchings CC Huang, T Kavitha, D Michail, M Nasre Algorithmica 61 (3), 738-757, 2011 | 29 | 2011 |
| Popular matching with lower quotas M Nasre, P Nimbhorkar arXiv preprint arXiv:1704.07546, 2017 | 24 | 2017 |
| Popular mixed matchings T Kavitha, J Mestre, M Nasre International Colloquium on Automata, Languages, and Programming, 574-584, 2009 | 20 | 2009 |
| 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 | 17 | 2023 |
| Matchings with group fairness constraints: Online and offline algorithms GS Sankar, A Louis, M Nasre, P Nimbhorkar arXiv preprint arXiv:2105.09522, 2021 | 17 | 2021 |
| Popularity in the generalized hospital residents setting M Nasre, A Rawat International Computer Science Symposium in Russia, 245-259, 2017 | 17 | 2017 |
| Popularity at minimum cost T Kavitha, M Nasre, P Nimbhorkar Journal of Combinatorial Optimization 27 (3), 574-596, 2014 | 17 | 2014 |
| How good are popular matchings? M Nasre, P Nimbhorkar, A Rawat arXiv preprint arXiv:1805.01311, 2018 | 13 | 2018 |
| Popular matchings with variable item copies T Kavitha, M Nasre Theoretical Computer Science 412 (12-14), 1263-1274, 2011 | 12 | 2011 |
| Decremental all-pairs all shortest paths and betweenness centrality M Nasre, M Pontecorvi, V Ramachandran International Symposium on Algorithms and Computation, 766-778, 2014 | 10 | 2014 |
| Rank-maximal matchings–structure and algorithms P Ghosal, M Nasre, P Nimbhorkar International Symposium on Algorithms and Computation, 593-605, 2014 | 9* | 2014 |
| Popular matchings: Structure and strategic issues M Nasre SIAM Journal on Discrete Mathematics 28 (3), 1423-1448, 2014 | 9 | 2014 |
| Popular matchings with variable job capacities T Kavitha, M Nasre International Symposium on Algorithms and Computation, 423-433, 2009 | 9 | 2009 |
| 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 | 8 | 2021 |
| Popular Matchings--structure and cheating strategies M Nasre arXiv preprint arXiv:1301.0902, 2013 | 8 | 2013 |
