On the Parameterized Complexity of Exact Satisfiability Problems. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (MFCS, 2005)

Algorithms Based on the Treewidth of Sparse Graphs. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (WG, 2005)

Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. - Daniel Mölle; Stefan Richter 001; Peter Rossmanith (COCOON, 2006)

Intuitive Algorithms and t-Vertex Cover. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (ISAAC, 2006)

A Faster Algorithm for the Steiner Tree Problem. - Daniel Mölle; Stefan Richter 001; Peter Rossmanith (STACS, 2006)

Divide-and-Color. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (WG, 2006)

Parameterized power domination complexity. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (Inf. Process. Lett., 2006)

Partial vs. Complete Domination: t-Dominating Set. - Joachim Kneis; Daniel Mölle; Peter Rossmanith (SOFSEM (1), 2007)

Dynamic Programming for Minimum Steiner Trees. - Bernhard Fuchs; Walter Kern; Daniel Mölle; Stefan Richter 001; Peter Rossmanith; Xinhui Wang (Theory Comput. Syst., 2007)

Exact algorithms based on specific complexity measures for hard problems. - Daniel Mölle (2007)

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. - Daniel Mölle; Stefan Richter 001; Peter Rossmanith (Theory Comput. Syst., 2008)

Breaking Anonymity by Learning a Unique Minimum Hitting Set. - Dogan Kesdogan; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (CSR, 2009)

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. - Joachim Kneis; Daniel Mölle; Stefan Richter 001; Peter Rossmanith (SIAM J. Discret. Math., 2009)