Prajakta Nimbhorkar

78 papers A* 7A 5B 11Misc 2Journal 45Unranked 8
YearRankTypeTitle / Venue / Authors
2026 A* conf
Group Fair Matchings Using Convex Cost Functions.
AAAI
Atasi Panda, Harsh Sharma, Anand Louis, Prajakta Nimbhorkar
2025 A* conf
(Almost Full) EFX for Three (and More) Types of Agents.
AAAI
Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma
2025 J jnl
Almost and Approximate EFX for Few Types of Agents.
CoRR
Vishwa Prakash HV, Ruta Mehta, Prajakta Nimbhorkar
2025 A* conf
EFX Exists for Three Types of Agents.
EC
Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma
2025 A conf
Fair Division in a Variable Setting.
AAMAS
Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi
2025 J jnl
Group Fair Matchings using Convex Cost Functions.
CoRR
Atasi Panda, Harsh Sharma, Anand Louis, Prajakta Nimbhorkar
2025 A* conf
Optimal Capacity Modification for Stable Matchings with Ties.
IJCAI
Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar
2024 J jnl
EFX Exists for Three Types of Agents.
CoRR
Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma
2024 J jnl
Fair Division in a Variable Setting.
CoRR
Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi
2024 A* conf
Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All.
IJCAI
Atasi Panda, Anand Louis, Prajakta Nimbhorkar
2024 J jnl
Launching Identity Testing into (Bounded) Space.
Electron. Colloquium Comput. Complex.
Pranav Bisht, Nikhil Gupta, Prajakta Nimbhorkar, Ilya Volkovich
2024 J jnl
Optimal Capacity Modification for Strongly Stable Matchings.
CoRR
Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar
2024 J jnl
Popular critical matchings in the many-to-many setting.
Theor. Comput. Sci.
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
2024 A conf
Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings.
AAMAS
Vishwa Prakash HV, Prajakta Nimbhorkar
2023 B conf
Critical Relaxed Stable Matchings with Two-Sided Ties.
WG
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
2023 J jnl
Critical Relaxed Stable Matchings with Two-Sided Ties.
CoRR
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
2023 J jnl
EFX Exists for Four Agents with Three Types of Valuations.
CoRR
Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma
2023 J jnl
Envy-freeness and relaxed stability: hardness and approximation algorithms.
J. Comb. Optim.
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
2023 — conf
Fair Healthcare Rationing to Maximize Dynamic Utilities.
PAKDD (2)
Aadityan Ganesh, Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar
2023 J jnl
Fair Healthcare Rationing to Maximize Dynamic Utilities.
CoRR
Aadityan Ganesh, Prajakta Nimbhorkar, Pratik Ghosal, Vishwa Prakash HV
2023 A conf
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.
ECAI
Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar
2023 J jnl
Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings.
CoRR
Vishwa Prakash HV, Prajakta Nimbhorkar
2022 J jnl
Bipartite Matchings with Group Fairness and Individual Fairness Constraints.
CoRR
Atasi Panda, Anand Louis, Prajakta Nimbhorkar
2022 J jnl
Matchings Under Diversity Constraints.
CoRR
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
2022 J jnl
Planar Graph Isomorphism Is in Log-Space.
ACM Trans. Comput. Theory
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2022 J jnl
Popular Critical Matchings in the Many-to-Many Setting.
CoRR
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
2022 B conf
Popular Edges with Critical Nodes.
ISAAC
Kushagra Chatterjee, Prajakta Nimbhorkar
2022 J jnl
Popular Edges with Critical Nodes.
CoRR
Kushagra Chatterjee, Prajakta Nimbhorkar
2021 B conf
Disjoint Stable Matchings in Linear Time.
WG
Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip
2021 A* conf
Matchings with Group Fairness Constraints: Online and Offline Algorithms.
IJCAI
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
2021 J jnl
Matchings with Group Fairness Constraints: Online and Offline Algorithms.
CoRR
Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar
2021 — conf
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.
FSTTCS
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar
2020 J jnl
Disjoint Stable Matchings in Linear Time.
CoRR
Aadityan Ganesh, Prajakta Nimbhorkar, Geevarghese Philip, Vishwa Prakash HV
2020 B conf
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms.
SAGT
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
2019 B conf
Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.
WG
Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath
2019 J jnl
Dynamic rank-maximal and popular matchings.
J. Comb. Optim.
Prajakta Nimbhorkar, V Arvind Rameshwar
2019 Misc conf
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties.
COCOON
Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy
2019 J jnl
Maximum-Size Envy-free Matchings.
CoRR
Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar
2019 J jnl
Rank-maximal matchings - structure and algorithms.
Theor. Comput. Sci.
Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
2018 J jnl
Computing the maximum using (min, +) formulas.
Electron. Colloquium Comput. Complex.
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
2018 J jnl
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings.
CoRR
Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath
2018 J jnl
Expanding Generating Sets for Solvable Permutation Groups.
SIAM J. Discret. Math.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2018 B conf
How Good Are Popular Matchings?.
SEA
Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat
2018 J jnl
How good are Popular Matchings?
CoRR
Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat
2018 J jnl
Shortest path length with bounded-alternation (min, +) formulas.
Electron. Colloquium Comput. Complex.
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
2017 B conf
Computing the Maximum using (min, +) Formulas.
MFCS
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
2017 J jnl
Dynamic Rank Maximal Matchings.
CoRR
Prajakta Nimbhorkar, V Arvind Rameshwar
2017 Misc conf
Dynamic Rank-Maximal Matchings.
COCOON
Prajakta Nimbhorkar, V Arvind Rameshwar
2017 J jnl
Popular Matching with Lower Quotas.
CoRR
Meghana Nasre, Prajakta Nimbhorkar
2017 — conf
Popular Matchings with Lower Quotas.
FSTTCS
Meghana Nasre, Prajakta Nimbhorkar
2014 J jnl
Popularity at minimum cost.
J. Comb. Optim.
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
2014 J jnl
Rank Maximal Matchings - Structure and Algorithms.
CoRR
Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
2014 B conf
Rank-Maximal Matchings - Structure and Algorithms.
ISAAC
Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar
2013 J jnl
Log-Space Algorithms for Paths and Matchings in k-Trees.
Theory Comput. Syst.
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
2012 B conf
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs.
LATIN
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
2012 J jnl
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
CoRR
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2012 B conf
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.
MFCS
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2012 J jnl
The planar k-means problem is NP-hard.
Theor. Comput. Sci.
Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
2011 J jnl
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
2011 J jnl
Expanding Generator Sets for Solvable Permutation Groups.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2011 A* conf
Pseudorandom generators for group products: extended abstract.
STOC
Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
2010 J jnl
Graph Isomorphism for K
Electron. Colloquium Comput. Complex.
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2010 A conf
Log-space Algorithms for Paths and Matchings in k-trees.
STACS
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
2010 J jnl
Longest Paths in Planar DAGs in Unambiguous Log-Space.
Chic. J. Theor. Comput. Sci.
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
2010 J jnl
Popularity at Minimum Cost
CoRR
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
2010 — conf
Popularity at Minimum Cost.
ISAAC (1)
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
2010 J jnl
Pseudorandom Generators for Group Products.
Electron. Colloquium Comput. Complex.
Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
2009 — conf
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.
FSTTCS
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2009 J jnl
Log-space Algorithms for Paths and Matchings in k-trees
CoRR
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
2009 — conf
Longest Paths in Planar DAGs in Unambiguous Logspace.
CATS
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
2009 A conf
Planar Graph Isomorphism is in Log-Space.
CCC
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2009 — conf
Planar Graph Isomorphism is in Log-Space.
Algebraic Methods in Computational Complexity
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2009 J jnl
Planar Graph Isomorphism is in Log-space.
Electron. Colloquium Comput. Complex.
Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf
2009 B conf
The Planar k-Means Problem is NP-Hard.
WALCOM
Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
2008 J jnl
3-connected Planar Graph Isomorphism is in Log-space
CoRR
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
2008 — conf
3-connected Planar Graph Isomorphism is in Log-space.
FSTTCS
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
2008 J jnl
A Log-space Algorithm for Canonization of Planar Graphs
CoRR
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
2008 J jnl
Longest paths in Planar DAGs in Unambiguous Logspace
CoRR
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar