Search results for "branch-decompositions"

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