Daniel Mlle
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
9
Venues
7
Active years
2005–2009
Best venue rank
National
Where they publish
Papers
9 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2009 | CSR | Breaking Anonymity by Learning a Unique Minimum Hitting Set. | Dogan Kesdogan, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2007 | SOFSEM | Partial vs. Complete Domination: t-Dominating Set. | Joachim Kneis, Daniel Mlle, Peter Rossmanith |
| 2006 | COCOON | Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. | Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | CSR | Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. | Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | ISAAC | Intuitive Algorithms and t-Vertex Cover. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | STACS | A Faster Algorithm for the Steiner Tree Problem. | Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | WG | Divide-and-Color. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2005 | MFCS | On the Parameterized Complexity of Exact Satisfiability Problems. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2005 | WG | Algorithms Based on the Treewidth of Sparse Graphs. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |