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 …

We revisit two well-studied problems, Bounded Degree Vertex Deletion and Defective
Coloring, where the input is a graph G and a target degree Δ, and we are asked either to edit …

Cohen-Addad, Filtser, Klein and Le FOCS'20 constructed a stochastic embedding of minor-
free graphs of diameter D into graphs of treewidth O_ϵ(\logn) with expected additive …

Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …

In low distortion metric embeddings, the goal is to embed a host “hard” metric space into a
“simpler” target space while approximately preserving pairwise distances. A highly desirable …

Treewidth is as an important parameter that yields tractability for many problems. For
example, graph problems expressible in Monadic Second Order (MSO) logic and …

Vertex Integrity is a graph measure which sits squarely between two more well-studied
notions, namely vertex cover and tree-depth, and that has recently gained attention as a …

Motivated by the importance of dynamic programming (DP) in parameterized complexity, we
consider several fundamental fine-grained questions, such as the following representative …

Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-
hard problems. This has been most successful for graphs of low treewidth: Many problems …

Abstract In the Upper Dominating Set problem, the goal is to find a minimal dominating set of
maximum size. We study the complexity of parameterized algorithms for Upper Dominating …