Daniel Mölle

14 papers A 1B 4Misc 3Journal 4Unranked 1
YearRankTypeTitle / Venue / Authors
2009 J jnl
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms.
SIAM J. Discret. Math.
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2009 Misc conf
Breaking Anonymity by Learning a Unique Minimum Hitting Set.
CSR
Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith
2008 J jnl
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.
Theory Comput. Syst.
Daniel Mölle, Stefan Richter, Peter Rossmanith
2007 J jnl
Dynamic Programming for Minimum Steiner Trees.
Theory Comput. Syst.
Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang
2007 — —
Exact algorithms based on specific complexity measures for hard problems.
Daniel Mölle
2007 — conf
Partial vs. Complete Domination: t-Dominating Set.
SOFSEM (1)
Joachim Kneis, Daniel Mölle, Peter Rossmanith
2006 A conf
A Faster Algorithm for the Steiner Tree Problem.
STACS
Daniel Mölle, Stefan Richter, Peter Rossmanith
2006 B conf
Divide-and-Color.
WG
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2006 Misc conf
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.
CSR
Daniel Mölle, Stefan Richter, Peter Rossmanith
2006 Misc conf
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants.
COCOON
Daniel Mölle, Stefan Richter, Peter Rossmanith
2006 B conf
Intuitive Algorithms and t-Vertex Cover.
ISAAC
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2006 J jnl
Parameterized power domination complexity.
Inf. Process. Lett.
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2005 B conf
Algorithms Based on the Treewidth of Sparse Graphs.
WG
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith
2005 B conf
On the Parameterized Complexity of Exact Satisfiability Problems.
MFCS
Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith