[HTML][HTML] A survey of parameterized algorithms and the complexity of edge modification
The survey is a comprehensive overview of the develo** area of parameterized
algorithms for graph modification problems. It describes state of the art in kernelization …
algorithms for graph modification problems. It describes state of the art in kernelization …
A survey on approximation in parameterized complexity: Hardness and algorithms
Parameterization and approximation are two popular ways of co** with NP-hard
problems. More recently, the two have also been combined to derive many interesting …
problems. More recently, the two have also been combined to derive many interesting …
Designing FPT algorithms for cut problems using randomized contractions
We introduce a new technique for designing fixed-parameter algorithms for cut problems,
called randomized contractions. We apply our framework to obtain the first fixed-parameter …
called randomized contractions. We apply our framework to obtain the first fixed-parameter …
Parameterized complexity and approximability of directed odd cycle transversal
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) …
intersects every odd directed cycle of D. In the Directed Odd Cycle Transversal (DOCT) …
Directed flow-augmentation
We show a flow-augmentation algorithm in directed graphs: There exists a randomized
polynomial-time algorithm that, given a directed graph G, two integers s, t∈ V (G), and an …
polynomial-time algorithm that, given a directed graph G, two integers s, t∈ V (G), and an …
Solving hard cut problems via flow-augmentation
We present a new technique for designing fixed-parameter algorithms for graph cut
problems in undirected graphs, which we call flow augmentation. Our technique is …
problems in undirected graphs, which we call flow augmentation. Our technique is …
On Weighted Graph Separation Problems and Flow Augmentation
One of the first applications of the recently introduced technique of flow augmentation [Kim et
al., STOC 2022] is a fixed-parameter algorithm for the weighted version of Directed …
al., STOC 2022] is a fixed-parameter algorithm for the weighted version of Directed …
Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
Abstract Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies
that there is no time algorithm that can solve 2-CSPs with k constraints (over a domain of …
that there is no time algorithm that can solve 2-CSPs with k constraints (over a domain of …
On directed feedback vertex set parameterized by treewidth
We study the D irected F eedback V ertex S et problem parameterized by the treewidth of the
input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot …
input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot …
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
We show fixed-parameter tractability of the DIRECTED MULTICUT problem with three
terminal pairs (with a randomized algorithm). In this problem we are given a directed graph …
terminal pairs (with a randomized algorithm). In this problem we are given a directed graph …