default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Mölle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2007
[b1]Daniel Mölle:
Exact algorithms based on specific complexity measures for hard problems. RWTH Aachen University, Germany, 2007, pp. 1-139
Journal Articles
- 2009
- [j4]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms. SIAM J. Discret. Math. 23(1): 407-427 (2009) - 2008
- [j3]Daniel 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
- [j2]Bernhard 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
- [j1]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Parameterized power domination complexity. Inf. Process. Lett. 98(4): 145-149 (2006)
Conference and Workshop Papers
- 2009
- [c9]Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Breaking Anonymity by Learning a Unique Minimum Hitting Set. CSR 2009: 299-309 - 2007
- [c8]Joachim Kneis, Daniel Mölle, Peter Rossmanith:
Partial vs. Complete Domination: t-Dominating Set. SOFSEM (1) 2007: 367-376 - 2006
- [c7]Daniel Mölle, Stefan Richter, Peter Rossmanith:
Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants. COCOON 2006: 265-273 - [c6]Daniel Mölle, Stefan Richter, Peter Rossmanith:
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover. CSR 2006: 270-280 - [c5]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Intuitive Algorithms and t-Vertex Cover. ISAAC 2006: 598-607 - [c4]Daniel Mölle, Stefan Richter, Peter Rossmanith:
A Faster Algorithm for the Steiner Tree Problem. STACS 2006: 561-570 - [c3]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Divide-and-Color. WG 2006: 58-67 - 2005
- [c2]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
On the Parameterized Complexity of Exact Satisfiability Problems. MFCS 2005: 568-579 - [c1]Joachim Kneis, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Algorithms Based on the Treewidth of Sparse Graphs. WG 2005: 385-396
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
