D
Dániel Marx
Researcher at Max Planck Society
Publications - 305
Citations - 11392
Dániel Marx is an academic researcher from Max Planck Society. The author has contributed to research in topics: Parameterized complexity & Treewidth. The author has an hindex of 54, co-authored 292 publications receiving 10178 citations. Previous affiliations of Dániel Marx include Humboldt University of Berlin & Humboldt State University.
Papers
More filters
Book
Parameterized Algorithms
Marek Cygan,Fedor V. Fomin,Lukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh +7 more
TL;DR: This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques.
Book ChapterDOI
Lower bounds based on the Exponential Time Hypothesis
TL;DR: This chapter proves lower bounds based on ETH for the time needed to solve various problems, and in many cases these lower bounds match the running time of the best known algorithms for the problem.
Journal ArticleDOI
Parameterized graph separation problems
TL;DR: If both k and l are parameters, then (a, (b) and (d) are fixed-parameter tractable, while (c, and (e) are W[1]-hard.
Journal ArticleDOI
Parameterized Complexity and Approximation Algorithms
TL;DR: The different ways parameterized complexity can be extended to approximation algorithms, survey results of this type and proposed directions for future research are discussed.
Journal ArticleDOI
Can You Beat Treewidth
TL;DR: It is proved that if the running lime of A is f(G)nO(k/logk), where k is the treewidth of the primal graph G and f is an arbitrary function, then the Exponential Time Hypothesis fails.