Postdoc
42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)
Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances
Workshop on Approximation and Online Algorithms (WAOA)
Approximating δ-Covering
International Symposium on Algorithms and Computation (ISAAC)
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
International Workshop on Combinatorial Algorithm (IWOCA)
Make a Graph Singly Connected by Edge Orientations
Algorithmica: an international journal in computer scienceConflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
MFCS International Symposium on Mathematical Foundations of Computer Science (MFCS)
Recognizing H-Graphs - Beyond Circular-Arc Graphs