Daniel Mölle

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A bound on the pathwidth of sparse graphs with applications to exact algorithms SIAM Journal on Discrete Mathematics	2010-03-17	Paper
Parameterized power domination complexity Information Processing Letters	2010-01-18	Paper
Randomized divide-and-conquer: improved path, matching, and packing algorithms SIAM Journal on Computing	2010-01-06	Paper
Breaking Anonymity by Learning a Unique Minimum Hitting Set Computer Science - Theory and Applications	2009-08-18	Paper
Divide-and-Color Graph-Theoretic Concepts in Computer Science	2008-09-04	Paper
Enumerate and expand: Improved algorithms for connected vertex cover and tree cover Theory of Computing Systems	2008-06-17	Paper
Intuitive Algorithms and t-Vertex Cover Algorithms and Computation	2008-04-24	Paper
A Faster Algorithm for the Steiner Tree Problem STACS 2006	2008-03-19	Paper
Partial vs. Complete Domination: t-Dominating Set Lecture Notes in Computer Science	2008-03-07	Paper
Dynamic programming for minimum Steiner trees Theory of Computing Systems	2007-12-19	Paper
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants Lecture Notes in Computer Science	2007-09-10	Paper
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover Computer Science – Theory and Applications	2007-05-02	Paper
Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science	2006-11-01	Paper
Mathematical Foundations of Computer Science 2005 Lecture Notes in Computer Science	2006-10-20	Paper

Research outcomes over time

This page was built for person: Daniel Mölle