| 2026 | ESA | Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones. | Thomas Erlebach, Kelin Luo, Wen Zhang |
| 2026 | SOFSEM | Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model. | Kunanon Burathep, Thomas Erlebach, William K. Moses Jr. |
| 2025 | ESA | Recognizing and Realizing Temporal Reachability Graphs. | Thomas Erlebach, Othon Michail, Nils Morawietz |
| 2024 | ESA | Scheduling with Obligatory Tests. | Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang |
| 2024 | ICALP | Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. | Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr. |
| 2023 | COCOON | List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. | Banu Baklan Sen, znur Yasar Diner, Thomas Erlebach |
| 2023 | IJCAI | Sorting and Hypergraph Orientation under Uncertainty with Predictions. | Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlter |
| 2022 | ESA | Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. | Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlter |
| 2022 | ISAAC | Package Delivery Using Drones with Restricted Movement Areas. | Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma |
| 2021 | ESA | Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. | Evripidis Bampis, Christoph Drr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlter |
| 2021 | STACS | Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. | Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima |
| 2021 | SOFSEM | Algorithms that Access the Input via Queries. | Thomas Erlebach |
| 2021 | WADS | Exploration of k-Edge-Deficient Temporal Graphs. | Thomas Erlebach, Jakob T. Spooner |
| 2020 | SIROCCO | Non-strict Temporal Exploration. | Thomas Erlebach, Jakob T. Spooner |
| 2020 | SOFSEM | A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. | Thomas Erlebach, Jakob T. Spooner |
| 2019 | FCT | An Efficient Algorithm for the Fast Delivery Problem. | Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos |
| 2019 | ICALP | Two Moves per Time Step Make a Difference. | Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner |
| 2019 | STACS | Car-Sharing on a Star Network: On-Line Scheduling with k Servers. | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2018 | CiE | Computing and Scheduling with Explorable Uncertainty. | Thomas Erlebach |
| 2018 | COCOON | Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2018 | ISAAC | Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. | Annette M. C. Ficker, Thomas Erlebach, Mats Mihalk, Frits C. R. Spieksma |
| 2018 | ISAAC | Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2018 | MFCS | Faster Exploration of Degree-Bounded Temporal Graphs. | Thomas Erlebach, Jakob T. Spooner |
| 2018 | MFCS | Car-Sharing between Two Locations: Online Scheduling with Two Servers. | Kelin Luo, Thomas Erlebach, Yinfeng Xu |
| 2017 | COCOA | Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors. | Aeshah Alsughayyir, Thomas Erlebach |
| 2017 | COCOA | Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. | Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks |
| 2017 | ISPDC | A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems. | Aeshah Alsughayyir, Thomas Erlebach |
| 2016 | FAW | Algorithms for Queryable Uncertainty. | Thomas Erlebach |
| 2016 | PDP | Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems. | Aeshah Alsughayyir, Thomas Erlebach |
| 2015 | ICALP | On Temporal Graph Exploration. | Thomas Erlebach, Michael Hoffmann, Frank Kammer |
| 2015 | IWOCA | Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. | Hasna Mohsen Alqahtani, Thomas Erlebach |
| 2015 | MASS | An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks. | Aram Rasul, Thomas Erlebach |
| 2015 | SAGT | Further Results on Capacitated Network Design Games. | Thomas Erlebach, Matthew Radoja |
| 2014 | MFCS | Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. | Thomas Erlebach, Michael Hoffmann, Frank Kammer |
| 2014 | SOFSEM | Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. | Hasna Mohsen Alqahtani, Thomas Erlebach |
| 2014 | WG | Minimum Spanning Tree Verification Under Uncertainty. | Thomas Erlebach, Michael Hoffmann |
| 2013 | CIAC | Approximation Algorithms for Disjoint | Hasna Mohsen Alqahtani, Thomas Erlebach |
| 2012 | ICALP | Computational Complexity of Traffic Hijacking under BGP and S-BGP. | Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani |
| 2011 | SPAA | Maximising lifetime for fault-tolerant target coverage in sensor networks. | Thomas Erlebach, Tom Grant, Frank Kammer |
| 2010 | Algosensors | Scheduling Multicast Transmissions under SINR Constraints. | Thomas Erlebach, Tom Grant |
| 2010 | ATMOS | Frontmatter, Table of Contents, Preface, Organization. | Thomas Erlebach, Marco E. Lbbecke |
| 2010 | ICNP | Assigning AS relationships to satisfy the Gao-Rexford conditions. | Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini |
| 2010 | IWCMC | Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. | Ambreen Shahnaz, Thomas Erlebach |
| 2010 | MOMM | CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks. | Shagufta Henna, Thomas Erlebach |
| 2009 | GLOBECOM | Path Splicing with Guaranteed Fault Tolerance. | Thomas Erlebach, Anna Mereu |
| 2009 | IWCMC | Approximating node-weighted multicast trees in wireless ad-hoc networks. | Thomas Erlebach, Ambreen Shahnaz |
| 2009 | WAOA | A (4 + | Thomas Erlebach, Mats Mihalk |
| 2008 | LATIN | Domination in Geometric Intersection Graphs. | Thomas Erlebach, Erik Jan van Leeuwen |
| 2008 | SODA | Broadcast scheduling: algorithms and complexity. | Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller |
| 2008 | SODA | Approximating geometric coverage problems. | Thomas Erlebach, Erik Jan van Leeuwen |
| 2008 | STACS | Trimming of Graphs, with Application to Point Labeling. | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff |
| 2008 | STACS | Computing Minimum Spanning Trees with Uncertainty. | Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Mats Mihalk, Rajeev Raman |
| 2008 | SIROCCO | Discovery of Network Properties with All-Shortest-Paths Queries. | Davide Bil, Thomas Erlebach, Mats Mihalk, Peter Widmayer |
| 2006 | CIAC | Network Discovery and Verification with Distance Queries. | Thomas Erlebach, Alexander Hall, Michael Hoffmann, Mats Mihalk |
| 2006 | ICALP | Length-Bounded Cuts and Flows. | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Khler, Heiko Schilling, Martin Skutella |
| 2005 | WG | Network Discovery and Verification. | Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Mats Mihalk, L. Shankar Ram |
| 2004 | INFOCOM | Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing. | Thomas Erlebach, Maurice Regg |
| 2004 | ISCC | Routing in all-optical ring networks revisited. | Stamatis Stefanakos, Thomas Erlebach |
| 2004 | STACS | An Algorithmic View on OVSF Code Assignment. | Thomas Erlebach, Riko Jacob, Mats Mihalk, Marc Nunkesser, Gbor Szab, Peter Widmayer |
| 2004 | WAOA | Off-line Admission Control for Advance Reservations in Star Networks. | Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl |
| 2004 | WAOA | Joint Base Station Scheduling. | Thomas Erlebach, Riko Jacob, Mats Mihalk, Marc Nunkesser, Gbor Szab, Peter Widmayer |
| 2003 | ISAAC | Wavelength Conversion in Shortest-Path All-Optical Networks. | Thomas Erlebach, Stamatis Stefanakos |
| 2003 | STACS | On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. | Thomas Erlebach, Stamatis Stefanakos |
| 2003 | WADS | Routing and Call Control Algorithms for Ring Networks. | R. Sai Anand, Thomas Erlebach |
| 2003 | WAOA | Online Coloring of Intervals with Bandwidth. | Udo Adamy, Thomas Erlebach |
| 2003 | WAOA | Scheduling AND/OR-Networks on Identical Parallel Machines. | Thomas Erlebach, Vanessa Kb, Rolf H. Mhring |
| 2003 | WG | Greedy Edge-Disjoint Paths in Complete Graphs. | Paz Carmi, Thomas Erlebach, Yoshio Okamoto |
| 2003 | WG | Resource Allocation Problems in Multifiber WDM Tree Networks. | Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos |
| 2002 | DAC | Schedulability of event-driven code blocks in real-time embedded systems. | Samarjit Chakraborty, Thomas Erlebach, Simon Knzli, Lothar Thiele |
| 2002 | ICALP | Call Control in Rings. | Udo Adamy, Christoph Ambhl, R. Sai Anand, Thomas Erlebach |
| 2002 | LATIN | On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. | R. Sai Anand, Thomas Erlebach |
| 2002 | SODA | NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. | Thomas Erlebach, Alexander Hall |
| 2001 | FCT | New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. | Thomas Erlebach, Danica Vukadinovic |
| 2001 | ISAAC | On the Complexity of Train Assignment Problems. | Thomas Erlebach, Martin Gantenbein, Daniel Hrlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhfel, David Scot Taylor, Peter Widmayer |
| 2001 | MFCS | Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. | Thomas Erlebach |
| 2001 | SODA | Polynomial-time approximation schemes for geometric graphs. | Thomas Erlebach, Klaus Jansen, Eike Seidel |
| 2001 | WADS | On the Complexity of Scheduling Conditional Real-Time Code. | Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele |
| 2001 | WADS | Approximating Multi-objective Knapsack Problems. | Thomas Erlebach, Hans Kellerer, Ulrich Pferschy |
| 2000 | ICALP | Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. | Thomas Erlebach, Klaus Jansen |
| 2000 | ISAAC | Simple Algorithms for a Weighted Interval Selection Problem. | Thomas Erlebach, Frits C. R. Spieksma |
| 1998 | EuroPar | Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations. | Stefan Bischof, Ralf Ebner, Thomas Erlebach |
| 1998 | ISAAC | Maximizing the Number of Connections in Optical Tree Networks. | Thomas Erlebach, Klaus Jansen |
| 1997 | ALT | Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. | Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann |
| 1997 | ICALP | Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. | Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen |
| 1997 | WG | Off-Line and On-Line Call-Scheduling in Stars and Trees. | Thomas Erlebach, Klaus Jansen |