default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrajakta Nimbhorkar
Person information
- affiliation: Chennai Mathematical Institute, Tamilnadu, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
, Ankita Sarkar:
Popular critical matchings in the many-to-many setting. Theor. Comput. Sci. 982: 114281 (2024)- [c27]Vishwa Prakash HV, Prajakta Nimbhorkar:
Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings. AAMAS 2024: 780-788 - [c26]Atasi Panda, Anand Louis, Prajakta Nimbhorkar:
Individual Fairness under Group Fairness Constraints in Bipartite Matching - One Framework to Approximate Them All. IJCAI 2024: 175-183 - [i31]Pranav Bisht, Nikhil Gupta, Prajakta Nimbhorkar, Ilya Volkovich:
Launching Identity Testing into (Bounded) Space. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j9]Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar:
Envy-freeness and relaxed stability: hardness and approximation algorithms. J. Comb. Optim. 45(1): 41 (2023) - [c25]Anand Louis, Meghana Nasre, Prajakta Nimbhorkar, Govind S. Sankar:
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints. ECAI 2023: 1601-1608 - [c24]Aadityan Ganesh, Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar:
Fair Healthcare Rationing to Maximize Dynamic Utilities. PAKDD (2) 2023: 231-242 - [c23]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Critical Relaxed Stable Matchings with Two-Sided Ties. WG 2023: 447-461 - [i30]Pratik Ghosal, Vishwa Prakash HV, Prajakta Nimbhorkar, Nithin Varma:
EFX Exists for Four Agents with Three Types of Valuations. CoRR abs/2301.10632 (2023) - [i29]Aadityan Ganesh, Prajakta Nimbhorkar, Pratik Ghosal, Vishwa Prakash HV:
Fair Healthcare Rationing to Maximize Dynamic Utilities. CoRR abs/2303.11053 (2023) - [i28]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Critical Relaxed Stable Matchings with Two-Sided Ties. CoRR abs/2303.12325 (2023) - [i27]Vishwa Prakash HV, Prajakta Nimbhorkar:
Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings. CoRR abs/2312.15479 (2023) - 2022
- [j8]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism Is in Log-Space. ACM Trans. Comput. Theory 14(2): 8:1-8:33 (2022) - [c22]Kushagra Chatterjee, Prajakta Nimbhorkar:
Popular Edges with Critical Nodes. ISAAC 2022: 54:1-54:14 - [i26]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan:
Popular Critical Matchings in the Many-to-Many Setting. CoRR abs/2206.12394 (2022) - [i25]Atasi Panda, Anand Louis, Prajakta Nimbhorkar:
Bipartite Matchings with Group Fairness and Individual Fairness Constraints. CoRR abs/2208.09951 (2022) - [i24]Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar:
Matchings Under Diversity Constraints. CoRR abs/2208.11378 (2022) - [i23]Kushagra Chatterjee, Prajakta Nimbhorkar:
Popular Edges with Critical Nodes. CoRR abs/2209.10805 (2022) - 2021
- [c21]Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar:
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. FSTTCS 2021: 30:1-30:21 - [c20]Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar:
Matchings with Group Fairness Constraints: Online and Offline Algorithms. IJCAI 2021: 377-383 - [c19]Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip:
Disjoint Stable Matchings in Linear Time. WG 2021: 94-105 - [i22]Govind S. Sankar, Anand Louis, Meghana Nasre, Prajakta Nimbhorkar:
Matchings with Group Fairness Constraints: Online and Offline Algorithms. CoRR abs/2105.09522 (2021) - 2020
- [c18]Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar:
Envy-Freeness and Relaxed Stability: Hardness and Approximation Algorithms. SAGT 2020: 193-208 - [i21]Prajakta Nimbhorkar, Geevarghese Philip, Vishwa Prakash HV:
Disjoint Stable Matchings in Linear Time. CoRR abs/2011.13248 (2020)
2010 – 2019
- 2019
- [j7]Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic rank-maximal and popular matchings. J. Comb. Optim. 37(2): 523-545 (2019) - [j6]Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar:
Rank-maximal matchings - structure and algorithms. Theor. Comput. Sci. 767: 73-82 (2019) - [c17]Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy:
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties. COCOON 2019: 193-205 - [c16]Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath:
Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness. WG 2019: 244-257 - [i20]Prem Krishnaa, Girija Limaye, Meghana Nasre, Prajakta Nimbhorkar:
Maximum-Size Envy-free Matchings. CoRR abs/1910.07159 (2019) - 2018
- [j5]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. 32(3): 1721-1740 (2018) - [c15]Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat:
How Good Are Popular Matchings?. SEA 2018: 9:1-9:14 - [i19]Krishnapriya A. M, Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat:
How good are Popular Matchings? CoRR abs/1805.01311 (2018) - [i18]Meghana Nasre, Prajakta Nimbhorkar, Nada Pulath:
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings. CoRR abs/1805.02851 (2018) - [i17]Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari:
Computing the maximum using (min, +) formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari:
Shortest path length with bounded-alternation (min, +) formulas. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c14]Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic Rank-Maximal Matchings. COCOON 2017: 433-444 - [c13]Meghana Nasre, Prajakta Nimbhorkar:
Popular Matchings with Lower Quotas. FSTTCS 2017: 44:1-44:15 - [c12]Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari:
Computing the Maximum using (min, +) Formulas. MFCS 2017: 74:1-74:11 - [i15]Prajakta Nimbhorkar, V Arvind Rameshwar:
Dynamic Rank Maximal Matchings. CoRR abs/1704.00899 (2017) - [i14]Meghana Nasre, Prajakta Nimbhorkar:
Popular Matching with Lower Quotas. CoRR abs/1704.07546 (2017) - 2014
- [j4]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at minimum cost. J. Comb. Optim. 27(3): 574-596 (2014) - [c11]Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar:
Rank-Maximal Matchings - Structure and Algorithms. ISAAC 2014: 593-605 - [i13]Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar:
Rank Maximal Matchings - Structure and Algorithms. CoRR abs/1409.4977 (2014) - 2013
- [j3]Bireswar Das, Samir Datta, Prajakta Nimbhorkar:
Log-Space Algorithms for Paths and Matchings in k-Trees. Theory Comput. Syst. 53(4): 669-689 (2013) - 2012
- [j2]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The planar k-means problem is NP-hard. Theor. Comput. Sci. 442: 13-21 (2012) - [c10]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. LATIN 2012: 37-48 - [c9]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. MFCS 2012: 112-123 - [i12]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups. CoRR abs/1201.3181 (2012) - 2011
- [c8]Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák:
Pseudorandom generators for group products: extended abstract. STOC 2011: 263-272 - [i11]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. Electron. Colloquium Comput. Complex. TR11 (2011) - [i10]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generator Sets for Solvable Permutation Groups. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j1]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Log-Space. Chic. J. Theor. Comput. Sci. 2010 (2010) - [c7]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at Minimum Cost. ISAAC (1) 2010: 145-156 - [c6]Bireswar Das, Samir Datta, Prajakta Nimbhorkar:
Log-space Algorithms for Paths and Matchings in k-trees. STACS 2010: 215-226 - [i9]Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar:
Popularity at Minimum Cost. CoRR abs/1009.2591 (2010) - [i8]Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Graph Isomorphism for K3,3-free and K5-free graphs is in Log-space. Electron. Colloquium Comput. Complex. TR10 (2010) - [i7]Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák:
Pseudorandom Generators for Group Products. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c5]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest Paths in Planar DAGs in Unambiguous Logspace. CATS 2009: 99-105 - [c4]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism is in Log-Space. CCC 2009: 203-214 - [c3]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: 145-156 - [c2]Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The Planar k-Means Problem is NP-Hard. WALCOM 2009: 274-285 - [i6]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
Planar Graph Isomorphism is in Log-Space. Algebraic Methods in Computational Complexity 2009 - [i5]Bireswar Das, Samir Datta, Prajakta Nimbhorkar:
Log-space Algorithms for Paths and Matchings in k-trees. CoRR abs/0912.4602 (2009) - [i4]Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf:
Planar Graph Isomorphism is in Log-space. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c1]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space. FSTTCS 2008: 155-162 - [i3]Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar:
Longest paths in Planar DAGs in Unambiguous Logspace. CoRR abs/0802.1699 (2008) - [i2]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space. CoRR abs/0806.1041 (2008) - [i1]Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner:
A Log-space Algorithm for Canonization of Planar Graphs. CoRR abs/0809.2319 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
