Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

We investigate the gap between theory and practice for exact branching algorithms. In
theory, branch-and-reduce algorithms currently have the best time complexity for numerous …

The independent set problem is NP-hard and particularly difficult to solve in large sparse
graphs, which typically take exponential time to solve exactly using the best-known exact …

One powerful technique to solve NP-hard optimization problems in practice is branch-and-
reduce search—which is branch-and-bound that intermixes branching with reductions to …

We present the winning solver of the Parameterized Algorithms and Computational
Experiments (PACE) 2019 Challenge, Vertex Cover Track. The minimum vertex cover …

A directed odd cycle transversal of a directed graph (digraph) D is a vertex set S that
intersects every odd directed cycle of D. In the Directed Odd Cycle Transversal (DOCT) …

A recent trend in parameterized algorithms is the application of polytope tools to fixed-
parameter tractable (FPT) algorithms eg, Cygan et al., FOCS 2011, 52nd Annual Symposium …

The most efficient algorithms for finding maximum independent sets in both theory and
practice use reduction rules to obtain a much smaller problem instance called a kernel. The …

To this day, the maximum clique problem remains a computationally challenging problem.
Indeed, despite researchers' best efforts, there exist unsolved benchmark instances with …

Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected
graphs is among the most prominent problems of algorithmic graph theory. For n-vertex and …