Postdoc
Innovations in Graph Theory Diameter of the inversion graph
Journal of Graph Theory On the Minimum Number of Inversions to Make a Digraph k‐(Arc‐)Strong
European Symposium on Algorithms (ESA)
International Symposium on Algorithms and Computation (ISAAC)
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
International Colloquium on Automata Languages and Programming (ICALP)
Problems on Group-Labeled Matroid Bases
SIAM Journal on Discrete Mathematics Rainbow Bases in Matroids
International Symposium on Computational Geometry (SoCG)
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
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