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 …

Carbon nano tubes are functionalized to enhance their surface properties and target
specificity. In this research, a novel ionic liquid functionalized carbon nanotube (IL-CNT) …

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 …

For a tree decomposition $\mathcal {T} $ of a graph $ G $, by $\mu (\mathcal {T}) $ we
denote the size of a largest induced matching in $ G $ all of whose edges intersect one bag …

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 …

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 …

Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs.
In this paper we introduce the concept of proper thinness, such that graphs with bounded …

Mim-width and sim-width are among the most powerful graph width parameters, with sim-
width more powerful than mim-width, which is in turn more powerful than clique-width. While …