Distributed Computing Content-oblivious leader election on rings
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
International Colloquium on Automata Languages and Programming (ICALP)
Robust Contraction Decomposition for Minor-Free Graphs and its Applications
European Symposium on Algorithms (ESA)