![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 8 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Space-Efficient Counting in Graphs on Surfaces. Computational Complexity 18(4): 601-649 (2009) | |
| 7 | Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240 | |
| 6 | Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR abs/0802.2850: (2008) | |
| 4 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. IEEE Conference on Computational Complexity 2007: 222-235 | |
| 3 | Mark Braverman, Raghav Kulkarni, Sambuddha Roy: Parity Problems in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(035): (2007) |
Selection of 5 from 8 records - Raghav Kulkarni has 5 coauthors
Copyright © 2010-01-01 by Michael Ley (ley@uni-trier.de)