Filters are collections of sets that are closed under supersets and finite intersections, serving
as fundamental tools in topology and set theory. An ultrafilter, a maximal filter on a set, plays …

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 …

Graph characteristics are often analyzed using various parameters, with ongoing research
dedicated to exploring these aspects. A key metric in this field is the” graph width …

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 …

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 …

We study the tractability of the maximum independent set problem from the viewpoint of
graph width parameters, with the goal of defining a width parameter that is as general as …

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 …

Algorithms for computing or approximating optimal decompositions for decompositional
parameters such as treewidth or clique-width have so far traditionally been tailored to …

We study how the relationship between non-equivalent width parameters changes once we
restrict to some special graph class. As width parameters, we consider treewidth, clique …