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 investigate how efficiently a well-studied family of domination-type problems can be
solved on bounded-treewidth graphs. For sets σ, ρ of non-negative integers, a (σ, ρ)-set of a …

For a graph H, a graph G is an H-graph if it is an intersection graph of connected subgraphs
of some subdivision of H. H-graphs naturally generalize several important graph classes like …

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 …

A semitotal dominating set of a graph G with no isolated vertex is a dominating set D of G
such that every vertex in D is within distance two of another vertex in D. The minimum size γ t …

In this paper we continue the study of locally checkable problems under the framework
introduced by Bonomo-Braberman and Gonzalez in 2020, by focusing on graphs of …

By providing a new framework, we extend previous results on locally checkable problems in
bounded treewidth graphs. As a consequence, we show how to solve, in polynomial time for …

In this paper we continue the study of locally checkable problems under the framework
introduced by Bonomo-Braberman and Gonzalez in 2020, by focusing on graphs of …

We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020 on $ r $-
locally checkable problems. We propose a dynamic programming algorithm that takes as …

Linear MIM-Width of Trees | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …