1. J. Alber, Exact algorithms for np-hard problems on networks: Design, analysis, and implementation, Ph.D. Thesis, Universität Tübingen, 2002
2. Fixed parameter algorithms for Dominating Set and related problems on planar graphs;Alber;Algorithmica,2002
3. Improved tree decomposition based algorithms for domination-like problems;Alber,2002
4. Linear time algorithms for np-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
5. Treewidth: Algorithmic techniques and results;Bodlaender,1997