Thomas Erlebach

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 60

Top Venues

CoRR

Theor. Comput. Sci.

J. Comput. Syst. Sci.

ISAAC

Technical University Munich, Germany (PHD)

Education History

Technical University Munich, Germany

PHD

Publications

Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang
Scheduling with Obligatory Tests. CoRR (2024)
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP (2024)
Thomas Erlebach
Exploration and Rendezvous in Temporal Graphs (Invited Talk). SAND (2024)
Thomas Erlebach, Nils Morawietz, Jakob T. Spooner, Petra Wolf
A cop and robber game on edge-periodic temporal graphs. J. Comput. Syst. Sci. 144 (2024)
Thomas Erlebach, Kleitos Papadopoulos
A faster algorithm for the construction of optimal factoring automata. CoRR (2024)
Thomas Erlebach, Nils Morawietz, Petra Wolf
Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. SAND (2024)
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR (2024)
Thomas Erlebach, Jakob T. Spooner
Parameterised temporal exploration problems. J. Comput. Syst. Sci. 135 (2023)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR (2023)
Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR (2023)
Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. COCOON (1) (2023)
Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Algorithmica 85 (2) (2023)
Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. CoRR (2023)
Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI (2023)
Thomas Erlebach, Jakob T. Spooner
Parameterized Temporal Exploration Problems. SAND (2022)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA (2022)
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
Package Delivery Using Drones with Restricted Movement Areas. ISAAC (2022)
Thomas Erlebach, Jakob T. Spooner
Exploration of k-edge-deficient temporal graphs. Acta Informatica 59 (4) (2022)
Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
Package Delivery Using Drones with Restricted Movement Areas. CoRR (2022)
Thomas Erlebach, Jakob T. Spooner
Parameterized temporal exploration problems. CoRR (2022)
Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR (2022)
Kelin Luo, Thomas Erlebach, Yinfeng Xu
Car-sharing between two locations: Online scheduling with flexible advance bookings. Discret. Appl. Math. 313 (2022)
Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS (2021)
Thomas Erlebach, Jakob T. Spooner
Exploration of k-Edge-Deficient Temporal Graphs. WADS (2021)
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR (2021)
Thomas Erlebach
Algorithms that Access the Input via Queries. SOFSEM (2021)
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
On the fast delivery problem with one or two packages. J. Comput. Syst. Sci. 115 (2021)
Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. CoRR (2021)
Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA (2021)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
On temporal graph exploration. J. Comput. Syst. Sci. 119 (2021)
Amotz Bar-Noy, Thomas Erlebach, Dror Rawitz, Peter Terlecky
"Green" barrier coverage with mobile sensors. Theor. Comput. Sci. 860 (2021)
Leah Epstein, Thomas Erlebach
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64 (4) (2020)
Thomas Erlebach, Jakob T. Spooner
Non-strict Temporal Exploration. SIROCCO (2020)
Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
An Adversarial Model for Scheduling with Testing. Algorithmica 82 (12) (2020)
Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter
Untrusted Predictions Improve Trustable Query Policies. CoRR (2020)
Thomas Erlebach, Jakob T. Spooner
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. SOFSEM (2020)
Leah Epstein, Thomas Erlebach
Correction to: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64 (4) (2020)
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
An Efficient Algorithm for the Fast Delivery Problem. CoRR (2019)
Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
An Efficient Algorithm for the Fast Delivery Problem. FCT (2019)
Kelin Luo, Thomas Erlebach, Yinfeng Xu
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. STACS (2019)
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. 788 (2019)
Thomas Erlebach, Jakob T. Spooner
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. CoRR (2019)
Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner
Two Moves per Time Step Make a Difference. ICALP (2019)
Kelin Luo, Thomas Erlebach, Yinfeng Xu
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. COCOON (2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR (2018)
Thomas Erlebach
Computing and Scheduling with Explorable Uncertainty. CiE (2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC (2018)
Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
Scheduling with Explorable Uncertainty. ITCS (2018)
Kelin Luo, Thomas Erlebach, Yinfeng Xu
Car-Sharing between Two Locations: Online Scheduling with Two Servers. MFCS (2018)
Thomas Erlebach, Jakob T. Spooner
Faster Exploration of Degree-Bounded Temporal Graphs. MFCS (2018)
Kelin Luo, Thomas Erlebach, Yinfeng Xu
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ISAAC (2018)
Aeshah Alsughayyir, Thomas Erlebach
A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems. ISPDC (2017)
Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) (2017)
Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
Scheduling with Explorable Uncertainty. CoRR (2017)
Aisha Mousa Mashraqi, Thomas Erlebach
Throughput Improvement by Reducing Dropped Packets at Interface Queue (IFQ) in Multi-channel Wireless Mesh Networks. ISPAN-FCST-ISCC (2017)
Aeshah Alsughayyir, Thomas Erlebach
Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors. COCOA (2) (2017)
Aram Rasul, Thomas Erlebach
The extra-bit technique for reducing idle listening in data collection. Int. J. Sens. Networks 25 (1) (2017)
Aeshah Alsughayyir, Thomas Erlebach
Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems. PDP (2016)
Thomas Erlebach
Algorithms for Queryable Uncertainty. FAW (2016)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613 (2016)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
On Temporal Graph Exploration. CoRR (2015)
Thomas Erlebach, Giuseppe Persiano
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56 (1) (2015)
Hasna Mohsen Alqahtani, Thomas Erlebach
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. IWOCA (2015)
Thomas Erlebach, Matthew Radoja
Further Results on Capacitated Network Design Games. SAGT (2015)
Thomas Erlebach, Michael Hoffmann
Query-Competitive Algorithms for Computing with Uncertainty. Bull. EATCS 116 (2015)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
On Temporal Graph Exploration. ICALP (1) (2015)
Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. 600 (2015)
Aram Rasul, Thomas Erlebach
An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks. MASS (2015)
Aram Rasul, Thomas Erlebach
Reducing Idle Listening during Data Collection in Wireless Sensor Networks. MSN (2014)
Hasna Mohsen Alqahtani, Thomas Erlebach
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. SOFSEM (2014)
Thomas Erlebach, Michael Hoffmann, Frank Kammer
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) (2014)
Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen
Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. 553 (2014)
Thomas Erlebach, Michael Hoffmann
Minimum Spanning Tree Verification Under Uncertainty. WG (2014)
S. D. Gunashekar, A. Das, Thomas Erlebach, E. M. Warrington
An experimental study of small multi-hop wireless networks using chirp spread spectrum. Wirel. Networks 20 (1) (2014)
Shagufta Henna, Thomas Erlebach
Least Channel Variation Multi-channel MAC (LCV-MMAC). ADHOC-NOW (2013)
Hasna Mohsen Alqahtani, Thomas Erlebach
-Paths with Minimum Activation Cost. CIAC (2013)
Shagufta Henna, Thomas Erlebach
Approximating Maximum Disjoint Coverage in Wireless Sensor Networks. ADHOC-NOW (2013)
S. D. Gunashekar, A. Das, Thomas Erlebach, E. M. Warrington
A simple scheme to improve the throughput of small multi-hop wireless networks. CSNDSP (2012)
Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) (2012)
Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
Computational Complexity of Traffic Hijacking under BGP and S-BGP CoRR (2012)
Jawad Ashraf, Thomas Erlebach
A hybrid scheduling technique for grid workflows in advance reservation environments. HPCS (2011)
Thomas Erlebach, Tom Grant, Frank Kammer
Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustain. Comput. Informatics Syst. 1 (3) (2011)
Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller
Broadcast scheduling: Algorithms and complexity. ACM Trans. Algorithms 7 (4) (2011)
Thomas Erlebach, Tom Grant, Frank Kammer
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA (2011)
Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini
Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP (2010)
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47 (3) (2010)
Thomas Erlebach, Tom Grant
Scheduling Multicast Transmissions under SINR Constraints. ALGOSENSORS (2010)
Shagufta Henna, Thomas Erlebach
CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks. MoMM (2010)
Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. 411 (14-15) (2010)
Thomas Erlebach, Erik Jan van Leeuwen
PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM (2010)
Thomas Erlebach, Marco E. Lübbecke
Frontmatter, Table of Contents, Preface, Organization. ATMOS (2010)
Ambreen Shahnaz, Thomas Erlebach
Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. IWCMC (2010)
Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella
Length-bounded cuts and flows. ACM Trans. Algorithms 7 (1) (2010)
Jawad Ashraf, Thomas Erlebach
A new resource mapping technique for Grid workflows in advance reservation environments. HPCS (2010)
Yossi Azar, Thomas Erlebach
Foreword. Algorithmica 53 (4) (2009)
Thomas Erlebach, Ambreen Shahnaz
Approximating node-weighted multicast trees in wireless ad-hoc networks. IWCMC (2009)
Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic
Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Oper. Res. 57 (4) (2009)
Thomas Erlebach, Matús Mihalák
)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA (2009)
Thomas Erlebach, Anna Mereu
Path Splicing with Guaranteed Fault Tolerance. GLOBECOM (2009)
Leah Epstein, Thomas Erlebach, Asaf Levin
Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53 (3) (2009)

Thomas Erlebach.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Erlebach