Daniel Mölle

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discrete Math. 23(1): 407-427 (2009)

Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith: Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR 2009: 299-309

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

Daniel Mölle: Exact algorithms based on specific complexity measures for hard problems. RWTH Aachen University 2007, pp. 1-139

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

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

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006)

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

Daniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR 2006: 270-280

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607

Daniel Mölle, Stefan Richter, Peter Rossmanith: A Faster Algorithm for the Steiner Tree Problem. STACS 2006: 561-570

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Divide-and-Color. WG 2006: 58-67

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396