European Conference on Combinatorics Graph Theory and Applications (EUROCOMB)
On the minimum number of inversions to make a digraph k-(arc-)strong
Discrete Optimization