Prajakta Nimbhorkar
Prajakta Nimbhorkar
Verified email at cmi.ac.in - Homepage
Title
Cited by
Cited by
Year
The planar k-means problem is NP-hard
M Mahajan, P Nimbhorkar, K Varadarajan
Theoretical Computer Science 442, 13-21, 2012
5172012
Planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar, T Thierauf, F Wagner
2009 24th Annual IEEE Conference on Computational Complexity, 203-214, 2009
822009
Pseudorandom generators for group products
M Koucky, P Nimbhorkar, P Pudlak
Electronic Colloquium on Computational Complexity (ECCC) 17 (113), 1, 2010
452010
3-connected planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar
arXiv preprint arXiv:0806.1041, 2008
242008
Graph Isomorphism for K_ {3, 3}-free and K_5-free graphs is in Log-space
S Datta, P Nimbhorkar, T Thierauf, F Wagner
IARCS Annual Conference on Foundations of Software Technology and …, 2009
232009
Log-space algorithms for paths and matchings in k-trees
B Das, S Datta, P Nimbhorkar
Theory of Computing Systems 53 (4), 669-689, 2013
212013
Longest paths in planar dags in unambiguous logspace
N Limaye, M Mahajan, P Nimbhorkar
arXiv preprint arXiv:0802.1699, 2008
172008
Popularity at minimum cost
T Kavitha, M Nasre, P Nimbhorkar
Journal of Combinatorial Optimization 27 (3), 574-596, 2014
10*2014
Erdős-Rényi sequences and deterministic construction of expanding cayley graphs
V Arvind, P Mukhopadhyay, P Nimbhorkar
Latin American Symposium on Theoretical Informatics, 37-48, 2012
82012
Popular Matching with Lower Quotas
M Nasre, P Nimbhorkar
arXiv preprint arXiv:1704.07546, 2017
52017
Rank-maximal matchings–structure and algorithms
P Ghosal, M Nasre, P Nimbhorkar
International Symposium on Algorithms and Computation, 593-605, 2014
52014
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings
M Nasre, P Nimbhorkar, N Pulath
arXiv preprint arXiv:1805.02851, 2018
3*2018
Expanding Generating Sets for Solvable Permutation Groups
V Arvind, P Mukhopadhyay, P Nimbhorkar, Y Vasudev
SIAM Journal on Discrete Mathematics 32 (3), 1721-1740, 2018
3*2018
Computing the maximum using (min,+) formulas
M Mahajan, P Nimbhorkar, A Tawari
42nd International Symposium on Mathematical Foundations of Computer Science …, 2017
22017
Shortest path length with bounded-alternation formulas
M Mahajan, P Nimbhorkar, A Tawari
International Journal of Advances in Engineering Sciences and Applied …, 2019
12019
Dynamic rank-maximal and popular matchings
P Nimbhorkar, VA Rameshwar
Journal of Combinatorial Optimization 37 (2), 523-545, 2019
12019
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings
M Nasre, P Nimbhorkar, N Pulath
arXiv preprint arXiv:1805.02851, 2018
12018
Dynamic rank-maximal matchings
P Nimbhorkar
International Computing and Combinatorics Conference, 433-444, 2017
12017
Maximum-Size Envy-free Matchings
P Krishnaa, G Limaye, M Nasre, P Nimbhorkar
arXiv preprint arXiv:1910.07159, 2019
2019
Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties
K Gopal, M Nasre, P Nimbhorkar, TP Reddy
International Computing and Combinatorics Conference, 193-205, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20