• Publications
  • Influence
Parameterized Algorithms
TLDR
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. Expand
  • 937
  • 68
  • PDF
Parameterized graph separation problems
  • D. Marx
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 28 February 2006
TLDR
We consider parameterized problems where some separation property has to be achieved by deleting at most k vertices from a graph to achieve a certain goal. Expand
  • 230
  • 52
  • PDF
Size Bounds and Query Plans for Relational Joins
TLDR
We address the questions of how to estimate the size of a sequence of joins and how to execute the sequence best from a theoretical point of view. Expand
  • 180
  • 30
  • PDF
Parameterized Complexity and Approximation Algorithms
  • D. Marx
  • Mathematics, Computer Science
  • Comput. J.
  • 2008
TLDR
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. Expand
  • 244
  • 29
  • PDF
Fixed-parameter tractability of multicut parameterized by the size of the cutset
TLDR
We show that both the Edge Multicut and Vertex Multicut problems can be solved in time 2<sup>O(p<sup><sup>3</sup>)</sup>, i.e., fixed-parameter tractable parameterized by the size of the cutset in the solution. Expand
  • 127
  • 23
  • PDF
Lower bounds based on the Exponential Time Hypothesis
TLDR
The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly speaking, n-variable 3-SAT cannot be solved in time 2o(n). Expand
  • 290
  • 21
  • PDF
Known algorithms on graphs of bounded treewidth are probably optimal
TLDR
We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. Expand
  • 172
  • 20
  • PDF
Constraint solving via fractional edge covers
Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time solvable classes of constraint satisfaction problems received a lot ofExpand
  • 102
  • 14
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
  • D. Marx
  • Mathematics, Computer Science
  • JACM
  • 4 November 2009
TLDR
An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. Expand
  • 94
  • 14
  • PDF
Constraint solving via fractional edge covers
TLDR
We prove that constraint satisfaction problems with bounded fractional hypertree width can be solved in polynomial time (provided that a the tree decomposition is given in the input). Expand
  • 118
  • 13
  • PDF
...
1
2
3
4
5
...