We introduce a logic called distance neighborhood logic with acyclicity and connectivity
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …

We continue the study of (tw, ω)-bounded graph classes, that is, hereditary graph classes in
which the treewidth can only be large due to the presence of a large clique, with the goal of …

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 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 …

In this paper, we showcase the class XNLP as a natural place for many hard problems
parameterized by linear width measures. This strengthens existing W [1]-hardness proofs for …

A large number of NP‐hard graph problems are solvable in XP time when parameterized by
some width parameter. Hence, when solving problems on special graph classes, it is helpful …

In 2020, we initiated a systematic study of graph classes in which the treewidth can only be
large due to the presence of a large clique, which we call (tw, ω)-bounded. The family of (tw …

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 …

The computational complexity of the graph isomorphism problem is considered to be a
major open problem in theoretical computer science. It is known that testing isomorphism of …

Abstract Biró, Hujter, and Tuza introduced the concept of H-graphs (1992), intersection
graphs of connected subgraphs of a subdivision of a graph H. They naturally generalize …