Postdoc
Discrete Mathematics Decompositions into two linear forests of bounded lengths
Theoretical Computer Science On orientations maximizing total arc-connectivity
Theoretical Computer Science Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
European Conference on Combinatorics Graph Theory and Applications (EUROCOMB) On the minimum number of inversions to make a digraph k-(arc-)strong
Discrete Optimization