|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
Results
Found 2 publication records. Showing 2 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
55 | Karl R. Abrahamson, Michael R. Fellows |
Finite automata, bounded treewidth, and well-quasiordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Structure Theory ![In: Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle, USA, pp. 539-563, 1991, American Mathematical Society, 0-8218-5160-8. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP BibTeX RDF |
|
50 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Matthias Mnich, Frances A. Rosamond, Saket Saurabh 0001 |
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 822-848, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity |
Displaying result #1 - #2 of 2 (100 per page; Change: )
|
|