The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Raghav Kulkarni" ( http://dblp.L3S.de/Authors/Raghav_Kulkarni )

  Author page on DBLP  Author page in RDF  Community of Raghav Kulkarni in ASPL-2

Publication years (Num. hits)
2004-2010 (18) 2011-2012 (5)
Publication types (Num. hits)
article(15) inproceedings(8)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 23 publication records. Showing 23 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran Space complexity of perfect matching in bounded genus bipartite graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari Improved Bounds for Bipartite Matching on Surfaces. Search on Bibsonomy STACS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Raghav Kulkarni On the Power of Isolation in Planar Graphs. Search on Bibsonomy TOCT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pooya Hatami, Raghav Kulkarni, Denis Pankratov Variations on the Sensitivity Conjecture. Search on Bibsonomy Theory of Computing, Graduate Surveys The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan Planarity, Determinants, Permanents, and (Unique) Matchings. Search on Bibsonomy TOCT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Raghunath Tewari Perfect Matching in Bipartite Planar Graphs is in UL. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Pooya Hatami, Raghav Kulkarni, Denis Pankratov Variations on the Sensitivity Conjecture Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik Evasiveness and the Distribution of Prime Numbers Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Sambuddha Roy Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  BibTeX  RDF
1László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik Evasiveness and the Distribution of Prime Numbers. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Raghav Kulkarni On the Power of Isolation in Planar Structures. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Mark Braverman, Raghav Kulkarni, Sambuddha Roy Space-Efficient Counting in Graphs on Surfaces. Search on Bibsonomy Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan Some perfect matchings and perfect half-integral matchings in NC. Search on Bibsonomy Chicago J. Theor. Comput. Sci. The full citation details ... 2008 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Sambuddha Roy Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Sambuddha Roy Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Raghav Kulkarni, Sambuddha Roy Parity Problems in Planar Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan Planarity, Determinants, Permanents, and (Unique) Matchings. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Raghav Kulkarni, Sambuddha Roy Parity Problems in Planar Graphs. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Raghav Kulkarni A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Raghav Kulkarni, Meena Mahajan Seeking a Vertex of the Planar Matching Polytope in NC. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #23 of 23 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.