Interval graphs represent vertices as intervals on the real line, with edges denoting
overlapping intervals, while proper interval graphs prevent one interval from being fully …

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 present a new subclass of interval graphs that generalizes connected proper interval
graphs. These graphs are characterized by vertex orderings called connected perfect …

Interval graphs, intersection graphs of segments on a real line (intervals), play a key role in
the study of algorithms and special structural properties. Unit interval graphs, their proper …

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 …

What does it mean today to study a problem from a computational point of view? We focus
on parameterized complexity and on Column 16 “Graph Restrictions and Their Effect” of DS …

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 …

Vertex and edge orderings of graphs are commonly used in algorithmic graph theory. Such
orderings can encode structural properties of graphs in a condensed way and, thus, they …

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 …

For nonempty σ, ρ⊆ ℕ, a vertex set S in a graph G is a (σ, ρ)-dominating set if for all v∈ S,| N
(v)∩ S|∈ σ, and for all v∈ V (G)⧵ S,| N (v)∩ S|∈ ρ. The Min/Max (σ, ρ)-Dominating Set …