default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Erlebach
Person information
- affiliation: Durham University, UK
- affiliation (former): University of Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 1999
[b1]Thomas Erlebach:
Scheduling connections in fast networks. Technical University Munich, Germany, 1999, pp. 1-217
Journal Articles
- 2025
- [j58]Clément Mommessin
, Thomas Erlebach, Natalia V. Shakhlevich:
Classification and evaluation of the algorithms for vector bin packing. Comput. Oper. Res. 173: 106860 (2025) - 2024
- [j57]Thomas Erlebach, Nils Morawietz, Jakob T. Spooner, Petra Wolf:
A cop and robber game on edge-periodic temporal graphs. J. Comput. Syst. Sci. 144: 103534 (2024) - 2023
- [j56]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Algorithmica 85(2): 406-443 (2023) - [j55]Thomas Erlebach, Jakob T. Spooner:
Parameterised temporal exploration problems. J. Comput. Syst. Sci. 135: 73-88 (2023) - 2022
- [j54]Thomas Erlebach, Jakob T. Spooner:
Exploration of k-edge-deficient temporal graphs. Acta Informatica 59(4): 387-407 (2022) - [j53]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-sharing between two locations: Online scheduling with flexible advance bookings. Discret. Appl. Math. 313: 53-66 (2022) - 2021
- [j52]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
On the fast delivery problem with one or two packages. J. Comput. Syst. Sci. 115: 246-263 (2021) - [j51]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On temporal graph exploration. J. Comput. Syst. Sci. 119: 1-18 (2021) - [j50]Amotz Bar-Noy, Thomas Erlebach, Dror Rawitz, Peter Terlecky:
"Green" barrier coverage with mobile sensors. Theor. Comput. Sci. 860: 117-134 (2021) - 2020
- [j49]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
An Adversarial Model for Scheduling with Testing. Algorithmica 82(12): 3630-3675 (2020) - [j48]Leah Epstein, Thomas Erlebach:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64(4): 569-570 (2020) - [j47]Leah Epstein, Thomas Erlebach:
Correction to: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 64(4): 571 (2020) - 2019
- [j46]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: 66-78 (2019) - 2017
- [j45]Aram Rasul, Thomas Erlebach:
The extra-bit technique for reducing idle listening in data collection. Int. J. Sens. Networks 25(1): 31-44 (2017) - 2016
- [j44]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613: 51-64 (2016) - 2015
- [j43]Thomas Erlebach, Michael Hoffmann:
Query-Competitive Algorithms for Computing with Uncertainty. Bull. EATCS 116 (2015) - [j42]Thomas Erlebach, Giuseppe Persiano:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56(1): 135-136 (2015) - [j41]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. 600: 143-154 (2015) - 2014
- [j40]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: 1 (2014) - [j39]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): 89-103 (2014) - 2011
- [j38]Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustain. Comput. Informatics Syst. 1(3): 213-225 (2011) - [j37]Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: Algorithms and complexity. ACM Trans. Algorithms 7(4): 47:1-47:14 (2011) - 2010
- [j36]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. 47(3): 613-636 (2010) - [j35]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): 4:1-4:27 (2010) - [j34]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): 1626-1637 (2010) - 2009
- [j33]Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. Algorithmica 53(3): 385-401 (2009) - [j32]Yossi Azar, Thomas Erlebach:
Foreword. Algorithmica 53(4): 455-456 (2009) - [j31]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): 1006-1025 (2009) - [j30]Thomas Erlebach, Christos Kaklamanis:
WAOA 2006 Special Issue of TOCS. Theory Comput. Syst. 45(3): 427-428 (2009) - [j29]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. SIAM J. Discret. Math. 23(2): 822-841 (2009) - 2008
- [j28]Thomas Erlebach, Stamatis Stefanakos:
Routing to reduce the cost of wavelength conversion. Discret. Appl. Math. 156(15): 2911-2923 (2008) - [j27]Thomas Erlebach, Giuseppe Persiano:
WAOA 2005 Special Issue of TOCS. Theory Comput. Syst. 43(1): 1-2 (2008) - 2007
- [j26]Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
Call Control in Rings. Algorithmica 47(3): 217-238 (2007) - [j25]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. Algorithmica 47(3): 269-298 (2007) - [j24]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Model. Internet Math. 3(3): 333-359 (2007) - [j23]Thomas Erlebach:
Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196. Oper. Res. Lett. 35(3): 418-419 (2007) - [j22]Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank:
Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15(2): 267-280 (2007) - 2006
- [j21]Thomas Erlebach, Danica Vukadinovic:
Path problems in generalized stars, complete graphs, and brick wall graphs. Discret. Appl. Math. 154(4): 673-683 (2006) - [j20]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. IEEE J. Sel. Areas Commun. 24(12): 2168-2181 (2006) - 2005
- [j19]Thomas Erlebach, Stamatis Stefanakos:
Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. Algorithmica 43(1-2): 43-61 (2005) - [j18]Thomas Erlebach, Klaus Jansen:
Conversion of coloring algorithms into maximum weight independent set algorithms. Discret. Appl. Math. 148(1): 107-125 (2005) - [j17]Thomas Erlebach, Klaus Jansen, Eike Seidel:
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. 34(6): 1302-1323 (2005) - 2004
- [j16]Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic complexity of protein identification: combinatorics of weighted strings. Discret. Appl. Math. 137(1): 27-46 (2004) - [j15]Thomas Erlebach, Alexander Hall:
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Sched. 7(3): 223-241 (2004) - [j14]Hiroyuki Miyazawa, Thomas Erlebach:
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. J. Sched. 7(4): 293-311 (2004) - 2003
- [j13]Thomas Erlebach, Frits C. R. Spieksma:
Interval selection: Applications, algorithms, and lower bounds. J. Algorithms 46(1): 27-53 (2003) - [j12]R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos:
Call control with k rejections. J. Comput. Syst. Sci. 67(4): 707-722 (2003) - 2002
- [j11]Thomas Erlebach, Torben Hagerup:
Routing Flow Through a Strongly Connected Graph. Algorithmica 32(3): 467-473 (2002) - [j10]Danica Vukadinovic, Thomas Erlebach, Polly Huang, Maurice Rüegg, Roman Schilter:
Real and generated internet AS topologies: structure, spectrum, robustness. Comput. Commun. Rev. 32(3): 13 (2002) - [j9]Thomas Erlebach, Jirí Fiala:
On-line coloring of geometric intersection graphs. Comput. Geom. 23(2): 243-255 (2002) - [j8]Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ACM J. Exp. Algorithmics 7: 6 (2002) - [j7]Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multiobjective Knapsack Problems. Manag. Sci. 48(12): 1603-1612 (2002) - 2001
- [j6]Thomas Erlebach, Klaus Jansen:
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. SIAM J. Discret. Math. 14(3): 326-355 (2001) - [j5]Thomas Erlebach, Klaus Jansen:
The complexity of path coloring and call scheduling. Theor. Comput. Sci. 255(1-2): 33-50 (2001) - [j4]Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. 261(1): 119-156 (2001) - 2000
- [j3]Stefan Bischof, Ralf Ebner, Thomas Erlebach:
Parallel Load Balancing for Problems with Good Bisectors. J. Parallel Distributed Comput. 60(9): 1047-1073 (2000) - 1999
- [j2]Thomas Erlebach, Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. ACM J. Exp. Algorithmics 4: 4 (1999) - [j1]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano:
Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. 221(1-2): 119-137 (1999)
Conference and Workshop Papers
- 2024
- [c114]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. APPROX/RANDOM 2024: 17:1-17:21 - [c113]Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang:
Scheduling with Obligatory Tests. ESA 2024: 48:1-48:14 - [c112]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP 2024: 55:1-55:18 - [c111]Thomas Erlebach:
Exploration and Rendezvous in Temporal Graphs (Invited Talk). SAND 2024: 1:1-1:1 - [c110]Thomas Erlebach, Nils Morawietz, Petra Wolf:
Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. SAND 2024: 12:1-12:16 - 2023
- [c109]Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. COCOON (1) 2023: 168-181 - [c108]Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI 2023: 5577-5585 - 2022
- [c107]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA 2022: 49:1-49:18 - [c106]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. ISAAC 2022: 49:1-49:16 - [c105]Thomas Erlebach, Jakob T. Spooner:
Parameterized Temporal Exploration Problems. SAND 2022: 15:1-15:17 - 2021
- [c104]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: 10:1-10:18 - [c103]Thomas Erlebach:
Algorithms that Access the Input via Queries. SOFSEM 2021: 3-12 - [c102]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS 2021: 27:1-27:18 - [c101]Thomas Erlebach, Jakob T. Spooner:
Exploration of k-Edge-Deficient Temporal Graphs. WADS 2021: 371-384 - 2020
- [c100]Thomas Erlebach, Jakob T. Spooner:
Non-strict Temporal Exploration. SIROCCO 2020: 129-145 - [c99]Thomas Erlebach, Jakob T. Spooner:
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. SOFSEM 2020: 64-75 - 2019
- [c98]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. FCT 2019: 171-184 - [c97]Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner:
Two Moves per Time Step Make a Difference. ICALP 2019: 141:1-141:14 - [c96]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing on a Star Network: On-Line Scheduling with k Servers. STACS 2019: 51:1-51:14 - 2018
- [c95]Thomas Erlebach:
Computing and Scheduling with Explorable Uncertainty. CiE 2018: 156-160 - [c94]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. COCOON 2018: 242-254 - [c93]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. ITCS 2018: 30:1-30:14 - [c92]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: 45:1-45:12 - [c91]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ISAAC 2018: 64:1-64:13 - [c90]Thomas Erlebach, Jakob T. Spooner:
Faster Exploration of Degree-Bounded Temporal Graphs. MFCS 2018: 36:1-36:13 - [c89]Kelin Luo, Thomas Erlebach, Yinfeng Xu:
Car-Sharing between Two Locations: Online Scheduling with Two Servers. MFCS 2018: 50:1-50:14 - 2017
- [c88]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: 317-332 - [c87]Aeshah Alsughayyir, Thomas Erlebach:
Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors. COCOA (2) 2017: 457-465 - [c86]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: 140-147 - [c85]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: 44-53 - 2016
- [c84]Thomas Erlebach:
Algorithms for Queryable Uncertainty. FAW 2016: 1-7 - [c83]Aeshah Alsughayyir, Thomas Erlebach:
Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems. PDP 2016: 617-621 - 2015
- [c82]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. ICALP (1) 2015: 444-455 - [c81]Hasna Mohsen Alqahtani, Thomas Erlebach:
Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. IWOCA 2015: 13-24 - [c80]Aram Rasul, Thomas Erlebach:
An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks. MASS 2015: 55-63 - [c79]Thomas Erlebach, Matthew Radoja:
Further Results on Capacitated Network Design Games. SAGT 2015: 57-68 - 2014
- [c78]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) 2014: 263-274 - [c77]Aram Rasul, Thomas Erlebach:
Reducing Idle Listening during Data Collection in Wireless Sensor Networks. MSN 2014: 16-23 - [c76]Hasna Mohsen Alqahtani, Thomas Erlebach:
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. SOFSEM 2014: 65-76 - [c75]Thomas Erlebach, Michael Hoffmann:
Minimum Spanning Tree Verification Under Uncertainty. WG 2014: 164-175 - 2013
- [c74]Shagufta Henna, Thomas Erlebach:
Approximating Maximum Disjoint Coverage in Wireless Sensor Networks. ADHOC-NOW 2013: 148-159 - [c73]Shagufta Henna, Thomas Erlebach:
Least Channel Variation Multi-channel MAC (LCV-MMAC). ADHOC-NOW 2013: 160-171 - [c72]Hasna Mohsen Alqahtani, Thomas Erlebach:
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost. CIAC 2013: 1-12 - 2012
- [c71]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: 1-5 - [c70]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) 2012: 476-487 - 2011
- [c69]Jawad Ashraf, Thomas Erlebach:
A hybrid scheduling technique for grid workflows in advance reservation environments. HPCS 2011: 98-106 - [c68]Thomas Erlebach, Tom Grant, Frank Kammer:
Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA 2011: 187-196 - 2010
- [c67]Thomas Erlebach, Tom Grant:
Scheduling Multicast Transmissions under SINR Constraints. ALGOSENSORS 2010: 47-61 - [c66]Thomas Erlebach, Erik Jan van Leeuwen:
PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM 2010: 166-177 - [c65]Thomas Erlebach, Marco E. Lübbecke:
Frontmatter, Table of Contents, Preface, Organization. ATMOS 2010 - [c64]Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini:
Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP 2010: 113-123 - [c63]Jawad Ashraf, Thomas Erlebach:
A new resource mapping technique for Grid workflows in advance reservation environments. HPCS 2010: 63-70 - [c62]Ambreen Shahnaz, Thomas Erlebach:
Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. IWCMC 2010: 529-533 - [c61]Shagufta Henna, Thomas Erlebach:
CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks. MoMM 2010: 94-101 - 2009
- [c60]Thomas Erlebach, Anna Mereu:
Path Splicing with Guaranteed Fault Tolerance. GLOBECOM 2009: 1-6 - [c59]Thomas Erlebach, Ambreen Shahnaz:
Approximating node-weighted multicast trees in wireless ad-hoc networks. IWCMC 2009: 639-643 - [c58]Thomas Erlebach, Matús Mihalák:
A (4 + epsilon)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. WAOA 2009: 135-146 - 2008
- [c57]Thomas Erlebach, Erik Jan van Leeuwen:
Domination in Geometric Intersection Graphs. LATIN 2008: 747-758 - [c56]Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer:
Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO 2008: 89-103 - [c55]Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: algorithms and complexity. SODA 2008: 473-482 - [c54]Thomas Erlebach, Erik Jan van Leeuwen:
Approximating geometric coverage problems. SODA 2008: 1267-1276 - [c53]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. STACS 2008: 265-276 - [c52]Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 - 2007
- [c51]Leah Epstein, Thomas Erlebach, Asaf Levin:
Online Capacitated Interval Coloring. ESCAPE 2007: 243-254 - [c50]Thomas Erlebach, Alexander Hall, Matús Mihalák:
Approximate Discovery of Random Graphs. SAGA 2007: 82-92 - 2006
- [c49]Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser:
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM 2006: 3-14 - [c48]Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák:
Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80 - [c47]R. Sai Anand, Thomas Erlebach:
Call control on lines. COMSWARE 2006: 1-6 - [c46]Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic:
Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program 2006: 260-274 - [c45]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella:
Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690 - [c44]Leah Epstein, Thomas Erlebach, Asaf Levin:
Variable Sized Online Interval Coloring with Bandwidth. SWAT 2006: 29-40 - 2005
- [c43]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. WG 2005: 127-138 - 2004
- [c42]Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN 2004: 49-62 - [c41]Ulrik Brandes, Thomas Erlebach:
Introduction. Network Analysis 2004: 1-6 - [c40]Ulrik Brandes, Thomas Erlebach:
Fundamentals. Network Analysis 2004: 7-15 - [c39]Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer:
Scheduling with Release Times and Deadlines on a Minimum Number of Machines. IFIP TCS 2004: 209-222 - [c38]Thomas Erlebach, Maurice Rüegg:
Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing. INFOCOM 2004: 2275-2282 - [c37]Stamatis Stefanakos, Thomas Erlebach:
Routing in all-optical ring networks revisited. ISCC 2004: 288-293 - [c36]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 - [c35]Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl:
Off-line Admission Control for Advance Reservations in Star Networks. WAOA 2004: 211-224 - [c34]Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
Joint Base Station Scheduling. WAOA 2004: 225-238 - 2003
- [c33]Thomas Erlebach, Stamatis Stefanakos:
Wavelength Conversion in Shortest-Path All-Optical Networks. ISAAC 2003: 595-604 - [c32]Thomas Erlebach, Stamatis Stefanakos:
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. STACS 2003: 133-144 - [c31]R. Sai Anand, Thomas Erlebach:
Routing and Call Control Algorithms for Ring Networks. WADS 2003: 186-197 - [c30]Udo Adamy, Thomas Erlebach:
Online Coloring of Intervals with Bandwidth. WAOA 2003: 1-12 - [c29]Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring:
Scheduling AND/OR-Networks on Identical Parallel Machines. WAOA 2003: 123-136 - [c28]Paz Carmi, Thomas Erlebach, Yoshio Okamoto:
Greedy Edge-Disjoint Paths in Complete Graphs. WG 2003: 143-155 - [c27]Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos:
Resource Allocation Problems in Multifiber WDM Tree Networks. WG 2003: 218-229 - 2002
- [c26]Samarjit Chakraborty, Thomas Erlebach, Simon Künzli, Lothar Thiele:
Schedulability of event-driven code blocks in real-time embedded systems. DAC 2002: 616-621 - [c25]Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach:
Call Control in Rings. ICALP 2002: 788-799 - [c24]Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS 2002: 143-156 - [c23]Danica Vukadinovic, Polly Huang, Thomas Erlebach:
On the Spectrum and Structure of Internet Topology Graphs. IICS 2002: 83-95 - [c22]R. Sai Anand, Thomas Erlebach:
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. LATIN 2002: 584-597 - [c21]Thomas Erlebach, Alexander Hall:
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. SODA 2002: 194-202 - [c20]R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos:
Call Control with k Rejections. SWAT 2002: 308-317 - 2001
- [c19]Thomas Erlebach, Danica Vukadinovic:
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. FCT 2001: 483-494 - [c18]Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402 - [c17]Thomas Erlebach:
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. MFCS 2001: 351-362 - [c16]Thomas Erlebach, Klaus Jansen, Eike Seidel:
Polynomial-time approximation schemes for geometric graphs. SODA 2001: 671-679 - [c15]Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele:
On the Complexity of Scheduling Conditional Real-Time Code. WADS 2001: 38-49 - [c14]Thomas Erlebach, Hans Kellerer, Ulrich Pferschy:
Approximating Multi-objective Knapsack Problems. WADS 2001: 210-221 - 2000
- [c13]Thomas Erlebach, Klaus Jansen:
Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. ICALP Satellite Workshops 2000: 135-146 - [c12]Thomas Erlebach, Frits C. R. Spieksma:
Simple Algorithms for a Weighted Interval Selection Problem. ISAAC 2000: 228-240 - [c11]Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. WAE 2000: 195-206 - 1999
- [c10]Ralf Ebner, Thomas Erlebach, Claudia Gold, Clemens Harlfinger, Roland Wismüller:
A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing. ARCS Workshops 1999: 155-162 - [c9]Stefan Bischof, Ralf Ebner, Thomas Erlebach:
Parallel Load Balancing for Problems with Good Bisectors. IPPS/SPDP 1999: 531-538 - 1998
- [c8]Stefan Bischof, Ralf Ebner, Thomas Erlebach:
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations. Euro-Par 1998: 383-389 - [c7]Thomas Erlebach, Klaus Jansen:
Maximizing the Number of Connections in Optical Tree Networks. ISAAC 1998: 179-188 - [c6]Thomas Erlebach, Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. WAE 1998: 13-24 - 1997
- [c5]Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann:
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT 1997: 260-276 - [c4]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
An optimal greedy algorithm for wavelength allocation in directed tree networks. Network Design: Connectivity and Facilities Location 1997: 117-129 - [c3]Thomas Erlebach, Klaus Jansen:
Call Scheduling in Trees, Rings and Meshes. HICSS (1) 1997: 221- - [c2]Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen:
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP 1997: 493-504 - [c1]Thomas Erlebach, Klaus Jansen:
Off-Line and On-Line Call-Scheduling in Stars and Trees. WG 1997: 199-213
Parts in Books or Collections
- 2011
- [p4]Thomas Erlebach:
Majority - Who Gets Elected Class Rep? Algorithms Unplugged 2011: 239-247 - 2008
- [p3]Thomas Erlebach:
Mehrheitsbestimmung - Wer wird Klassensprecher?. Taschenbuch der Algorithmen 2008: 245-254 - 2006
- [p2]Thomas Erlebach:
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow. Efficient Approximation and Online Algorithms 2006: 97-134 - [p1]Thomas Erlebach, Jirí Fiala:
Independence and Coloring Problems on Intersection Graphs of Disks. Efficient Approximation and Online Algorithms 2006: 135-155
Editorship
- 2022
- [e11]Thomas Erlebach, Michael Segal:
Algorithmics of Wireless Networks - 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Lecture Notes in Computer Science 13707, Springer 2022, ISBN 978-3-031-22049-4 [contents] - 2018
- [e10]Leah Epstein, Thomas Erlebach:
Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11312, Springer 2018, ISBN 978-3-030-04692-7 [contents] - 2013
- [e9]Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7846, Springer 2013, ISBN 978-3-642-38015-0 [contents] - 2012
- [e8]Thomas Erlebach, Sotiris E. Nikoletseas, Pekka Orponen:
Algorithms for Sensor Systems - 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7111, Springer 2012, ISBN 978-3-642-28208-9 [contents] - 2010
- [e7]Thomas Erlebach, Marco E. Lübbecke:
ATMOS 2010 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, Liverpool, United Kingdom, September 6-10, 2010. OASIcs 14, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2010 [contents] - 2008
- [e6]Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma:
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Lecture Notes in Computer Science 5344, 2008, ISBN 978-3-540-92247-6 [contents] - 2006
- [e5]Thomas Erlebach:
Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers. Lecture Notes in Computer Science 4235, Springer 2006, ISBN 3-540-48822-7 [contents] - [e4]Yossi Azar, Thomas Erlebach:
Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Lecture Notes in Computer Science 4168, Springer 2006, ISBN 3-540-38875-3 [contents] - [e3]Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers. Lecture Notes in Computer Science 3879, Springer 2006, ISBN 3-540-32207-8 [contents] - [e2]Thomas Erlebach, Christos Kaklamanis:
Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers. Lecture Notes in Computer Science 4368, Springer 2006, ISBN 3-540-69513-3 [contents] - 2005
- [e1]Ulrik Brandes, Thomas Erlebach:
Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004]. Lecture Notes in Computer Science 3418, Springer 2005, ISBN 3-540-24979-6 [contents]
Reference Works
- 2009
- [r1]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725
Informal and Other Publications
- 2024
- [i23]Thomas Erlebach, Kleitos Papadopoulos:
A faster algorithm for the construction of optimal factoring automata. CoRR abs/2404.02354 (2024) - [i22]Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang:
Scheduling with Obligatory Tests. CoRR abs/2406.16734 (2024) - [i21]Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan:
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR abs/2407.10170 (2024) - 2023
- [i20]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR abs/2305.09245 (2023) - [i19]Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach:
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. CoRR abs/2305.10108 (2023) - [i18]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR abs/2312.07140 (2023) - 2022
- [i17]Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR abs/2206.15201 (2022) - [i16]Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma:
Package Delivery Using Drones with Restricted Movement Areas. CoRR abs/2209.12314 (2022) - [i15]Thomas Erlebach, Jakob T. Spooner:
Parameterized temporal exploration problems. CoRR abs/2212.01594 (2022) - 2021
- [i14]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. CoRR abs/2101.05032 (2021) - [i13]Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR abs/2107.00572 (2021) - 2020
- [i12]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Untrusted Predictions Improve Trustable Query Policies. CoRR abs/2011.07385 (2020) - 2019
- [i11]Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos:
An Efficient Algorithm for the Fast Delivery Problem. CoRR abs/1904.09142 (2019) - [i10]Thomas Erlebach, Jakob T. Spooner:
A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. CoRR abs/1908.06828 (2019) - 2018
- [i9]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 abs/1807.01962 (2018) - 2017
- [i8]Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner:
Scheduling with Explorable Uncertainty. CoRR abs/1709.02592 (2017) - 2015
- [i7]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. CoRR abs/1504.07976 (2015) - 2012
- [i6]Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani:
Computational Complexity of Traffic Hijacking under BGP and S-BGP. CoRR abs/1205.4564 (2012) - 2008
- [i5]Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff:
Trimming of Graphs, with Application to Point Labeling. CoRR abs/0802.2854 (2008) - [i4]Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. CoRR abs/0802.2855 (2008) - 2005
- [i3]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. Algorithms for Optimization with Incomplete Information 2005 - 1997
- [i2]Thomas Erlebach, Klaus Jansen:
An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-03 (1997) - 1996
- [i1]Thomas Erlebach, Klaus Jansen:
Scheduling of Virtual Connections in Fast Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-19 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
