|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 33 occurrences of 21 keywords
|
|
|
|
|
Results
Found 40 publication records. Showing 40 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | 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 |
| 2 | 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 |
| 2 | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle |
Generation of Graphs with Bounded Branchwidth.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | 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 |
|
| 2 | Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca |
Computing Branchwidth Via Efficient Triangulations and Blocks.  |
WG  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Christophe Paul, Jan Arne Telle |
New Tools and Simpler Algorithms for Branchwidth.  |
ESA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Ton Kloks, Jan Kratochvíl, Haiko Müller |
New Branchwidth Territories.  |
STACS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 2 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Constructive Linear Time Algorithms for Branchwidth.  |
ICALP  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignasi Sau, Dimitrios M. Thilikos |
On self-duality of branchwidth in graphs of bounded genus.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender |
A Local Search Algorithm for Branchwidth.  |
SOFSEM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Qian-Ping Gu, Hisao Tamaki |
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size.  |
ISAAC  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
Edge-maximal graphs of branchwidth k: The k-branches.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Jan Arne Telle |
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca |
Computing branchwidth via efficient triangulations and blocks.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
Branchwidth of chordal graphs.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ignasi Sau, Dimitrios M. Thilikos |
On Self-Duality of Branchwidth in Graphs of Bounded Genus.  |
CTW  |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
| 1 | Fedor V. Fomin, Dimitrios M. Thilikos |
Branchwidth of Graphs.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake |
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs.  |
ALENEX  |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
| 1 | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
On Problems without Polynomial Kernels (Extended Abstract).  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
| 1 | Athanassios Koutsonas, Dimitrios M. Thilikos |
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.  |
WG  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
| 1 | 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 |
|
| 1 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT using vertex covers.  |
Acta Inf.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn |
Dynamic Programming and Fast Matrix Multiplication.  |
ESA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
Solving #SAT Using Vertex Covers.  |
SAT  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Paul, Jan Arne Telle |
Edge-maximal graphs of branchwidth k.  |
Electronic Notes in Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Illya V. Hicks |
Graphs, branchwidth, and tangles! Oh my!  |
Networks  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zsolt Tuza |
Strong branchwidth and local transversals.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ton Kloks, Jan Kratochvíl, Haiko Müller |
Computing the branchwidth of interval graphs.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
| 1 | 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 Transactions on Algorithms  |
2005 |
DBLP DOI BibTeX RDF |
(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph |
| 1 | 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 DOI BibTeX RDF |
|
| 1 | 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 |
| 1 | Henning Fernau, David W. Juedes |
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs.  |
MFCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
|
| 1 | 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 |
|
| 1 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Graphs with Branchwidth at Most Three.  |
J. Algorithms  |
1999 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #40 of 40 (100 per page; Change: )
|
|