Thomas Erlebach

219 papers A* 11A 13B 47C 13Misc 2Journal 84Unranked 41

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model. SOFSEM Kunanon Burathep, Thomas Erlebach, William K. Moses Jr.
2026	J	`jnl`	Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones. CoRR Thomas Erlebach, Kelin Luo, Wen Zhang
2025	—	`conf`	Approximating Optimal Broadcast of Files in a Hose-Model Network. FSTTCS Thomas Erlebach, Naveen Garg, Sukriti Gupta, Amitabh Trehan
2025	J	`jnl`	Classification and evaluation of the algorithms for vector bin packing. Comput. Oper. Res. Clément Mommessin, Thomas Erlebach, Natalia V. Shakhlevich
2025	J	`jnl`	Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model. CoRR Kunanon Burathep, Thomas Erlebach, William K. Moses Jr.
2025	J	`jnl`	Parameterized algorithms for multi-label periodic temporal graph realization. Theor. Comput. Sci. Thomas Erlebach, Nils Morawietz, Petra Wolf
2025	A	`conf`	Recognizing and Realizing Temporal Reachability Graphs. ESA Thomas Erlebach, Othon Michail, Nils Morawietz
2025	J	`jnl`	Recognizing and Realizing Temporal Reachability Graphs. CoRR Thomas Erlebach, Othon Michail, Nils Morawietz
2024	J	`jnl`	A cop and robber game on edge-periodic temporal graphs. J. Comput. Syst. Sci. Thomas Erlebach, Nils Morawietz, Jakob T. Spooner, Petra Wolf
2024	J	`jnl`	A faster algorithm for the construction of optimal factoring automata. CoRR Thomas Erlebach, Kleitos Papadopoulos
2024	A	`conf`	Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. APPROX/RANDOM Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
2024	J	`jnl`	Competitive Query Minimization for Stable Matching with One-Sided Uncertainty. CoRR Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan
2024	A*	`conf`	Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.
2024	—	`conf`	Exploration and Rendezvous in Temporal Graphs (Invited Talk). SAND Thomas Erlebach
2024	—	`conf`	Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization. SAND Thomas Erlebach, Nils Morawietz, Petra Wolf
2024	A	`conf`	Scheduling with Obligatory Tests. ESA Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang
2024	J	`jnl`	Scheduling with Obligatory Tests. CoRR Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang
2023	J	`jnl`	Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.
2023	—	`conf`	List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. COCOON (1) Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach
2023	J	`jnl`	List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs. CoRR Banu Baklan Sen, Öznur Yasar Diner, Thomas Erlebach
2023	J	`jnl`	Parameterised temporal exploration problems. J. Comput. Syst. Sci. Thomas Erlebach, Jakob T. Spooner
2023	J	`jnl`	Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Algorithmica Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima
2023	A*	`conf`	Sorting and Hypergraph Orientation under Uncertainty with Predictions. IJCAI Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2023	J	`jnl`	Sorting and Hypergraph Orientation under Uncertainty with Predictions. CoRR Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022	C	`ed.`	Algorithmics of Wireless Networks - 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings ALGOSENSORS Thomas Erlebach, Michael Segal
2022	J	`jnl`	Car-sharing between two locations: Online scheduling with flexible advance bookings. Discret. Appl. Math. Kelin Luo, Thomas Erlebach, Yinfeng Xu
2022	J	`jnl`	Exploration of k-edge-deficient temporal graphs. Acta Informatica Thomas Erlebach, Jakob T. Spooner
2022	A	`conf`	Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. ESA Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022	J	`jnl`	Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. CoRR Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2022	B	`conf`	Package Delivery Using Drones with Restricted Movement Areas. ISAAC Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
2022	J	`jnl`	Package Delivery Using Drones with Restricted Movement Areas. CoRR Thomas Erlebach, Kelin Luo, Frits C. R. Spieksma
2022	—	`conf`	Parameterized Temporal Exploration Problems. SAND Thomas Erlebach, Jakob T. Spooner
2022	J	`jnl`	Parameterized temporal exploration problems. CoRR Thomas Erlebach, Jakob T. Spooner
2021	J	`jnl`	"Green" barrier coverage with mobile sensors. Theor. Comput. Sci. Amotz Bar-Noy, Thomas Erlebach, Dror Rawitz, Peter Terlecky
2021	B	`conf`	Algorithms that Access the Input via Queries. SOFSEM Thomas Erlebach
2021	B	`conf`	Exploration of k-Edge-Deficient Temporal Graphs. WADS Thomas Erlebach, Jakob T. Spooner
2021	J	`jnl`	On temporal graph exploration. J. Comput. Syst. Sci. Thomas Erlebach, Michael Hoffmann, Frank Kammer
2021	J	`jnl`	On the fast delivery problem with one or two packages. J. Comput. Syst. Sci. Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
2021	A	`conf`	Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. ESA Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter
2021	J	`jnl`	Orienting (hyper)graphs under explorable stochastic uncertainty. CoRR Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2021	A	`conf`	Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima
2021	J	`jnl`	Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. CoRR Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima
2020	B	`conf`	A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. SOFSEM Thomas Erlebach, Jakob T. Spooner
2020	J	`jnl`	An Adversarial Model for Scheduling with Testing. Algorithmica Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
2020	J	`jnl`	Correction to: Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. Leah Epstein, Thomas Erlebach
2020	B	`conf`	Non-strict Temporal Exploration. SIROCCO Thomas Erlebach, Jakob T. Spooner
2020	J	`jnl`	Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. Leah Epstein, Thomas Erlebach
2020	J	`jnl`	Untrusted Predictions Improve Trustable Query Policies. CoRR Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter
2019	J	`jnl`	A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity. CoRR Thomas Erlebach, Jakob T. Spooner
2019	B	`conf`	An Efficient Algorithm for the Fast Delivery Problem. FCT Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
2019	J	`jnl`	An Efficient Algorithm for the Fast Delivery Problem. CoRR Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos
2019	A	`conf`	Car-Sharing on a Star Network: On-Line Scheduling with k Servers. STACS Kelin Luo, Thomas Erlebach, Yinfeng Xu
2019	J	`jnl`	Complexity and online algorithms for minimum skyline coloring of intervals. Theor. Comput. Sci. Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2019	A*	`conf`	Two Moves per Time Step Make a Difference. ICALP Thomas Erlebach, Frank Kammer, Kelin Luo, Andrej Sajenko, Jakob T. Spooner
2018	B	`ed.`	Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers WAOA Leah Epstein, Thomas Erlebach
2018	Misc	`conf`	Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings. COCOON Kelin Luo, Thomas Erlebach, Yinfeng Xu
2018	B	`conf`	Car-Sharing between Two Locations: Online Scheduling with Two Servers. MFCS Kelin Luo, Thomas Erlebach, Yinfeng Xu
2018	C	`conf`	Computing and Scheduling with Explorable Uncertainty. CiE Thomas Erlebach
2018	B	`conf`	Faster Exploration of Degree-Bounded Temporal Graphs. MFCS Thomas Erlebach, Jakob T. Spooner
2018	B	`conf`	Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. ISAAC Kelin Luo, Thomas Erlebach, Yinfeng Xu
2018	B	`conf`	Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. ISAAC Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
2018	J	`jnl`	Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. CoRR Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, Frits C. R. Spieksma
2018	A	`conf`	Scheduling with Explorable Uncertainty. ITCS Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
2017	C	`conf`	A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems. ISPDC Aeshah Alsughayyir, Thomas Erlebach
2017	—	`conf`	Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals. COCOA (2) Thomas Erlebach, Fu-Hong Liu, Hsiang-Hsuan Liu, Mordechai Shalom, Prudence W. H. Wong, Shmuel Zaks
2017	—	`conf`	Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors. COCOA (2) Aeshah Alsughayyir, Thomas Erlebach
2017	J	`jnl`	Scheduling with Explorable Uncertainty. CoRR Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner
2017	J	`jnl`	The extra-bit technique for reducing idle listening in data collection. Int. J. Sens. Networks Aram Rasul, Thomas Erlebach
2017	—	`conf`	Throughput Improvement by Reducing Dropped Packets at Interface Queue (IFQ) in Multi-channel Wireless Mesh Networks. ISPAN-FCST-ISCC Aisha Mousa Mashraqi, Thomas Erlebach
2016	Misc	`conf`	Algorithms for Queryable Uncertainty. FAW Thomas Erlebach
2016	C	`conf`	Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems. PDP Aeshah Alsughayyir, Thomas Erlebach
2016	J	`jnl`	Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. Thomas Erlebach, Michael Hoffmann, Frank Kammer
2015	B	`conf`	An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks. MASS Aram Rasul, Thomas Erlebach
2015	J	`jnl`	Computational complexity of traffic hijacking under BGP and S-BGP. Theor. Comput. Sci. Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
2015	B	`conf`	Further Results on Capacitated Network Design Games. SAGT Thomas Erlebach, Matthew Radoja
2015	C	`conf`	Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width. IWOCA Hasna Mohsen Alqahtani, Thomas Erlebach
2015	—	`conf`	On Temporal Graph Exploration. ICALP (1) Thomas Erlebach, Michael Hoffmann, Frank Kammer
2015	J	`jnl`	On Temporal Graph Exploration. CoRR Thomas Erlebach, Michael Hoffmann, Frank Kammer
2015	J	`jnl`	Query-Competitive Algorithms for Computing with Uncertainty. Bull. EATCS Thomas Erlebach, Michael Hoffmann
2015	J	`jnl`	Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. Thomas Erlebach, Giuseppe Persiano
2014	J	`jnl`	An experimental study of small multi-hop wireless networks using chirp spread spectrum. Wirel. Networks S. D. Gunashekar, A. Das, Thomas Erlebach, E. M. Warrington
2014	J	`jnl`	Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities. Theor. Comput. Sci. Amotz Bar-Noy, Thomas Erlebach, Magnús M. Halldórsson, Sotiris E. Nikoletseas, Pekka Orponen
2014	B	`conf`	Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. SOFSEM Hasna Mohsen Alqahtani, Thomas Erlebach
2014	B	`conf`	Minimum Spanning Tree Verification Under Uncertainty. WG Thomas Erlebach, Michael Hoffmann
2014	—	`conf`	Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) Thomas Erlebach, Michael Hoffmann, Frank Kammer
2014	—	`conf`	Reducing Idle Listening during Data Collection in Wireless Sensor Networks. MSN Aram Rasul, Thomas Erlebach
2013	—	`conf`	Approximating Maximum Disjoint Coverage in Wireless Sensor Networks. ADHOC-NOW Shagufta Henna, Thomas Erlebach
2013	C	`conf`	Approximation Algorithms for Disjoint CIAC Hasna Mohsen Alqahtani, Thomas Erlebach
2013	B	`ed.`	Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers WAOA Thomas Erlebach, Giuseppe Persiano
2013	—	`conf`	Least Channel Variation Multi-channel MAC (LCV-MMAC). ADHOC-NOW Shagufta Henna, Thomas Erlebach
2012	—	`conf`	A simple scheme to improve the throughput of small multi-hop wireless networks. CSNDSP S. D. Gunashekar, A. Das, Thomas Erlebach, E. M. Warrington
2012	C	`ed.`	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 ALGOSENSORS Thomas Erlebach, Sotiris E. Nikoletseas, Pekka Orponen
2012	J	`jnl`	Computational Complexity of Traffic Hijacking under BGP and S-BGP CoRR Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
2012	—	`conf`	Computational Complexity of Traffic Hijacking under BGP and S-BGP. ICALP (2) Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani
2011	—	`conf`	A hybrid scheduling technique for grid workflows in advance reservation environments. HPCS Jawad Ashraf, Thomas Erlebach
2011	J	`jnl`	Broadcast scheduling: Algorithms and complexity. ACM Trans. Algorithms Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller
2011	—	`ch.`	Majority - Who Gets Elected Class Rep? Algorithms Unplugged Thomas Erlebach
2011	B	`conf`	Maximising lifetime for fault-tolerant target coverage in sensor networks. SPAA Thomas Erlebach, Tom Grant, Frank Kammer
2011	J	`jnl`	Maximising lifetime for fault-tolerant target coverage in sensor networks. Sustain. Comput. Informatics Syst. Thomas Erlebach, Tom Grant, Frank Kammer
2010	C	`ed.`	10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010, Liverpool, United Kingdom, September 6-10, 2010 ATMOS Thomas Erlebach, Marco E. Lübbecke
2010	—	`conf`	A new resource mapping technique for Grid workflows in advance reservation environments. HPCS Jawad Ashraf, Thomas Erlebach
2010	B	`conf`	Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks. IWCMC Ambreen Shahnaz, Thomas Erlebach
2010	B	`conf`	Assigning AS relationships to satisfy the Gao-Rexford conditions. ICNP Luca Cittadini, Giuseppe Di Battista, Thomas Erlebach, Maurizio Patrignani, Massimo Rimondini
2010	C	`conf`	CMAB: cross layer mobility-adaptive broadcasting in mobile ad hoc networks. MoMM Shagufta Henna, Thomas Erlebach
2010	J	`jnl`	Discovery of network properties with all-shortest-paths queries. Theor. Comput. Sci. Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
2010	C	`conf`	Frontmatter, Table of Contents, Preface, Organization. ATMOS Thomas Erlebach, Marco E. Lübbecke
2010	J	`jnl`	Length-bounded cuts and flows. ACM Trans. Algorithms Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella
2010	—	`conf`	PTAS for Weighted Set Cover on Unit Squares. APPROX-RANDOM Thomas Erlebach, Erik Jan van Leeuwen
2010	C	`conf`	Scheduling Multicast Transmissions under SINR Constraints. ALGOSENSORS Thomas Erlebach, Tom Grant
2010	J	`jnl`	Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2009	B	`conf`	A (4 + WAOA Thomas Erlebach, Matús Mihalák
2009	B	`conf`	Approximating node-weighted multicast trees in wireless ad-hoc networks. IWCMC Thomas Erlebach, Ambreen Shahnaz
2009	J	`jnl`	Connectivity Measures for Internet Topologies on the Level of Autonomous Systems. Oper. Res. Thomas Erlebach, Linda S. Moonen, Frits C. R. Spieksma, Danica Vukadinovic
2009	—	`ch.`	Directed Tree Networks. Encyclopedia of Optimization Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano
2009	J	`jnl`	Foreword. Algorithmica Yossi Azar, Thomas Erlebach
2009	J	`jnl`	Online Capacitated Interval Coloring. SIAM J. Discret. Math. Leah Epstein, Thomas Erlebach, Asaf Levin
2009	B	`conf`	Path Splicing with Guaranteed Fault Tolerance. GLOBECOM Thomas Erlebach, Anna Mereu
2009	J	`jnl`	Variable Sized Online Interval Coloring with Bandwidth. Algorithmica Leah Epstein, Thomas Erlebach, Asaf Levin
2009	J	`jnl`	WAOA 2006 Special Issue of TOCS. Theory Comput. Syst. Thomas Erlebach, Christos Kaklamanis
2008	A*	`conf`	Approximating geometric coverage problems. SODA Thomas Erlebach, Erik Jan van Leeuwen
2008	A*	`conf`	Broadcast scheduling: algorithms and complexity. SODA Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller
2008	J	`jnl`	Computing Minimum Spanning Trees with Uncertainty CoRR Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman
2008	A	`conf`	Computing Minimum Spanning Trees with Uncertainty. STACS Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman
2008	B	`conf`	Discovery of Network Properties with All-Shortest-Paths Queries. SIROCCO Davide Bilò, Thomas Erlebach, Matús Mihalák, Peter Widmayer
2008	B	`conf`	Domination in Geometric Intersection Graphs. LATIN Thomas Erlebach, Erik Jan van Leeuwen
2008	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers WG Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma
2008	—	`ch.`	Mehrheitsbestimmung - Wer wird Klassensprecher?. Taschenbuch der Algorithmen Thomas Erlebach
2008	J	`jnl`	Routing to reduce the cost of wavelength conversion. Discret. Appl. Math. Thomas Erlebach, Stamatis Stefanakos
2008	J	`jnl`	Trimming of Graphs, with Application to Point Labeling CoRR Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2008	A	`conf`	Trimming of Graphs, with Application to Point Labeling. STACS Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2008	J	`jnl`	WAOA 2005 Special Issue of TOCS. Theory Comput. Syst. Thomas Erlebach, Giuseppe Persiano
2007	J	`jnl`	An Algorithmic View on OVSF Code Assignment. Algorithmica Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
2007	—	`conf`	Approximate Discovery of Random Graphs. SAGA Thomas Erlebach, Alexander Hall, Matús Mihalák
2007	J	`jnl`	Call Control in Rings. Algorithmica Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
2007	J	`jnl`	Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. Giuseppe Di Battista, Thomas Erlebach, Alexander Hall, Maurizio Patrignani, Maurizio Pizzonia, Thomas Schank
2007	J	`jnl`	Cuts and Disjoint Paths in the Valley-Free Model. Internet Math. Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic
2007	—	`conf`	Online Capacitated Interval Coloring. ESCAPE Leah Epstein, Thomas Erlebach, Asaf Levin
2007	J	`jnl`	Tim Roughgarden, Selfish Routing and the Price of Anarchy, MIT Press, Cambridge, MA (2005) ISBN 0-262-18243-2, pp 196. Oper. Res. Lett. Thomas Erlebach
2006	A	`ed.`	Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings ESA Yossi Azar, Thomas Erlebach
2006	—	`ch.`	Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow. Efficient Approximation and Online Algorithms Thomas Erlebach
2006	B	`ed.`	Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers WAOA Thomas Erlebach, Christos Kaklamanis
2006	B	`ed.`	Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers WAOA Thomas Erlebach, Giuseppe Persiano
2006	—	`conf`	Call control on lines. COMSWARE R. Sai Anand, Thomas Erlebach
2006	—	`ed.`	Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers CAAN Thomas Erlebach
2006	—	`conf`	Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. APPROX-RANDOM Christoph Ambühl, Thomas Erlebach, Matús Mihalák, Marc Nunkesser
2006	—	`ch.`	Independence and Coloring Problems on Intersection Graphs of Disks. Efficient Approximation and Online Algorithms Thomas Erlebach, Jirí Fiala
2006	—	`conf`	Length-Bounded Cuts and Flows. ICALP (1) Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella
2006	C	`conf`	Network Discovery and Verification with Distance Queries. CIAC Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák
2006	J	`jnl`	Network Discovery and Verification. IEEE J. Sel. Areas Commun. Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
2006	J	`jnl`	Path problems in generalized stars, complete graphs, and brick wall graphs. Discret. Appl. Math. Thomas Erlebach, Danica Vukadinovic
2006	—	`conf`	Robustness of the Internet at the Topology and Routing Level. Research Results of the DICS Program Thomas Erlebach, Alexander Hall, Linda S. Moonen, Alessandro Panconesi, Frits C. R. Spieksma, Danica Vukadinovic
2006	—	`conf`	Variable Sized Online Interval Coloring with Bandwidth. SWAT Leah Epstein, Thomas Erlebach, Asaf Levin
2005	J	`jnl`	Conversion of coloring algorithms into maximum weight independent set algorithms. Discret. Appl. Math. Thomas Erlebach, Klaus Jansen
2005	—	`ed.`	Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004] Network Analysis Ulrik Brandes, Thomas Erlebach
2005	—	`conf`	Network Discovery and Verification. Algorithms for Optimization with Incomplete Information Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
2005	B	`conf`	Network Discovery and Verification. WG Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram
2005	J	`jnl`	Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. Thomas Erlebach, Klaus Jansen, Eike Seidel
2005	J	`jnl`	Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. Algorithmica Thomas Erlebach, Stamatis Stefanakos
2004	J	`jnl`	Algorithmic complexity of protein identification: combinatorics of weighted strings. Discret. Appl. Math. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
2004	A	`conf`	An Algorithmic View on OVSF Code Assignment. STACS Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
2004	J	`jnl`	An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem. J. Sched. Hiroyuki Miyazawa, Thomas Erlebach
2004	—	`conf`	Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing. CAAN Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic
2004	—	`conf`	Fundamentals. Network Analysis Ulrik Brandes, Thomas Erlebach
2004	—	`conf`	Introduction. Network Analysis Ulrik Brandes, Thomas Erlebach
2004	B	`conf`	Joint Base Station Scheduling. WAOA Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
2004	J	`jnl`	NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. J. Sched. Thomas Erlebach, Alexander Hall
2004	B	`conf`	Off-line Admission Control for Advance Reservations in Star Networks. WAOA Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
2004	A*	`conf`	Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing. INFOCOM Thomas Erlebach, Maurice Rüegg
2004	C	`conf`	Routing in all-optical ring networks revisited. ISCC Stamatis Stefanakos, Thomas Erlebach
2004	—	`conf`	Scheduling with Release Times and Deadlines on a Minimum Number of Machines. IFIP TCS Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer
2003	J	`jnl`	Call control with J. Comput. Syst. Sci. R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
2003	B	`conf`	Greedy Edge-Disjoint Paths in Complete Graphs. WG Paz Carmi, Thomas Erlebach, Yoshio Okamoto
2003	J	`jnl`	Interval selection: Applications, algorithms, and lower bounds. J. Algorithms Thomas Erlebach, Frits C. R. Spieksma
2003	A	`conf`	On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. STACS Thomas Erlebach, Stamatis Stefanakos
2003	B	`conf`	Online Coloring of Intervals with Bandwidth. WAOA Udo Adamy, Thomas Erlebach
2003	B	`conf`	Resource Allocation Problems in Multifiber WDM Tree Networks. WG Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
2003	B	`conf`	Routing and Call Control Algorithms for Ring Networks. WADS R. Sai Anand, Thomas Erlebach
2003	B	`conf`	Scheduling AND/OR-Networks on Identical Parallel Machines. WAOA Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring
2003	B	`conf`	Wavelength Conversion in Shortest-Path All-Optical Networks. ISAAC Thomas Erlebach, Stamatis Stefanakos
2002	—	`conf`	Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
2002	J	`jnl`	Approximating Multiobjective Knapsack Problems. Manag. Sci. Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
2002	A*	`conf`	Call Control in Rings. ICALP Udo Adamy, Christoph Ambühl, R. Sai Anand, Thomas Erlebach
2002	—	`conf`	Call Control with k Rejections. SWAT R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
2002	J	`jnl`	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ACM J. Exp. Algorithmics Thomas Erlebach, Klaus Jansen
2002	A*	`conf`	NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. SODA Thomas Erlebach, Alexander Hall
2002	—	`conf`	On the Spectrum and Structure of Internet Topology Graphs. IICS Danica Vukadinovic, Polly Huang, Thomas Erlebach
2002	B	`conf`	On-line Algorithms for Edge-Disjoint Paths in Trees of Rings. LATIN R. Sai Anand, Thomas Erlebach
2002	J	`jnl`	On-line coloring of geometric intersection graphs. Comput. Geom. Thomas Erlebach, Jirí Fiala
2002	J	`jnl`	Real and generated internet AS topologies: structure, spectrum, robustness. Comput. Commun. Rev. Danica Vukadinovic, Thomas Erlebach, Polly Huang, Maurice Rüegg, Roman Schilter
2002	J	`jnl`	Routing Flow Through a Strongly Connected Graph. Algorithmica Thomas Erlebach, Torben Hagerup
2002	A*	`conf`	Schedulability of event-driven code blocks in real-time embedded systems. DAC Samarjit Chakraborty, Thomas Erlebach, Simon Künzli, Lothar Thiele
2001	B	`conf`	Approximating Multi-objective Knapsack Problems. WADS Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
2001	B	`conf`	Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings. MFCS Thomas Erlebach
2001	J	`jnl`	Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor. Comput. Sci. Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
2001	B	`conf`	New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs. FCT Thomas Erlebach, Danica Vukadinovic
2001	B	`conf`	On the Complexity of Scheduling Conditional Real-Time Code. WADS Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele
2001	B	`conf`	On the Complexity of Train Assignment Problems. ISAAC Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2001	A*	`conf`	Polynomial-time approximation schemes for geometric graphs. SODA Thomas Erlebach, Klaus Jansen, Eike Seidel
2001	J	`jnl`	The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. SIAM J. Discret. Math. Thomas Erlebach, Klaus Jansen
2001	J	`jnl`	The complexity of path coloring and call scheduling. Theor. Comput. Sci. Thomas Erlebach, Klaus Jansen
2000	—	`conf`	Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. ICALP Satellite Workshops Thomas Erlebach, Klaus Jansen
2000	—	`conf`	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. WAE Thomas Erlebach, Klaus Jansen
2000	J	`jnl`	Parallel Load Balancing for Problems with Good Bisectors. J. Parallel Distributed Comput. Stefan Bischof, Ralf Ebner, Thomas Erlebach
2000	B	`conf`	Simple Algorithms for a Weighted Interval Selection Problem. ISAAC Thomas Erlebach, Frits C. R. Spieksma
1999	—	`conf`	A Framework for Recording and Visualizing Event Traces in Parallel Systems with Load Balancing. ARCS Workshops Ralf Ebner, Thomas Erlebach, Claudia Gold, Clemens Harlfinger, Roland Wismüller
1999	J	`jnl`	Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. ACM J. Exp. Algorithmics Thomas Erlebach, Klaus Jansen
1999	J	`jnl`	Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
1999	—	`conf`	Parallel Load Balancing for Problems with Good Bisectors. IPPS/SPDP Stefan Bischof, Ralf Ebner, Thomas Erlebach
1999	—	`—`	Scheduling connections in fast networks. Thomas Erlebach
1998	—	`conf`	Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. WAE Thomas Erlebach, Klaus Jansen
1998	—	`conf`	Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations. Euro-Par Stefan Bischof, Ralf Ebner, Thomas Erlebach
1998	B	`conf`	Maximizing the Number of Connections in Optical Tree Networks. ISAAC Thomas Erlebach, Klaus Jansen
1997	J	`jnl`	An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks Universität Trier, Mathematik/Informatik, Forschungsbericht Thomas Erlebach, Klaus Jansen
1997	—	`conf`	An optimal greedy algorithm for wavelength allocation in directed tree networks. Network Design: Connectivity and Facilities Location Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano
1997	—	`conf`	Call Scheduling in Trees, Rings and Meshes. HICSS (1) Thomas Erlebach, Klaus Jansen
1997	A*	`conf`	Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen
1997	B	`conf`	Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries. ALT Thomas Erlebach, Peter Rossmanith, Hans Stadtherr, Angelika Steger, Thomas Zeugmann
1997	B	`conf`	Off-Line and On-Line Call-Scheduling in Stars and Trees. WG Thomas Erlebach, Klaus Jansen
1996	J	`jnl`	Scheduling of Virtual Connections in Fast Networks Universität Trier, Mathematik/Informatik, Forschungsbericht Thomas Erlebach, Klaus Jansen