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

• Baklan Sen, B., Diner, Ö. Y., & Erlebach, T. (in press). List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. In Proceedings of the 29th International Computing and Combinatorics Conference (COCOON 2023)
• Erlebach, T., & Spooner, J. T. (2022). Parameterized temporal exploration problems. In J. Aspnes, & O. Michail (Eds.), . https://doi.org/10.4230/lipics.sand.2022.15
• Erlebach, T., Hoffmann, M., & de Lima, M. S. (2021). Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. . https://doi.org/10.4230/lipics.stacs.2021.27
• Bampis, E., Dürr, C., Erlebach, T., de Lima, M. S., Megow, N., & Schlöter, J. (2021). Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. . https://doi.org/10.4230/lipics.esa.2021.10
• Erlebach, T., & Spooner, J. T. (2021). Exploration of k-Edge-Deficient Temporal Graphs. . https://doi.org/10.1007/978-3-030-83508-8_27

Journal Article

• Erlebach, T., & Spooner, J. T. (2023). Parameterized temporal exploration problems. Journal of Computer and System Sciences, 135, 73-88. https://doi.org/10.1016/j.jcss.2023.01.003
• Erlebach, T., Hoffmann, M., & de Lima, M. S. (2023). Round-competitive algorithms for uncertainty problems with parallel queries. Algorithmica, 85(2), 406-443. https://doi.org/10.1007/s00453-022-01035-6
• Erlebach, T., & Spooner, J. T. (2022). Exploration of k-Edge-Deficient Temporal Graphs. Acta Informatica, 59(4), 387-407. https://doi.org/10.1007/s00236-022-00421-5
• Luo, K., Erlebach, T., & Xu, Y. (2022). Car-Sharing between Two Locations: Online Scheduling with Flexible Advance Bookings. Discrete Applied Mathematics, 313, 53-66. https://doi.org/10.1016/j.dam.2022.01.016
• Carvalho, I. A., Erlebach, T., & Papadopoulos, K. (2021). On the fast delivery problem with one or two packages. Journal of Computer and System Sciences, 115, 246-263. https://doi.org/10.1016/j.jcss.2020.09.002