| 2008 |
|---|
| 7 | EE | Samir Datta,
Raghav Kulkarni,
Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
STACS 2008: 229-240 |
| 6 | EE | Samir Datta,
Raghav Kulkarni,
Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
CoRR abs/0802.2850: (2008) |
| 2007 |
|---|
| 5 | EE | Samir Datta,
Raghav Kulkarni,
Nutan Limaye,
Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings.
CSR 2007: 115-126 |
| 4 | EE | Mark Braverman,
Raghav Kulkarni,
Sambuddha Roy:
Parity Problems in Planar Graphs.
IEEE Conference on Computational Complexity 2007: 222-235 |
| 3 | EE | Mark Braverman,
Raghav Kulkarni,
Sambuddha Roy:
Parity Problems in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 14(035): (2007) |
| 2006 |
|---|
| 2 | EE | Raghav Kulkarni:
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small.
CIAC 2006: 308-319 |
| 2004 |
|---|
| 1 | EE | Raghav Kulkarni,
Meena Mahajan:
Seeking a Vertex of the Planar Matching Polytope in NC.
ESA 2004: 472-483 |
