2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2024★ 1 cited
Diameter of the inversion graph
Frédéric Havet, Florian Hörsch, Clément Rambaud
In an oriented graph , the inversion of a subset of vertices consists in reversing the orientation of all arcs with both endvertices in . The inversion graph of a l…
cs.DS2022★ 1 cited
On the parameterized complexity of symmetric directed multicut
Eduard Eiben, Clément Rambaud, Magnus Wahlström
We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph , a set of cut requests $C=\{(s_1,t_1),\ldo…
math.CO2022★ 2 cited
On the minimum number of arcs in -dicritical oriented graphs
Pierre Aboulker, Thomas Bellitto, Frédéric Havet +1
The dichromatic number $\dic(D)$ of a digraph is the least integer such that can be partitioned into directed acyclic digraphs. A digraph is -dicritical if $\dic…