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

• Dogeas, K., Erlebach, T., Kammer, F., Meintrup, J., & Moses Jr, W. K. (2024, July). Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. Presented at 51st EATCS International Colloquium on Automata, Languages and Programming, Tallinn, Estonia
• Dogeas, K., Erlebach, T., & Liang, Y.-C. (2024, September). Scheduling with Obligatory Tests. Presented at 32nd Annual European Symposium on Algorithms (ESA 2024), Egham, United Kingdom
• Bampis, E., Dogeas, K., Erlebach, T., Megow, N., Schlöter, J., & Trehan, A. (2024, August). Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. Presented at International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2024), London, UK
• Erlebach, T., Morawietz, N., & Wolf, P. (2024, June). Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. Presented at 3rd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2024), Patras, Greece
• Baklan Sen, B., Diner, Ö. Y., & Erlebach, T. (2023, December). List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. Presented at 29th International Computing and Combinatorics Conference (COCOON 2023), Honolulu, Hawaii, USA
• Erlebach, T., & Spooner, J. T. (2022, March). Parameterized temporal exploration problems. Presented at 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Virtual Conference
• Erlebach, T., & Spooner, J. T. (2021, December). Exploration of k-Edge-Deficient Temporal Graphs. Presented at WADS 2021: Algorithms and Data Structures
• Bampis, E., Dürr, C., Erlebach, T., de Lima, M. S., Megow, N., & Schlöter, J. (2021, December). Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. Presented at 29th Annual European Symposium on Algorithms (ESA 2021), Lisbon, Portugal (Virtual Conference)
• Erlebach, T., Hoffmann, M., & de Lima, M. S. (2021, December). Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Presented at 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021), Saarbrücken, Germany

Journal Article

• Mommessin, C., Erlebach, T., & Shakhlevich, N. V. (online). Classification and evaluation of the algorithms for vector bin packing. Computers and Operations Research, Article 106860. https://doi.org/10.1016/j.cor.2024.106860
• Erlebach, T., Morawietz, N., Spooner, J. T., & Wolf, P. (2024). A cop and robber game on edge-periodic temporal graphs. Journal of Computer and System Sciences, 144, Article 103534. https://doi.org/10.1016/j.jcss.2024.103534
• 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. (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., & 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