3-connected Planar Graph Isomorphism is in Log-space. - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar (FSTTCS, 2008)

A Log-space Algorithm for Canonization of Planar Graphs - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (CoRR, 2008)

Longest Paths in Planar DAGs in Unambiguous Logspace. - Nutan Limaye; Meena Mahajan; Prajakta Nimbhorkar (CATS, 2009)

Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. - Samir Datta; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (FSTTCS, 2009)

Planar Graph Isomorphism is in Log-space. - Fabian Wagner; Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2009)

Longest Paths in Planar DAGs in Unambiguous Log-Space. - Nutan Limaye; Meena Mahajan; Prajakta Nimbhorkar (Chic. J. Theor. Comput. Sci., 2010)

Graph Isomorphism for K3,3-free and K5-free graphs is in Log-space. - Samir Datta; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (Electron. Colloquium Comput. Complex., 2010)

Pseudorandom Generators for Group Products. - Michal Koucký 001; Prajakta Nimbhorkar; Pavel Pudlák (Electron. Colloquium Comput. Complex., 2010)

Pseudorandom generators for group products: extended abstract. - Michal Koucký 001; Prajakta Nimbhorkar; Pavel Pudlák (STOC, 2011)

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar (Electron. Colloquium Comput. Complex., 2011)

Expanding Generator Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (Electron. Colloquium Comput. Complex., 2011)

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (MFCS, 2012)

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (CoRR, 2012)

The planar k-means problem is NP-hard. - Meena Mahajan; Prajakta Nimbhorkar; Kasturi R. Varadarajan (Theor. Comput. Sci., 2012)

Log-Space Algorithms for Paths and Matchings in k-Trees. - Bireswar Das; Samir Datta; Prajakta Nimbhorkar (Theory Comput. Syst., 2013)

Popularity at minimum cost. - Telikepalli Kavitha; Meghana Nasre; Prajakta Nimbhorkar (J. Comb. Optim., 2014)

Dynamic Rank-Maximal Matchings. - Prajakta Nimbhorkar; V Arvind Rameshwar 001 (COCOON, 2017)

Popular Matchings with Lower Quotas. - Meghana Nasre; Prajakta Nimbhorkar (FSTTCS, 2017)

Popular Matching with Lower Quotas. - Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2017)

How Good Are Popular Matchings?. - Krishnapriya A. M; Meghana Nasre; Prajakta Nimbhorkar; Amit Rawat (SEA, 2018)

Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. - Meghana Nasre; Prajakta Nimbhorkar; Nada Pulath (CoRR, 2018)

Computing the maximum using (min, +) formulas. - Meena Mahajan; Prajakta Nimbhorkar; Anuj Tawari (Electron. Colloquium Comput. Complex., 2018)

Shortest path length with bounded-alternation (min, +) formulas. - Meena Mahajan; Prajakta Nimbhorkar; Anuj Tawari (Electron. Colloquium Comput. Complex., 2018)

Expanding Generating Sets for Solvable Permutation Groups. - Vikraman Arvind; Partha Mukhopadhyay; Prajakta Nimbhorkar; Yadu Vasudev (SIAM J. Discret. Math., 2018)

Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. - Kavitha Gopal; Meghana Nasre; Prajakta Nimbhorkar; T. Pradeep Reddy (COCOON, 2019)

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. - Meghana Nasre; Prajakta Nimbhorkar; Nada Pulath (WG, 2019)

Maximum-Size Envy-free Matchings. - Prem Krishnaa; Girija Limaye; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2019)

Dynamic rank-maximal and popular matchings. - Prajakta Nimbhorkar; V Arvind Rameshwar 001 (J. Comb. Optim., 2019)

Rank-maximal matchings - structure and algorithms. - Pratik Ghosal; Meghana Nasre; Prajakta Nimbhorkar (Theor. Comput. Sci., 2019)

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan; Ankita Sarkar (FSTTCS, 2021)

Matchings with Group Fairness Constraints: Online and Offline Algorithms. - Govind S. Sankar; Anand Louis; Meghana Nasre; Prajakta Nimbhorkar (IJCAI, 2021)

Disjoint Stable Matchings in Linear Time. - Aadityan Ganesh; Vishwa Prakash HV; Prajakta Nimbhorkar; Geevarghese Philip (WG, 2021)

Popular Edges with Critical Nodes. - Kushagra Chatterjee; Prajakta Nimbhorkar (ISAAC, 2022)

Popular Critical Matchings in the Many-to-Many Setting. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan (CoRR, 2022)

Bipartite Matchings with Group Fairness and Individual Fairness Constraints. - Atasi Panda; Anand Louis; Prajakta Nimbhorkar (CoRR, 2022)

Matchings Under Diversity Constraints. - Govind S. Sankar; Anand Louis; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2022)

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. - Anand Louis; Meghana Nasre; Prajakta Nimbhorkar; Govind S. Sankar (ECAI, 2023)

Fair Healthcare Rationing to Maximize Dynamic Utilities. - Aadityan Ganesh; Pratik Ghosal; Vishwa Prakash HV; Prajakta Nimbhorkar (PAKDD (2), 2023)

Critical Relaxed Stable Matchings with Two-Sided Ties. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan (WG, 2023)

EFX Exists for Four Agents with Three Types of Valuations. - Pratik Ghosal; Vishwa Prakash HV; Prajakta Nimbhorkar; Nithin Varma 001 (CoRR, 2023)

Envy-freeness and relaxed stability: hardness and approximation algorithms. - Prem Krishnaa; Girija Limaye; Meghana Nasre; Prajakta Nimbhorkar (J. Comb. Optim., 2023)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings. - Vishwa Prakash HV; Prajakta Nimbhorkar (AAMAS, 2024)

Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All. - Atasi Panda; Anand Louis; Prajakta Nimbhorkar (IJCAI, 2024)

Optimal Capacity Modification for Strongly Stable Matchings. - Keshav Ranjan; Meghana Nasre; Prajakta Nimbhorkar (CoRR, 2024)

Launching Identity Testing into (Bounded) Space. - Pranav Bisht; Nikhil Gupta 008; Prajakta Nimbhorkar; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2024)

Popular critical matchings in the many-to-many setting. - Meghana Nasre; Prajakta Nimbhorkar; Keshav Ranjan; Ankita Sarkar (Theor. Comput. Sci., 2024)

(Almost Full) EFX for Three (and More) Types of Agents. - Pratik Ghosal; Vishwa Prakash HV; Prajakta Nimbhorkar; Nithin Varma 001 (AAAI, 2025)

Fair Division in a Variable Setting. - Harish Chandramouleeswaran; Prajakta Nimbhorkar; Nidhi Rathi (AAMAS, 2025)

EFX Exists for Three Types of Agents. - Vishwa Prakash HV; Pratik Ghosal; Prajakta Nimbhorkar; Nithin Varma 001 (EC, 2025)