Prajakta Nimbhorkar

Prajakta Nimbhorkar

Chennai Mathematical Institute - Chennai / India
Natural Sciences / Mathematical Sciences
AD Scientific Index ID: 408256
சென்னை கணிதவியல் கழகம்
person_outline Prajakta Nimbhorkar's MOST POPULAR ARTICLES
1-) The planar k-means problem is NP-hardM Mahajan, P Nimbhorkar, K VaradarajanTheoretical Computer Science 442, 13-21, 20127822012
2-) Planar graph isomorphism is in log-spaceS Datta, N Limaye, P Nimbhorkar, T Thierauf, F Wagner2009 24th Annual IEEE Conference on Computational Complexity, 203-214, 2009952009
3-) Pseudorandom generators for group productsM Koucký, P Nimbhorkar, P PudlákProceedings of the forty-third annual ACM symposium on Theory of computing …, 2011642011
4-) Graph Isomorphism for K_ {3, 3}-free and K_5-free graphs is in Log-spaceS Datta, P Nimbhorkar, T Thierauf, F WagnerIARCS Annual Conference on Foundations of Software Technology and …, 2009292009
5-) Popular matching with lower quotasM Nasre, P NimbhorkararXiv preprint arXiv:1704.07546, 2017262017