Lehr- und Forschungsgebiet Theoretische Informatik

As of December 1st 2007, I will no longer be working at RWTH Aachen University (I took up a job in the industry).

If you have questions regarding courses taught by the Theory Group, please direct your enquiries to one of the active members.

Daniel Mölle

E-mail:moelle@informatik.rwth-aachen.de photo
Postal address:Daniel Mölle
Lehrgebiet Theoretische Informatik
RWTH Aachen
Ahornstraße 55
52074 Aachen
Federal Republic of Germany
Phone:+49-241-80-21132
Room:6114 (Building E2)
Office hours:by appointment

Research

Among the many flavors complexity theory comes in, my interests focus on hierarchization, hardness results and lower bounds on circuit complexity. In algorithmics, I am presently concentrating on the design and analysis of efficient exact algorithms, especially parameterized algorithms for hard problems.

Publications:

  • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith (2009)
    A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
    In SIAM Journal on Discrete Mathematics 23(1), pages 407-427. 2009.
  • Daniel Mölle, Stefan Richter, Peter Rossmanith (2008)
    Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
    In Theory of Computing Systems 43(2), pages 234-253. 2008. (special issue CSR'06).
  • Joachim Kneis, Daniel Mölle, Peter Rossmanith (2007)
    Partial vs. Complete Domination: t-Dominating Set
    In Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2007), LNCS 4362. Springer, 2007.
  • B. Fuchs, W. Kern, D. Mölle, S. Richter, P. Rossmanith, X. Wang (2007)
    Dynamic Programming for Minimum Steiner Trees
    In Theory of Computing Systems 41(3), pages 495-5090. 2007.
  • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith (2006)
    Intuitive Algorithms and t-Vertex Cover
    In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), LNCS 4288, pages 598-607. Springer, 2006.
  • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith (2006)
    Divide-and-Color
    In Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), LNCS 4271, pages 58-67. Springer, 2006.
  • Daniel Mölle, Stefan Richter, Peter Rossmanith (2006)
    Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants
    In Proceedings of the Twelfth Annual International Computing and Combinatorics Conference (COCOON 2006), LNCS 4112, pages 265-273. Springer, 2006.
  • Daniel Mölle, Stefan Richter, Peter Rossmanith (2006)
    Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
    In Proceedings of the First International Computer Science Symposium in Russia (CSR 2006), LNCS 3976, pages 270-280. Springer, 2006.
  • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith (2006)
    Parameterized Power Domination Complexity
    In Information Processing Letters 98, pages 145-149. Elsevier, 2006.
  • Daniel Mölle, Stefan Richter, Peter Rossmanith (2006)
    A Faster Algorithm for the Steiner Tree Problem
    In Proceedings of the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS 2006), LNCS 3884, pages 561-570. Springer, 2006.
  • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith (2005)
    Algorithms Based on the Treewidth of Sparse Graphs
    In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), LNCS 3787, pages 385-396. Springer, 2005.
  • Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith (2005)
    On the Parameterized Complexity of Exact Satisfiability Problems
    In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), LNCS 3618, pages 568-579. Springer, 2005.

Technical Reports:

Theses:

Miscellaneous

These files are not really related with what I did at the RWTH; they will only improve your life.

Pictures

Valid HTML 4.01!