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 …

In this article, the Program Committee of the Second Parameterized Algorithms and
Computational Experiments challenge (PACE 2017) reports on the second iteration of the …

We investigate the complexity of several fundamental polynomial-time solvable problems on
graphs and on matrices, when the given instance has low treewidth; in the case of matrices …

Consider a dynamic programming scheme for a decision problem in which all subproblems
involved are also decision problems. An implementation of such a scheme is positive …

In the Feedback Vertex Set (FVS) problem, one is given an undirected graph G and an
integer k, and one needs to determine whether there exists a set of k vertices that intersects …

We introduce FlowCutter, a novel algorithm to compute a set of edge cuts or node
separators that optimize cut size and balance in the Pareto sense. Our core algorithm …

The organizers of the 4th Parameterized Algorithms and Computational Experiments
challenge (PACE 2019) report on the 4th iteration of the PACE challenge. This year, the first …

We propose a new single-winner election method (" Schulze method") and prove that it
satisfies many academic criteria (eg monotonicity, reversal symmetry, resolvability …

Abstract The Parameterized Algorithms and Computational Experiments challenge (PACE)
2021 was devoted to engineer algorithms solving the NP-hard Cluster Editing problem, also …

Recent empirical evaluations of exact algorithms for Feedback Vertex Set have
demonstrated the efficiency of a highest-degree branching algorithm with a degree-based …