|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
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 |
| 1 | Raghunath Tewari, N. V. Vinodchandran |
Green's theorem and isolation in planar graphs.  |
Inf. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space complexity of perfect matching in bounded genus bipartite graphs.  |
J. Comput. Syst. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
Improved Bounds for Bipartite Matching on Surfaces.  |
STACS  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
ReachFewL = ReachUL.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.  |
STACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
ReachFewL = ReachUL.  |
COCOON  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raghunath Tewari, N. V. Vinodchandran |
Green's Theorem and Isolation in Planar Graphs.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari |
Perfect Matching in Bipartite Planar Graphs is in UL.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the Power of Unambiguity in Logspace.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran |
On the Power of Unambiguity in Logspace  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Chris Bourke, Raghunath Tewari, N. V. Vinodchandran |
Directed Planar Reachability Is in Unambiguous Log-Space.  |
TOCT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Bourke, Raghunath Tewari, N. V. Vinodchandran |
Directed Planar Reachability is in Unambiguous Log-Space.  |
IEEE Conference on Computational Complexity  |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #14 of 14 (100 per page; Change: )
|
|