| 2009 |
|---|
| 5 | EE | Meena Mahajan,
Prajakta Nimbhorkar,
Kasturi Varadarajan:
The Planar k-Means Problem is NP-Hard.
WALCOM 2009: 274-285 |
| 2008 |
|---|
| 4 | EE | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space.
FSTTCS 2008 |
| 3 | EE | Nutan Limaye,
Meena Mahajan,
Prajakta Nimbhorkar:
Longest paths in Planar DAGs in Unambiguous Logspace
CoRR abs/0802.1699: (2008) |
| 2 | EE | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space
CoRR abs/0806.1041: (2008) |
| 1 | EE | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar,
Thomas Thierauf,
Fabian Wagner:
A Log-space Algorithm for Canonization of Planar Graphs
CoRR abs/0809.2319: (2008) |
