Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Computational study on planar dominating set problem
Theoretical Computer Science
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms
Computational study for planar connected dominating set problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Exact algorithm for the maximum induced planar subgraph problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Survey: Subexponential parameterized algorithms
Computer Science Review
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
It is known that a planar graph on n vertices has branch-width-tree-width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant α. We give a proof of the best, so far, upper bound for the constant α. In particular, for the case of tree-width, α The first author is supported by Norges forskningsråd projects 162731-V00 and 160778-V30. The second author is supported by the Spanish CICYT project TIN-2004-07925 (GRAMMARS).