
An Algorithmic MetaTheorem for Graph Modification to Planarity and FOL
In general, a graph modification problem is defined by a graph modificat...
read it

A Constantfactor Approximation for Weighted Bond Cover
The Weighted ℱVertex Deletion for a class F of graphs asks, weighted gr...
read it

Parameterized Complexity of Elimination Distance to FirstOrder Logic Properties
The elimination distance to some target graph property P is a general gr...
read it

Hitting minors on bounded treewidth graphs. III. Lower bounds
For a finite collection of graphs F, the FMDELETION problem consists i...
read it

Hitting minors on bounded treewidth graphs. II. Singleexponential algorithms
For a finite collection of graphs F, the FMDELETION (resp. FTMDELETI...
read it

Block Elimination Distance
We introduce the block elimination distance as a measure of how close a ...
read it

kapices of minorclosed graph classes. I. Bounding the obstructions
Let G be a minorclosed graph class. We say that a graph G is a kapex o...
read it

Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs
We introduce the rendezvous game with adversaries. In this game, two pla...
read it

A more accurate view of the Flat Wall Theorem
We introduce a supporting combinatorial framework for the Flat Wall Theo...
read it

Edge Degeneracy: Algorithmic and Structural Results
We consider a cops and robber game where the cops are blocking edges of ...
read it

An FPTalgorithm for recognizing kapices of minorclosed graph classes
Let G be a graph class. We say that a graph G is a kapex of G if G cont...
read it

A linear fixed parameter tractable algorithm for connected pathwidth
The graph parameter of pathwidth can be seen as a measure of the topolog...
read it

HcoreInit: Neural Network Initialization based on Graph Degeneracy
Neural networks are the pinnacle of Artificial Intelligence, as in recen...
read it

Planar Disjoint Paths in Linear Time
The Disjoint Paths problem asks whether a fixed number of pairs of termi...
read it

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
For a fixed connected graph H, the {H}MDELETION problem asks, given a ...
read it

Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
For a finite collection of graphs F, the FTMDeletion problem has as ...
read it

Minimum Reload Cost Graph Factors
The concept of Reload cost in a graph refers to the cost that occurs whi...
read it

Datacompression for Parametrized Counting Problems on Sparse graphs
We study the concept of compactor, which may be seen as a countinganalo...
read it

Lean treecut decompositions: obstructions and algorithms
The notion of treecut width has been introduced by Wollan [The structur...
read it

On the Parameterized Complexity of Graph Modification to FirstOrder Logic Properties
We consider the problems of deciding whether an input graph can be modif...
read it

Partial complementation of graphs
A partial complement of the graph G is a graph obtained from G by comple...
read it

Clustering to Given Connectivities
We define a general variant of the graph clustering problem where the cr...
read it
Dimitrios M. Thilikos
is this you? claim profile