Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Strong branchwidth and local transversals
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Discrete Applied Mathematics
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Strong branchwidth and local transversals
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Minor-minimal planar graphs of even branch-width
Combinatorics, Probability and Computing
Generation of graphs with bounded branchwidth
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Exponential time algorithms for the minimum dominating set problem on some graph classes
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
New tools and simpler algorithms for branchwidth
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Characterizing graphs of small carving-width
Discrete Applied Mathematics
Hi-index | 0.00 |