# Prajakta Nimbhorkar

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

The Planar k-Means Problem is NP-Hard

- M. Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
- Mathematics, Computer Science
- WALCOM
- 18 February 2009

In the k-means problem, we are given a finite set S of points in $\Re^m$, and integer k ≥ 1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance… Expand

The planar k-means problem is NP-hard

- M. Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1 July 2012

In the k-means problem, we are given a finite set S of points in @?^m, and integer k>=1, and we want to find k points (centers) so as to minimize the sum of the square of the Euclidean distance of… Expand

Planar Graph Isomorphism is in Log-Space

- Samir Datta, N. Limaye, Prajakta Nimbhorkar, T. Thierauf, F. Wagner
- Computer Science, Mathematics
- 24th Annual IEEE Conference on Computational…
- 15 July 2009

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extant… Expand

Pseudorandom generators for group products: extended abstract

- M. Koucký, Prajakta Nimbhorkar, P. Pudlák
- Computer Science, Mathematics
- STOC '11
- 6 June 2011

We prove that the pseudorandom generator introduced by Impagliazzo et al. (1994) with proper choice of parameters fools group products of a given finite group G. The seed length is O((|G|O(1) + log… Expand

Longest Paths in Planar DAGs in Unambiguous Log-Space

- N. Limaye, M. Mahajan, Prajakta Nimbhorkar
- Computer Science, Mathematics
- Chic. J. Theor. Comput. Sci.
- 12 February 2008

Reachability and distance computation are known to be NL-complete in general graphs, but within UL ∩ co-UL if the graphs are planar. However, finding longest paths is known to be NP-complete, even… Expand

Pseudorandom Generators for Group Products

- M. Koucký, Prajakta Nimbhorkar, P. Pudlák
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2010

We prove that the pseudorandom generator introduced in [INW94] fools group products of a given finite group. The seed length is O(log n log 1e ), where n the length of the word and e is the… Expand

A Log-space Algorithm for Canonization of Planar Graphs

- S. Datta, N. Limaye, Prajakta Nimbhorkar, T. Thierauf, F. Wagner
- Computer Science, Mathematics
- ArXiv
- 14 September 2008

Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. We bridge this gap for a natural and… Expand

Popularity at Minimum Cost

- T. Kavitha, Meghana Nasre, Prajakta Nimbhorkar
- Computer Science, Mathematics
- ISAAC
- 14 September 2010

We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph \(G = (\mathcal{A} \cup \mathcal{B},E)\), where \(\mathcal{A}\)… Expand

Dynamic Rank-Maximal Matchings

- Prajakta Nimbhorkar, V. ArvindRameshwar
- Computer Science, Mathematics
- COCOON
- 4 April 2017

We consider the problem of matching applicants to posts where applicants have preferences over posts. Thus the input to our problem is a bipartite graph \(G=(\mathcal {A}\cup \mathcal {P},E)\), where… Expand

Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space

- S. Datta, Prajakta Nimbhorkar, T. Thierauf, F. Wagner
- Computer Science, Mathematics
- FSTTCS
- 2009

Graph isomorphism is an important and widely studied computational problem with
a yet unsettled complexity.
However, the exact complexity is known for isomorphism of various classes of
graphs.… Expand