A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up
[chapter]

2004
*
Lecture Notes in Computer Science
*

Preprocessing by data reduction is a simple but powerful technique used for practically solving different network problems. A number of empirical studies shows that a set of reduction rules for solving Dominating Set problems introduced by Alber, Fellows & Niedermeier leads efficiently to optimal solutions for many realistic networks. Despite of the encouraging experiments, the only class of graphs with proven performance guarantee of reductions rules was the class of planar graphs. However it

doi:10.1007/978-3-540-27836-8_50
fatcat:l66jjmhyyff4rjblksq5ea4xgy