Search results for "Branch-width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
82	Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle	Boolean-Width of Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
77	Petr Hlinený	Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids.	STACS	2003	DBLP DOI BibTeX RDF	representable matroid, fixed-parameter complexity, Classification: parametrized complexity and logic in computer science. (Math subjects 05B35, 68R05, 03D05.), monadic second-order logic, branch-width
73	Sang-il Oum, Paul D. Seymour	Certifying large branch-width.	SODA	2006	DBLP DOI BibTeX RDF
66	Frédéric Mazoit	The Branch-Width of Circular-Arc Graphs.	LATIN	2006	DBLP DOI BibTeX RDF	algorithm, circular-arc graphs, Branch-width
66	Sang-il Oum	Approximating Rank-Width and Clique-Width Quickly.	WG	2005	DBLP DOI BibTeX RDF
63	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
60	Elizabeth Broering, Satyanarayana V. Lokam	Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract).	SAT	2003	DBLP DOI BibTeX RDF
58	Sang-il Oum	Approximating rank-width and clique-width quickly.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	rank-width, Approximation algorithms, matroids, clique-width, branch-width
57	Petr Hlinený, Detlef Seese	On Decidability of MSO Theories of Representable Matroids.	IWPEC	2004	DBLP DOI BibTeX RDF	MSO theory, decidability, matroid, branch-width
47	Petr Hlinený	On Matroid Properties Definable in the MSO Logic.	MFCS	2003	DBLP DOI BibTeX RDF	MSO logic, parametrized complexity, matroid, branch-width
45	Fedor V. Fomin, Dimitrios M. Thilikos	Dominating sets in planar graphs: branch-width and exponential speed-up.	SODA	2003	DBLP BibTeX RDF	Planar Graph, Dominating Set, Tree-width, Fixed Parameter Algorithm, Branch-width
38	Vít Jelínek	The Rank-Width of the Square Grid.	WG	2008	DBLP DOI BibTeX RDF	rank-width, grid graph
36	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
31	William H. Cunningham, Jim Geelen	On Integer Programming and the Branch-Width of the Constraint Matrix.	IPCO	2007	DBLP DOI BibTeX RDF
31	Daniel Král	Computing Representations of Matroids of Bounded Branch-Width.	STACS	2007	DBLP DOI BibTeX RDF
30	Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson	Directed branch-width: A directed analogue of tree-width.	CoRR	2020	DBLP BibTeX RDF
30	Sang-il Oum	Rank-width is less than or equal to branch-width.	J. Graph Theory	2008	DBLP DOI BibTeX RDF
30	Sang-il Oum, Paul D. Seymour	Approximating clique-width and branch-width.	J. Comb. Theory, Ser. B	2006	DBLP DOI BibTeX RDF
27	Ting Peng, Ian H. Jermyn, Véronique Prinet, Josiane Zerubia	An Extended Phase Field Higher-Order Active Contour Model for Networks and Its Application to Road Network Extraction from VHR Satellite Images.	ECCV (3)	2008	DBLP DOI BibTeX RDF
22	Petr Skoda 0001	Computability of Width of Submodular Partition Functions.	IWOCA	2009	DBLP DOI BibTeX RDF
22	Stefan Szeider	On Fixed-Parameter Tractable Parameterizations of SAT.	SAT	2003	DBLP DOI BibTeX RDF
21	Petr Hlinený	Some Hard Problems on Matroid Spikes.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
20	Susan Jowett, Jasmine Lulani Kaulamatoa, Geoff Whittle	Bounding Branch-Width.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
20	Rohan Kapadia	The Extremal Functions of Classes of Matroids of Bounded Branch-Width.	Comb.	2018	DBLP DOI BibTeX RDF
20	Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan 0001, Saket Saurabh 0001	Fine-grained complexity of integer programming: The case of bounded branch-width and rank.	CoRR	2016	DBLP BibTeX RDF
20	Jim Geelen, Stefan H. M. van Zwam	Matroid 3-connectivity and branch width.	J. Comb. Theory, Ser. B	2015	DBLP DOI BibTeX RDF
20	Xiaojie Deng, Bingkai Lin, Chihao Zhang 0001	Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.	FAW-AAIM	2013	DBLP DOI BibTeX RDF
20	Torsten Inkmann, Robin Thomas 0001	Minor-Minimal Planar Graphs of Even Branch-Width.	Comb. Probab. Comput.	2011	DBLP DOI BibTeX RDF
20	Michael Alekhnovich, Alexander A. Razborov	Satisfiability, Branch-Width and Tseitin tautologies.	Comput. Complex.	2011	DBLP DOI BibTeX RDF
20	Sang-il Oum, Paul D. Seymour	Testing branch-width.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
20	Petr Hlinený	The Tutte Polynomial for Matroids of Bounded Branch-Width.	Comb. Probab. Comput.	2006	DBLP DOI BibTeX RDF
20	Petr Hlinený	Branch-width, parse trees, and monadic second-order logic for matroids.	J. Comb. Theory, Ser. B	2006	DBLP DOI BibTeX RDF
20	Fedor V. Fomin, Dimitrios M. Thilikos	Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.	SIAM J. Comput.	2006	DBLP DOI BibTeX RDF
20	Petr Hlinený	A Parametrized Algorithm for Matroid Branch-Width.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
20	James F. Geelen, A. M. H. Gerards, Neil Robertson 0001, Geoff Whittle	On the excluded minors for the matroids of branch-width k.	J. Comb. Theory, Ser. B	2003	DBLP DOI BibTeX RDF
20	Petr Hlinený	On the Excluded Minors for Matroids of Branch-Width Three.	Electron. J. Comb.	2002	DBLP DOI BibTeX RDF
20	Rhiannon Hall, James G. Oxley, Charles Semple, Geoffrey P. Whittle	On Matroids of Branch-Width Three.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
20	James F. Geelen, A. M. H. Gerards, Geoff Whittle	Branch-Width and Well-Quasi-Ordering in Matroids and Graphs.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
20	James F. Geelen, Geoffrey P. Whittle	Branch-Width and Rota's Conjecture.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
20	Michael Alekhnovich, Alexander A. Razborov	Satisfiability, Branch-Width and Tseitin Tautologies.	FOCS	2002	DBLP DOI BibTeX RDF
16	Isolde Adler, Martin Grohe, Stephan Kreutzer	Computing excluded minors.	SODA	2008	DBLP BibTeX RDF
16	Fedor V. Fomin, Dimitrios M. Thilikos	A Simple and Fast Approach for Solving Problems on Planar Graphs.	STACS	2004	DBLP DOI BibTeX RDF
11	Rok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen	Improved Induced Matchings in Sparse Graphs.	IWPEC	2009	DBLP DOI BibTeX RDF
11	Petr Hlinený	On Matroid Representability and Minor Problems.	MFCS	2006	DBLP DOI BibTeX RDF	Matroid representability, spike, swirl. 2000 Math subject classification: 05B35, finite field, 68Q17, 68R05, minor