Search results for "branchwidth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Christophe Paul, Jan Arne Telle	New Tools and Simpler Algorithms for Branchwidth.	ESA	2005	DBLP DOI BibTeX RDF
66	Christophe Paul, Andrzej Proskurowski, Jan Arne Telle	Generation of Graphs with Bounded Branchwidth.	WG	2006	DBLP DOI BibTeX RDF
66	Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca	Computing Branchwidth Via Efficient Triangulations and Blocks.	WG	2005	DBLP DOI BibTeX RDF
66	Ton Kloks, Jan Kratochvíl, Haiko Müller	New Branchwidth Territories.	STACS	1999	DBLP DOI BibTeX RDF
66	Hans L. Bodlaender, Dimitrios M. Thilikos	Constructive Linear Time Algorithms for Branchwidth.	ICALP	1997	DBLP DOI BibTeX RDF
60	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
58	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
58	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT using vertex covers.	Acta Informatica	2007	DBLP DOI BibTeX RDF
58	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
52	Richard B. Borie, R. Gary Parker, Craig A. Tovey	Solving problems on recursively constructed graphs.	ACM Comput. Surv.	2008	DBLP DOI BibTeX RDF	Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
47	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
38	Athanassios Koutsonas, Dimitrios M. Thilikos	Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.	WG	2008	DBLP DOI BibTeX RDF
38	Marjan Marzban, Qian-Ping Gu, Xiaohua Jia	Computational Study on Dominating Set Problem of Planar Graphs.	COCOA	2008	DBLP DOI BibTeX RDF	PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition
38	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
38	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.	ICALP	2003	DBLP DOI BibTeX RDF
38	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.	APPROX	2002	DBLP DOI BibTeX RDF
28	Alessandro Aloisio	Fixed-Parameter Tractability for Branchwidth of the Maximum-Weight Edge-Colored Subgraph Problem.	AINA (6)	2024	DBLP DOI BibTeX RDF
28	Dimitrios M. Thilikos, Sebastian Wiederrecht	Approximating branchwidth on parametric extensions of planarity.	CoRR	2023	DBLP DOI BibTeX RDF
28	Fedor V. Fomin, Tuukka Korhonen	Fast FPT-approximation of branchwidth.	STOC	2022	DBLP DOI BibTeX RDF
28	Fedor V. Fomin, Tuukka Korhonen	Fast FPT-Approximation of Branchwidth.	CoRR	2021	DBLP BibTeX RDF
28	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	A SAT Approach to Branchwidth.	ACM Trans. Comput. Log.	2019	DBLP DOI BibTeX RDF
28	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	A SAT Approach to Branchwidth.	IJCAI	2017	DBLP DOI BibTeX RDF
28	Fedor V. Fomin, Dimitrios M. Thilikos	Branchwidth of Graphs.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
28	Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno	(Total) Vector domination for graphs with bounded branchwidth.	Discret. Appl. Math.	2016	DBLP DOI BibTeX RDF
28	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	A SAT Approach to Branchwidth.	SAT	2016	DBLP DOI BibTeX RDF
28	Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno	(Total) Vector Domination for Graphs with Bounded Branchwidth.	LATIN	2014	DBLP DOI BibTeX RDF
28	Toshimasa Ishii, Hirotaka Ono 0001, Yushi Uno	(Total) Vector Domination for Graphs with Bounded Branchwidth.	CoRR	2013	DBLP BibTeX RDF
28	J. Cole Smith, Elif Ulusal, Illya V. Hicks	A combinatorial optimization algorithm for solving the branchwidth problem.	Comput. Optim. Appl.	2012	DBLP DOI BibTeX RDF
28	Qian-Ping Gu, Hisao Tamaki	Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.	Algorithmica	2012	DBLP DOI BibTeX RDF
28	Ignasi Sau, Dimitrios M. Thilikos	On self-duality of branchwidth in graphs of bounded genus.	Discret. Appl. Math.	2011	DBLP DOI BibTeX RDF
28	Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender	A Local Search Algorithm for Branchwidth.	SOFSEM	2011	DBLP DOI BibTeX RDF
28	Qian-Ping Gu, Hisao Tamaki	Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.	ISAAC (2)	2010	DBLP DOI BibTeX RDF
28	Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca	Computing branchwidth via efficient triangulations and blocks.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
28	Christophe Paul, Jan Arne Telle	Branchwidth of chordal graphs.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
28	Frederic Dorn, Jan Arne Telle	Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
28	Christophe Paul, Jan Arne Telle	Edge-maximal graphs of branchwidth k: The k-branches.	Discret. Math.	2009	DBLP DOI BibTeX RDF
28	Ignasi Sau, Dimitrios M. Thilikos	On Self-Duality of Branchwidth in Graphs of Bounded Genus.	CTW	2009	DBLP BibTeX RDF
28	Fedor V. Fomin, Dimitrios M. Thilikos	Branchwidth of Graphs.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
28	Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake	Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.	ALENEX	2008	DBLP DOI BibTeX RDF
28	Elif Ulusal	Integer programming models for the branchwidth problem.		2008	RDF
28	Illya V. Hicks, Nolan B. McMurray Jr.	The branchwidth of graphs and their cycle matroids.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
28	Christophe Paul, Jan Arne Telle	Edge-maximal graphs of branchwidth k.	Electron. Notes Discret. Math.	2005	DBLP DOI BibTeX RDF
28	Ton Kloks, Jan Kratochvíl, Haiko Müller	Computing the branchwidth of interval graphs.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
28	Zsolt Tuza	Strong branchwidth and local transversals.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
28	Illya V. Hicks	Graphs, branchwidth, and tangles! Oh my!	Networks	2005	DBLP DOI BibTeX RDF
28	Hans L. Bodlaender, Dimitrios M. Thilikos	Graphs with Branchwidth at Most Three.	J. Algorithms	1999	DBLP DOI BibTeX RDF
19	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
19	Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster	Treewidth Lower Bounds with Brambles.	Algorithmica	2008	DBLP DOI BibTeX RDF	Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth
19	Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin	On Problems without Polynomial Kernels (Extended Abstract).	ICALP (1)	2008	DBLP DOI BibTeX RDF
19	Frederic Dorn	Dynamic Programming and Fast Matrix Multiplication.	ESA	2006	DBLP DOI BibTeX RDF
19	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.	J. ACM	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
19	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.	SODA	2004	DBLP BibTeX RDF
19	Fedor V. Fomin, Dimitrios M. Thilikos	Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.	ICALP	2004	DBLP DOI BibTeX RDF	embedded graphs, subexponential algorithms, Dominating set, parameterized algorithms, branch-width
19	Henning Fernau, David W. Juedes	A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.	MFCS	2004	DBLP DOI BibTeX RDF