The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Raghunath Tewari" ( http://dblp.L3S.de/Authors/Raghunath_Tewari )

  Author page on DBLP  Author page in RDF  Community of Raghunath Tewari in ASPL-2

Publication years (Num. hits)
2007 (1) 2009 (1) 2010 (6) 2011 (3) 2012 (3)
Publication types (Num. hits)
article(10) inproceedings(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 14 publication records. Showing 14 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Raghunath Tewari, N. V. Vinodchandran Green's theorem and isolation in planar graphs. Search on Bibsonomy Inf. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
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
1Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran ReachFewL = ReachUL. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  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
1Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran ReachFewL = ReachUL. Search on Bibsonomy COCOON The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Raghunath Tewari, N. V. Vinodchandran Green's Theorem and Isolation in Planar Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  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
1Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran On the Power of Unambiguity in Logspace. 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 CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran On the Power of Unambiguity in Logspace Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Chris Bourke, Raghunath Tewari, N. V. Vinodchandran Directed Planar Reachability Is in Unambiguous Log-Space. Search on Bibsonomy TOCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Chris Bourke, Raghunath Tewari, N. V. Vinodchandran Directed Planar Reachability is in Unambiguous Log-Space. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #14 of 14 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.