Thomas Erlebach

Professor Thomas Erlebach is a faculty member in the Department of Computer Science at Durham University. Previously, he held roles at the University of Leicester (2004–2021), where he was a Reader and later a Professor. His academic journey includes a PhD from TU München (1999) and postdoctoral research at ETH Zürich (2000–2004). He is affiliated with the NESTiD (Network Engineering, Science, and Theory) and ACiD (Algorithms and Complexity in Durham) research groups.

Erlebach's research focuses on algorithmic aspects of communication networks, time-varying graphs, computing with explorable uncertainty, approximation algorithms, and online combinatorial optimization. He has supervised numerous PhD students, including recent advisees like Kunanon Burathep and Jakob T. Spooner.

His publications span conferences like ESA, APPROX/RANDOM, and ICALP, with recent work addressing temporal graph exploration, scheduling under uncertainty, and parameterized algorithms. Erlebach actively participates in program committees for theoretical computer science events and holds editorial roles in journals like Algorithmica and The Computer Journal.

Grants include EPSRC funding for projects like ACUTE (Algorithms for Computing with Uncertainty) and collaborations on network-related research. His work bridges theoretical foundations and practical applications in distributed systems and algorithm design.