Daniel Mölle

According to our database, Daniel Mölle authored at least 13 papers between 2005 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

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

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

SIAM J. Discret. Math., 2009

Breaking Anonymity by Learning a Unique Minimum Hitting Set.

Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Computer Science, 2009

2007

Exact algorithms based on specific complexity measures for hard problems.

Daniel Mölle

PhD thesis, 2007

Dynamic Programming for Minimum Steiner Trees.

Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang

Theory Comput. Syst., 2007

Partial vs. Complete Domination: t-Dominating Set.

Joachim Kneis, Daniel Mölle, Peter Rossmanith

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Parameterized power domination complexity.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Inf. Process. Lett., 2006

Divide-and-Color.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

A Faster Algorithm for the Steiner Tree Problem.

Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the STACS 2006, 2006

Intuitive Algorithms and t-Vertex Cover.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

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

Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Computer Science, 2006

Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants.

Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005

Algorithms Based on the Treewidth of Sparse Graphs.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

On the Parameterized Complexity of Exact Satisfiability Problems.

Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005