|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 7 publication records. Showing 7 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stephen G. Hartke, Derrick Stolee |
Uniquely K_r-Saturated Graphs  |
CoRR  |
2012 |
DBLP 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 | Brady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran |
ReachFewL = ReachUL. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Derrick Stolee, N. V. Vinodchandran |
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephen G. Hartke, Hannah Kolb, Jared Nishikawa, Derrick Stolee |
Automorphism Groups of a Graph and a Vertex-Deleted Subgraph. |
Electr. J. Comb. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
acyclic digraph, logspace algorithm, planar graph, reachability |
| 1 | Derrick Stolee, Chris Bourke, N. V. Vinodchandran |
A log-space algorithm for reachability in planar DAGs with few sources. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
Displaying result #1 - #7 of 7 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")