Staff profile

I received a PhD in Computer Science from Technische Universität München in 1999. From 2000 to 2004 I was an Assistant Professor in Theory of Communication Networks at ETH Zürich. From September 2004 to September 2021 I was with the Department of Computer Science (later renamed as School of Informatics and then School of Computing and Mathematical Sciences) at University of Leicester, first as Reader and then, from April 2007, as Professor. In September 2021 I joined the Department of Computer Science at Durham University as Professor.

Publications

You can check my DBLP page or my Google Scholar page.

Research Groups

• NESTiD: Network Engineering, Science and Theory in Durham
• ACiD: Algorithms and Complexity in Durham

• Algorithmic aspects of communication networks
• Time-varying graphs and networks
• Computing with explorable uncertainty
• Approximation and on-line algorithms for combinatorial optimisation problems

Conference Paper

• Erlebach, Thomas & Spooner, Jakob T. (2022), Parameterized temporal exploration problems, in Aspnes, James & Michail, Othon eds, LIPIcs 221: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15:1-15:17.
• Bampis, Evripidis, Dürr, Christoph, Erlebach, Thomas, de Lima, Murilo Santos, Megow, Nicole & Schlöter, Jens (2021), Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty, LIPIcs 204: 29th Annual European Symposium on Algorithms (ESA 2021). Lisbon, Portugal (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
• Erlebach, Thomas & Spooner, Jakob T. (2021), Exploration of k-Edge-Deficient Temporal Graphs, Lecture Notes in Computer Science 12808: WADS 2021: Algorithms and Data Structures. Springer, 371-384.
• Erlebach, Thomas, Hoffmann, Michael & de Lima, Murilo Santos (2021), Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries, LIPIcs 187: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Saarbrücken, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 27:1-27:18.

Journal Article

• Erlebach, Thomas & Spooner, Jakob T. (2023). Parameterized temporal exploration problems. Journal of Computer and System Sciences 135: 73-88.
• Erlebach, Thomas, Hoffmann, Michael & de Lima, Murilo Santos (2023). Round-competitive algorithms for uncertainty problems with parallel queries. Algorithmica 85: 406–443.
• Erlebach, Thomas & Spooner, Jakob T. (2022). Exploration of k-Edge-Deficient Temporal Graphs. Acta Informatica 59(4): 387-407.
• Luo, Kelin, Erlebach, Thomas & Xu, Yinfeng (2022). Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings. Discrete Applied Mathematics 313: 53-66.
• Carvalho, Iago A., Erlebach, Thomas & Papadopoulos, Kleitos (2021). On the fast delivery problem with one or two packages. Journal of Computer and System Sciences 115: 246-263.