We revisit a graph width parameter that we dub bipartite treewidth, alon...
We introduce a graph-parametric framework for obtaining obstruction
char...
The branchwidth of a graph has been introduced by Roberson and
Seymour a...
Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends
first-order logic (𝖥𝖮) with...
By a seminal result of Valiant, computing the permanent of
(0,1)-matrice...
The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (...
Let G be a minor-closed graph class and let G be an n-vertex
graph. We s...
Given a graph G, we define bcg(G) as the minimum k for which G
can be co...
We introduce a new kernelization tool, called rainbow matching technique...
The Structural Theorem of the Graph Minors series of Robertson and Seymo...
We consider the mixed search game against an agile and visible fugitive....
A strict bramble of a graph G is a collection of pairwise-intersecting
c...
We introduce the graph theoretical parameter of edge treewidth. This
par...
We introduce a novel model-theoretic framework inspired from graph
modif...
In general, a graph modification problem is defined by a graph modificat...
The Weighted ℱ-Vertex Deletion for a class F of graphs asks, weighted gr...
The elimination distance to some target graph property P is a general gr...
For a finite collection of graphs F, the F-M-DELETION
problem consists i...
For a finite collection of graphs F, the F-M-DELETION
(resp. F-TM-DELETI...
We introduce the block elimination distance as a measure of how close a ...
Let G be a minor-closed graph class. We say that a graph G is a
k-apex o...
We introduce the rendezvous game with adversaries. In this game, two pla...
We introduce a supporting combinatorial framework for the Flat Wall Theo...
We consider a cops and robber game where the cops are blocking edges of ...
Let G be a graph class. We say that a graph G is a k-apex of
G if G cont...
The graph parameter of pathwidth can be seen as a measure of the topolog...
Neural networks are the pinnacle of Artificial Intelligence, as in recen...
The Disjoint Paths problem asks whether a fixed number of pairs of termi...
For a fixed connected graph H, the {H}-M-DELETION problem asks, given a
...
For a finite collection of graphs F, the F-TM-Deletion
problem has as ...
The concept of Reload cost in a graph refers to the cost that occurs whi...
We study the concept of compactor, which may be seen as a
counting-analo...
The notion of tree-cut width has been introduced by Wollan [The structur...
We consider the problems of deciding whether an input graph can be modif...
A partial complement of the graph G is a graph obtained from G by
comple...
We define a general variant of the graph clustering problem where the
cr...