D. Marx

Publications
Influence

M. Cygan, F. Fomin, +5 authors S. Saurabh
Computer Science
Springer International Publishing
23 July 2015

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

Parameterized graph separation problems

D. Marx
Computer Science, Mathematics
Theor. Comput. Sci.
28 February 2006

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

Size Bounds and Query Plans for Relational Joins

Albert Atserias, Martin Grohe, D. Marx
Mathematics, Computer Science
49th Annual IEEE Symposium on Foundations of…
25 October 2008

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

Parameterized Complexity and Approximation Algorithms

D. Marx
Mathematics, Computer Science
Comput. J.
2008

Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. Expand

Fixed-parameter tractability of multicut parameterized by the size of the cutset

D. Marx, I. Razgon
Mathematics, Computer Science
STOC '11
18 October 2010

We show that both the Edge Multicut and Vertex Multicut problems can be solved in time 2O(p3), i.e., fixed-parameter tractable parameterized by the size of the cutset in the solution. Expand

Lower bounds based on the Exponential Time Hypothesis

D. Lokshtanov, D. Marx, S. Saurabh
Mathematics, Computer Science
Bull. EATCS
2011

The Exponential Time Hypothesis (ETH) is a conjecture stating that, roughly speaking, n-variable 3-SAT cannot be solved in time 2o(n). Expand

Known algorithms on graphs of bounded treewidth are probably optimal

D. Lokshtanov, D. Marx, S. Saurabh
Mathematics, Physics
SODA '11
30 July 2010

We obtain a number of lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth. Expand

Constraint solving via fractional edge covers

Martin Grohe, D. Marx
Mathematics
SODA
22 January 2006

Many important combinatorial problems can be modelled as constraint satisfaction problems, hence identifying polynomial-time solvable classes of constraint satisfaction problems received a lot of… Expand

Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

D. Marx
Mathematics, Computer Science
JACM
4 November 2009

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

Constraint solving via fractional edge covers

Martin Grohe, D. Marx
Mathematics, Computer Science
SODA '06
28 October 2014

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

Recommended Authors