The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
2004-2013 (15) 2015-2021 (7)
Publication types (Num. hits)
article(12) incollection(1) inproceedings(9)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 15 occurrences of 10 keywords

Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
47Qian-Ping Gu, Hisao Tamaki Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Graph algorithms, graph minors, branch-decompositions
40Zhengbing Bian, Qian-Ping Gu Computing Branch Decomposition of Large Planar Graphs. Search on Bibsonomy WEA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition
34Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Frederic Dorn, Jan Arne Telle Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
32Petr Hlinený, Sang-il Oum Finding Branch-Decompositions and Rank-Decompositions. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Petr Hlinený, Sang-il Oum Finding Branch-Decompositions and Rank-Decompositions. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width
28Qian-Ping Gu, Hisao Tamaki Optimal branch-decomposition of planar graphs in O(n3) Time. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF planar graphs, Branch-decompositions
22Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos Catalan structures and dynamic programming in H-minor-free graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
21Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum Finding Branch-Decompositions of Matroids, Hypergraphs, and More. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum Finding Branch-Decompositions of Matroids, Hypergraphs, and More. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum Finding branch-decompositions of matroids, hypergraphs, and more. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
21Sigve Hortemo Sæther, Martin Vatshelle Hardness of computing width parameters based on branch decompositions over the vertex set. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Zhengbing Bian, Qian-Ping Gu, Mingzhe Zhu Practical algorithms for branch-decompositions of planar graphs. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij Cut and Count and Representative Sets on Branch Decompositions. Search on Bibsonomy IPEC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
21Sigve Hortemo Sæther, Martin Vatshelle Hardness of computing width parameters based on branch decompositions over the vertex set. Search on Bibsonomy Electron. Notes Discret. Math. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
21Susan Margulies, Jing Ma, Illya V. Hicks The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming. Search on Bibsonomy INFORMS J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
21Ioannis Katsikarelis Computing bounded-width tree and branch decompositions of k-outerplanar graphs Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
21Illya V. Hicks Branchwidth and Branch Decompositions. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Branchwidth, Graph minors theorem, Branch-decomposition-based algorithm, Tangle, Branch decomposition
21Illya V. Hicks Planar Branch Decompositions II: The Cycle Method. Search on Bibsonomy INFORMS J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Illya V. Hicks Planar Branch Decompositions I: The Ratcatcher. Search on Bibsonomy INFORMS J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Illya V. Hicks Branch decompositions and minor containment. Search on Bibsonomy Networks The full citation details ... 2004 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 - #22 of 22 (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