research
∙
09/12/2023
The χ-binding function of d-directional segment graphs
Given a positive integer d, the class d-DIR is defined as all those inte...
share
research
∙
07/06/2023
The grid-minor theorem revisited
We prove that for every planar graph X of treedepth h, there exists a po...
research
∙
06/19/2023
On the minimum number of arcs in 4-dicritical oriented graphs
The dichromatic number χ⃗(D) of a digraph D is the minimum number of col...
research
∙
03/21/2023
On the minimum number of inversions to make a digraph k-(arc-)strong
The inversion of a set X of vertices in a digraph D consists of reversin...
research
∙
02/24/2023
Neighborhood complexity of planar graphs
Reidl, Sánchez Villaamil, and Stravopoulos (2019) characterized graph cl...
research
∙
12/18/2022
Problems, proofs, and disproofs on the inversion number
The inversion of a set X of vertices in a digraph D consists in reversin...
research
∙
08/18/2022
On the parameterized complexity of symmetric directed multicut
We study the problem Symmetric Directed Multicut from a parameterized co...
research
∙
07/03/2022
On the minimum number of arcs in k-dicritical oriented graphs
The dichromatic number (D) of a digraph D is the least integer k such th...
research
∙
12/31/2021
Preference Swaps for the Stable Matching Problem
An instance I of the Stable Matching Problem (SMP) is given by a biparti...
research
∙
02/01/2021
