The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
2002-2005 (16) 2006-2008 (17) 2009-2023 (11)
Publication types (Num. hits)
article(21) inproceedings(23)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 31 occurrences of 19 keywords

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