1. Efficient data reduction for dominating set: a linear problem kernel for the planar case;Alber,2002
2. Graph separators: a parameterized view;Alber,2001
3. Parameterized complexity: exponential speed-up for planar graph problems;Alber,2001
4. Faster exact algorithms for hard problems: a parameterized point of view;Alber;Discrete Math.,2001
5. Complexity and Approximation—Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999