Prajakta Nimbhorkar

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 39

Top Topics

Constant Factor Approximation

Online Algorithms

Top Venues

J. Comb. Optim.

Electron. Colloquium Comput. Complex.

Publications

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