The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Max-leaf (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2000-2016 (11)
Publication types (Num. hits)
article(5) incollection(2) inproceedings(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
78Michael 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 Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Max-leaf, Well-quasiordering, Bandwidth, Kernelization, Parameterized complexity
75Michael R. Fellows, Frances A. Rosamond The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Frances A. Rosamond Max Leaf Spanning Tree. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
20David Eppstein Metric Dimension Parameterized by Max Leaf Number. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
20David Eppstein Metric Dimension Parameterized by Max Leaf Number. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
20Paul S. Bonsma, Frederic Dorn Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
20Frances A. Rosamond Max Leaf Spanning Tree. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Paul S. Bonsma, Frederic Dorn Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
20Paul S. Bonsma, Frederic Dorn Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Michael R. Fellows, Catherine McCartin, Frances A. Rosamond, Ulrike Stege Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
14Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license