Prajakta Nimbhorkar

According to our database, Prajakta Nimbhorkar authored at least 49 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Popular critical matchings in the many-to-many setting.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar

Theor. Comput. Sci., January, 2024

Launching Identity Testing into (Bounded) Space.

Pranav Bisht, Nikhil Gupta, Prajakta Nimbhorkar, Ilya Volkovich

Electron. Colloquium Comput. Complex., 2024

Optimal Capacity Modification for Strongly Stable Matchings.

Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2024

Fair Division in a Variable Setting.

Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi

CoRR, 2024

EFX Exists for Three Types of Agents.

Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar, Nithin Varma

CoRR, 2024

Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All.

Atasi Panda, Anand Louis, Prajakta Nimbhorkar

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings.

Vishwa Prakash HV, Prajakta Nimbhorkar

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Envy-freeness and relaxed stability: hardness and approximation algorithms.

Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar

J. Comb. Optim., 2023

EFX Exists for Four Agents with Three Types of Valuations.

Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma

CoRR, 2023

Critical Relaxed Stable Matchings with Two-Sided Ties.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Fair Healthcare Rationing to Maximize Dynamic Utilities.

Aadityan Ganesh, Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2023

Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints.

Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

2022

Matchings Under Diversity Constraints.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2022

Bipartite Matchings with Group Fairness and Individual Fairness Constraints.

Atasi Panda, Anand Louis, Prajakta Nimbhorkar

CoRR, 2022

Popular Critical Matchings in the Many-to-Many Setting.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan

CoRR, 2022

Popular Edges with Critical Nodes.

Kushagra Chatterjee, Prajakta Nimbhorkar

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Disjoint Stable Matchings in Linear Time.

Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms.

Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Disjoint Stable Matchings in Linear Time.

Prajakta Nimbhorkar, Geevarghese Philip, Vishwa Prakash HV

CoRR, 2020

2019

Rank-maximal matchings - structure and algorithms.

Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar

Theor. Comput. Sci., 2019

Dynamic rank-maximal and popular matchings.

Prajakta Nimbhorkar, V Arvind Rameshwar

J. Comb. Optim., 2019

Maximum-Size Envy-free Matchings.

Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2019

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness.

Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties.

Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018

Expanding Generating Sets for Solvable Permutation Groups.

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev

SIAM J. Discret. Math., 2018

Shortest path length with bounded-alternation (min, +) formulas.

Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari

Electron. Colloquium Comput. Complex., 2018

Computing the maximum using (min, +) formulas.

Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari

Electron. Colloquium Comput. Complex., 2018

Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings.

Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath

CoRR, 2018

How Good Are Popular Matchings?.

Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017

Popular Matching with Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar

CoRR, 2017

Popular Matchings with Lower Quotas.

Meghana Nasre, Prajakta Nimbhorkar

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Dynamic Rank-Maximal Matchings.

Prajakta Nimbhorkar, V Arvind Rameshwar

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2014

Popularity at minimum cost.

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

J. Comb. Optim., 2014

2013

Log-Space Algorithms for Paths and Matchings in k-Trees.

Bireswar Das, Samir Datta, Prajakta Nimbhorkar

Theory Comput. Syst., 2013

2012

The planar k-means problem is NP-hard.

Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan

Theor. Comput. Sci., 2012

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev

CoRR, 2012

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Expanding Generator Sets for Solvable Permutation Groups.

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev

Electron. Colloquium Comput. Complex., 2011

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar

Electron. Colloquium Comput. Complex., 2011

Pseudorandom generators for group products: extended abstract.

Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Pseudorandom Generators for Group Products.

Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák

Electron. Colloquium Comput. Complex., 2010

Graph Isomorphism for K_3,3-free and K₅-free graphs is in Log-space.

Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner

Electron. Colloquium Comput. Complex., 2010

Longest Paths in Planar DAGs in Unambiguous Log-Space.

Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar

Chic. J. Theor. Comput. Sci., 2010

2009

Planar Graph Isomorphism is in Log-space.

Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf

Electron. Colloquium Comput. Complex., 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

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Longest Paths in Planar DAGs in Unambiguous Logspace.

Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar

Proceedings of the Theory of Computing 2009, 2009

2008

A Log-space Algorithm for Canonization of Planar Graphs

Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner

CoRR, 2008

3-connected Planar Graph Isomorphism is in Log-space.

Samir Datta, Nutan Limaye, Prajakta Nimbhorkar

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008