Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Vertex cover: further observations and further improvements
Journal of Algorithms
Complexity of domination-type problems in graphs
Nordic Journal of Computing
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th 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,
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Graph Separators: A Parameterized View
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On the Differences between ``Practical'' and ``Applied''
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Parameterized Complexity: The Main Ideas and Some Research Frontiers
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Parameterized Complexity
Dominating sets in planar graphs: branch-width and exponential speed-up
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Graph Separator Algorithms: A Refined Analysis
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
A two-pronged attack on the dragon of intractability
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
An experimental study on generating planar graphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
| Hi-index | 0.01 |
Dealing with the NP-complete Dominating Set problem on undirected graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In particular, we prove that Dominating Set on planar graphs has a so-called problem kernel of linear size, achieved by two simple and easy to implement reduction rules. This answers an open question from previous work on the parameterized complexity of Dominating Set on planar graphs.