research
∙
05/10/2021
On the inversion number of oriented graphs
Let D be an oriented graph. The inversion of a set X of vertices in D co...
share
research
∙
03/16/2020
On the parameterized complexity of 2-partitions
We give an FPT algorithm for deciding whether the vertex set a digraph D...
research
∙
08/19/2019
Safe sets in digraphs
A non-empty subset S of the vertices of a digraph D is called a safe se...
research
∙
07/01/2019
The directed 2-linkage problem with length constraints
The weak 2-linkage problem for digraphs asks for a given digraph and ve...
research
∙
06/30/2019
Connecting edge-colouring
This paper studies the problem of connecting edge-colouring. Given an un...
research
∙
05/27/2019
