We generalize the family of (σ, ρ) problems and locally checkable vertex partition problems
to their distance versions, which naturally captures well-known problems such as Distance-r …

We initialize a series of papers deepening the understanding of algorithmic properties of the
width parameter maximum induced matching width (mim-width) of graphs. In this first volume …

We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of
bounded maximum induced matching width (mim-width). Explicitly, given a branch …

We develop a framework for applying treewidth-based dynamic programming on graphs
with “hybrid structure”, ie, with parts that may not have small treewidth but instead possess …

In this paper, we design a framework to obtain efficient algorithms for several problems with
a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node …

The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex
Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a …

In this paper, we design a framework to obtain efficient algorithms for several problems with
a global constraint (acyclicity or connectivity) such as Connected Dominating Set, Node …

The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex
Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a …

Abstract The (Weighted) Subset Feedback Vertex Set problem is a generalization of the
classical Feedback Vertex Set problem and asks for a vertex set of minimum (weight) size …

In the last decade, algorithmic frameworks based on a structural graph parameter called
mim-width have been developed to solve generally NP-hard problems. However, it is known …