Improved constants for some separator theorems
Journal of Algorithms
SIAM Journal on Discrete Mathematics
Linear Algorithms for Partitioning Embedded Graphs of BoundedGenus
SIAM Journal on Discrete Mathematics
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Journal of the ACM (JACM)
Vertex cover: further observations and further improvements
Journal of Algorithms
Approximation algorithms for independent sets in map graphs
Journal of Algorithms
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Graph Separators: A Parameterized View
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Partitioning Planar Graphs with Costs and Weights
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Parameterized Complexity
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.00 |
This paper continues our research on the use of graph separator theorems for designing fixed parameter algorithms started with the COCOON'01 contribution [2], showing how a more elaborated use of these theorems can bring down the algorithmically relevant constants. More precisely, if a c驴k-algorithm is obtainable with the help of applying the well-known Lipton/Tarjan planar separator theorem, our new approach will lead to a c2/3驴k-algorithm, this way also improving on the direct use of the "best" known planar separator theorem. For several problems, the constants can be even improved more by analyzing other separator theorems.