| 2026 | AAAI | Group Fair Matchings Using Convex Cost Functions. | Atasi Panda, Harsh Sharma, Anand Louis, Prajakta Nimbhorkar |
| 2025 | AAAI | (Almost Full) EFX for Three (and More) Types of Agents. | Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma |
| 2025 | IJCAI | Optimal Capacity Modification for Stable Matchings with Ties. | Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar |
| 2024 | IJCAI | Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All. | Atasi Panda, Anand Louis, Prajakta Nimbhorkar |
| 2023 | ECAI | Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. | Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar |
| 2023 | PAKDD | Fair Healthcare Rationing to Maximize Dynamic Utilities. | Aadityan Ganesh, Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar |
| 2023 | WG | Critical Relaxed Stable Matchings with Two-Sided Ties. | Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan |
| 2022 | ISAAC | Popular Edges with Critical Nodes. | Kushagra Chatterjee, Prajakta Nimbhorkar |
| 2021 | IJCAI | Matchings with Group Fairness Constraints: Online and Offline Algorithms. | Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar |
| 2021 | WG | Disjoint Stable Matchings in Linear Time. | Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip |
| 2020 | SAGT | Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms. | Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar |
| 2019 | COCOON | Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. | Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy |
| 2019 | WG | Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. | Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath |
| 2017 | COCOON | Dynamic Rank-Maximal Matchings. | Prajakta Nimbhorkar, V Arvind Rameshwar |
| 2017 | MFCS | Computing the Maximum using (min, +) Formulas. | Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari |
| 2014 | ISAAC | Rank-Maximal Matchings - Structure and Algorithms. | Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar |
| 2012 | LATIN | Erdős-Rnyi Sequences and Deterministic Construction of Expanding Cayley Graphs. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
| 2012 | MFCS | Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
| 2011 | STOC | Pseudorandom generators for group products: extended abstract. | Michal Kouck, Prajakta Nimbhorkar, Pavel Pudlk |
| 2010 | ISAAC | Popularity at Minimum Cost. | Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar |
| 2010 | STACS | Log-space Algorithms for Paths and Matchings in k-trees. | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
| 2009 | WALCOM | The Planar k-Means Problem is NP-Hard. | Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan |