dblp.uni-trier.dewww.uni-trier.de

Daniel Mölle

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
11EEDaniel 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)
2007
10EEJoachim Kneis, Daniel Mölle, Peter Rossmanith: Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376
9EEBernhard 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)
2006
8EEDaniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. COCOON 2006: 265-273
7EEDaniel Mölle, Stefan Richter, Peter Rossmanith: Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR 2006: 270-280
6EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607
5EEDaniel Mölle, Stefan Richter, Peter Rossmanith: A Faster Algorithm for the Steiner Tree Problem. STACS 2006: 561-570
4EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Divide-and-Color. WG 2006: 58-67
3EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006)
2005
2EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579
1EEJoachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith: Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396

Coauthor Index

1Bernhard Fuchs [9]
2Walter Kern [9]
3Joachim Kneis [1] [2] [3] [4] [6] [10]
4Stefan Richter [1] [2] [3] [4] [5] [6] [7] [8] [9] [11]
5Peter Rossmanith [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11]
6Xinhui Wang [9]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)