1. On the Boolean-width of a graph: structure and applications;Adler,2010
2. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs;Alon,2007
3. H.L. Bodlaender, D. Kratsch, A note on fixed parameter intractability of some domination-related problems, Private Communication, 1994, Reported in M. Cesati, Compendium of Parameterized Problems, 2001. Available online at: http://bravo.ce.uniroma2.it/home/cesati/research/compendium.pdf.
4. Faster algorithms on branch and clique decompositions;Bodlaender,2007
5. Dynamic programming on tree decompositions using generalised fast subset convolution;Bodlaender,2009