Daniel Mölle

Parameterized power domination complexity

Joachim Kneis, Daniel Mölle, Stefan Richter et al. · Information Processing Letters · 2006 · 92 citations

Mathematical Programming, Engineering, Parameterized Complexity +5

Dynamic Programming for Minimum Steiner Trees

Bernhard Fuchs, Walter Kern, Daniel Mölle et al. · Theory of Computing Systems · 2007 · 69 citations

Mathematical Programming, Network Science, Graph Theory +10

Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms

Jianer Chen, Joachim Kneis, Songjian Lu et al. · SIAM Journal on Computing · 2009 · 69 citations

Mathematical Programming, Engineering, Graph Theory +15

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

Daniel Mölle, Stefan Richter, Peter Rossmanith · Theory of Computing Systems · 2007 · 53 citations

Geometric Graph Theory, Engineering, Graph Theory +11

A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms

Joachim Kneis, Daniel Mölle, Stefan Richter et al. · SIAM Journal on Discrete Mathematics · 2009 · 26 citations

Mathematical Programming, Graph Sparsity, Engineering +18