Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Thomas Erlebach
@article{DBLP:journals/algorithmica/ErlebachHL23,
author = {Thomas Erlebach and
Michael Hoffmann and
Murilo Santos de Lima},
title = {Round-Competitive Algorithms for Uncertainty Problems with Parallel
Queries},
journal = {Algorithmica},
volume = {85},
number = {2},
pages = {406--443},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01035-6},
doi = {10.1007/S00453-022-01035-6},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachHL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ErlebachS23,
author = {Thomas Erlebach and
Jakob T. Spooner},
title = {Parameterised temporal exploration problems},
journal = {J. Comput. Syst. Sci.},
volume = {135},
pages = {73--88},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.01.003},
doi = {10.1016/J.JCSS.2023.01.003},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ErlebachS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/SenDE23,
author = {Banu Baklan Sen and
{\"{O}}znur Yasar Diner and
Thomas Erlebach},
editor = {Weili Wu and
Guangmo Tong},
title = {List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs},
booktitle = {Computing and Combinatorics - 29th International Conference, {COCOON}
2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {14422},
pages = {168--181},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49190-0\_12},
doi = {10.1007/978-3-031-49190-0\_12},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/SenDE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/ErlebachLMS23,
author = {Thomas Erlebach and
Murilo S. de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Sorting and Hypergraph Orientation under Uncertainty with Predictions},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {5577--5585},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/619},
doi = {10.24963/IJCAI.2023/619},
timestamp = {Mon, 28 Aug 2023 17:23:07 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/ErlebachLMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-09245,
author = {Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Sorting and Hypergraph Orientation under Uncertainty with Predictions},
journal = {CoRR},
volume = {abs/2305.09245},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.09245},
doi = {10.48550/ARXIV.2305.09245},
eprinttype = {arXiv},
eprint = {2305.09245},
timestamp = {Wed, 24 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-09245.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-10108,
author = {Banu Baklan Sen and
{\"{O}}znur Yasar Diner and
Thomas Erlebach},
title = {List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs},
journal = {CoRR},
volume = {abs/2305.10108},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.10108},
doi = {10.48550/ARXIV.2305.10108},
eprinttype = {arXiv},
eprint = {2305.10108},
timestamp = {Wed, 24 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-10108.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07140,
author = {Konstantinos Dogeas and
Thomas Erlebach and
Frank Kammer and
Johannes Meintrup and
William K. Moses Jr.},
title = {Exploiting Automorphisms of Temporal Graphs for Fast Exploration and
Rendezvous},
journal = {CoRR},
volume = {abs/2312.07140},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07140},
doi = {10.48550/ARXIV.2312.07140},
eprinttype = {arXiv},
eprint = {2312.07140},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07140.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ErlebachS22,
author = {Thomas Erlebach and
Jakob T. Spooner},
title = {Exploration of k-edge-deficient temporal graphs},
journal = {Acta Informatica},
volume = {59},
number = {4},
pages = {387--407},
year = {2022},
url = {https://doi.org/10.1007/s00236-022-00421-5},
doi = {10.1007/S00236-022-00421-5},
timestamp = {Mon, 24 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/ErlebachS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LuoEX22,
author = {Kelin Luo and
Thomas Erlebach and
Yinfeng Xu},
title = {Car-sharing between two locations: Online scheduling with flexible
advance bookings},
journal = {Discret. Appl. Math.},
volume = {313},
pages = {53--66},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.01.016},
doi = {10.1016/J.DAM.2022.01.016},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/LuoEX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ErlebachLMS22,
author = {Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {49:1--49:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.49},
doi = {10.4230/LIPICS.ESA.2022.49},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/ErlebachLMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ErlebachLS22,
author = {Thomas Erlebach and
Kelin Luo and
Frits C. R. Spieksma},
editor = {Sang Won Bae and
Heejin Park},
title = {Package Delivery Using Drones with Restricted Movement Areas},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {49:1--49:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.49},
doi = {10.4230/LIPICS.ISAAC.2022.49},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ErlebachLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/ErlebachS22,
author = {Thomas Erlebach and
Jakob T. Spooner},
editor = {James Aspnes and
Othon Michail},
title = {Parameterized Temporal Exploration Problems},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {15:1--15:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.15},
doi = {10.4230/LIPICS.SAND.2022.15},
timestamp = {Fri, 29 Apr 2022 14:01:39 +0200},
biburl = {https://dblp.org/rec/conf/sand/ErlebachS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/algosensors/2022,
editor = {Thomas Erlebach and
Michael Segal},
title = {Algorithmics of Wireless Networks - 18th International Symposium on
Algorithmics of Wireless Networks, {ALGOSENSORS} 2022, Potsdam, Germany,
September 8-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13707},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22050-0},
doi = {10.1007/978-3-031-22050-0},
isbn = {978-3-031-22049-4},
timestamp = {Wed, 21 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-15201,
author = {Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty},
journal = {CoRR},
volume = {abs/2206.15201},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.15201},
doi = {10.48550/ARXIV.2206.15201},
eprinttype = {arXiv},
eprint = {2206.15201},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-15201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-12314,
author = {Thomas Erlebach and
Kelin Luo and
Frits C. R. Spieksma},
title = {Package Delivery Using Drones with Restricted Movement Areas},
journal = {CoRR},
volume = {abs/2209.12314},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.12314},
doi = {10.48550/ARXIV.2209.12314},
eprinttype = {arXiv},
eprint = {2209.12314},
timestamp = {Thu, 06 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-12314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-01594,
author = {Thomas Erlebach and
Jakob T. Spooner},
title = {Parameterized temporal exploration problems},
journal = {CoRR},
volume = {abs/2212.01594},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.01594},
doi = {10.48550/ARXIV.2212.01594},
eprinttype = {arXiv},
eprint = {2212.01594},
timestamp = {Thu, 08 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-01594.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CarvalhoEP21,
author = {Iago A. Carvalho and
Thomas Erlebach and
Kleitos Papadopoulos},
title = {On the fast delivery problem with one or two packages},
journal = {J. Comput. Syst. Sci.},
volume = {115},
pages = {246--263},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2020.09.002},
doi = {10.1016/J.JCSS.2020.09.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/CarvalhoEP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Erlebach0K21,
author = {Thomas Erlebach and
Michael Hoffmann and
Frank Kammer},
title = {On temporal graph exploration},
journal = {J. Comput. Syst. Sci.},
volume = {119},
pages = {1--18},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.01.005},
doi = {10.1016/J.JCSS.2021.01.005},
timestamp = {Thu, 08 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Erlebach0K21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NoyERT21,
author = {Amotz Bar{-}Noy and
Thomas Erlebach and
Dror Rawitz and
Peter Terlecky},
title = {"Green" barrier coverage with mobile sensors},
journal = {Theor. Comput. Sci.},
volume = {860},
pages = {117--134},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.01.034},
doi = {10.1016/J.TCS.2021.01.034},
timestamp = {Fri, 05 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NoyERT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BampisDELMS21,
author = {Evripidis Bampis and
Christoph D{\"{u}}rr and
Thomas Erlebach and
Murilo Santos de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {10:1--10:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.10},
doi = {10.4230/LIPICS.ESA.2021.10},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/BampisDELMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Erlebach21,
author = {Thomas Erlebach},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Algorithms that Access the Input via Queries},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {3--12},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_1},
doi = {10.1007/978-3-030-67731-2\_1},
timestamp = {Sun, 25 Jul 2021 11:44:25 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Erlebach21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Erlebach0L21,
author = {Thomas Erlebach and
Michael Hoffmann and
Murilo Santos de Lima},
editor = {Markus Bl{\"{a}}ser and
Benjamin Monmege},
title = {Round-Competitive Algorithms for Uncertainty Problems with Parallel
Queries},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {187},
pages = {27:1--27:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.STACS.2021.27},
doi = {10.4230/LIPICS.STACS.2021.27},
timestamp = {Thu, 11 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Erlebach0L21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ErlebachS21,
author = {Thomas Erlebach and
Jakob T. Spooner},
editor = {Anna Lubiw and
Mohammad R. Salavatipour},
title = {Exploration of k-Edge-Deficient Temporal Graphs},
booktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS}
2021, Virtual Event, August 9-11, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12808},
pages = {371--384},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-83508-8\_27},
doi = {10.1007/978-3-030-83508-8\_27},
timestamp = {Thu, 12 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ErlebachS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-05032,
author = {Thomas Erlebach and
Michael Hoffmann and
Murilo S. de Lima},
title = {Round-Competitive Algorithms for Uncertainty Problems with Parallel
Queries},
journal = {CoRR},
volume = {abs/2101.05032},
year = {2021},
url = {https://arxiv.org/abs/2101.05032},
eprinttype = {arXiv},
eprint = {2101.05032},
timestamp = {Fri, 22 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-05032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-00572,
author = {Evripidis Bampis and
Christoph D{\"{u}}rr and
Thomas Erlebach and
Murilo S. de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Orienting (hyper)graphs under explorable stochastic uncertainty},
journal = {CoRR},
volume = {abs/2107.00572},
year = {2021},
url = {https://arxiv.org/abs/2107.00572},
eprinttype = {arXiv},
eprint = {2107.00572},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-00572.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DurrEMM20,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
title = {An Adversarial Model for Scheduling with Testing},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3630--3675},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00742-2},
doi = {10.1007/S00453-020-00742-2},
timestamp = {Sat, 07 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DurrEMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EpsteinE20,
author = {Leah Epstein and
Thomas Erlebach},
title = {Special Issue on Approximation and Online Algorithms},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {569--570},
year = {2020},
url = {https://doi.org/10.1007/s00224-020-09970-z},
doi = {10.1007/S00224-020-09970-Z},
timestamp = {Wed, 06 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EpsteinE20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EpsteinE20a,
author = {Leah Epstein and
Thomas Erlebach},
title = {Correction to: Special Issue on Approximation and Online Algorithms},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {571},
year = {2020},
url = {https://doi.org/10.1007/s00224-020-09972-x},
doi = {10.1007/S00224-020-09972-X},
timestamp = {Wed, 06 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EpsteinE20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ErlebachS20,
author = {Thomas Erlebach and
Jakob T. Spooner},
editor = {Andrea Werneck Richa and
Christian Scheideler},
title = {Non-strict Temporal Exploration},
booktitle = {Structural Information and Communication Complexity - 27th International
Colloquium, {SIROCCO} 2020, Paderborn, Germany, June 29 - July 1,
2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12156},
pages = {129--145},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-54921-3\_8},
doi = {10.1007/978-3-030-54921-3\_8},
timestamp = {Fri, 31 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/ErlebachS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/ErlebachS20,
author = {Thomas Erlebach and
Jakob T. Spooner},
editor = {Alexander Chatzigeorgiou and
Riccardo Dondi and
Herodotos Herodotou and
Christos A. Kapoutsis and
Yannis Manolopoulos and
George A. Papadopoulos and
Florian Sikora},
title = {A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity},
booktitle = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International
Conference on Current Trends in Theory and Practice of Informatics,
{SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12011},
pages = {64--75},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-38919-2\_6},
doi = {10.1007/978-3-030-38919-2\_6},
timestamp = {Thu, 06 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/ErlebachS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-07385,
author = {Thomas Erlebach and
Michael Hoffmann and
Murilo S. de Lima and
Nicole Megow and
Jens Schl{\"{o}}ter},
title = {Untrusted Predictions Improve Trustable Query Policies},
journal = {CoRR},
volume = {abs/2011.07385},
year = {2020},
url = {https://arxiv.org/abs/2011.07385},
eprinttype = {arXiv},
eprint = {2011.07385},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-07385.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachLLSWZ19,
author = {Thomas Erlebach and
Fu{-}Hong Liu and
Hsiang{-}Hsuan Liu and
Mordechai Shalom and
Prudence W. H. Wong and
Shmuel Zaks},
title = {Complexity and online algorithms for minimum skyline coloring of intervals},
journal = {Theor. Comput. Sci.},
volume = {788},
pages = {66--78},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.05.007},
doi = {10.1016/J.TCS.2019.05.007},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ErlebachLLSWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/CarvalhoEP19,
author = {Iago A. Carvalho and
Thomas Erlebach and
Kleitos Papadopoulos},
editor = {Leszek Antoni Gasieniec and
Jesper Jansson and
Christos Levcopoulos},
title = {An Efficient Algorithm for the Fast Delivery Problem},
booktitle = {Fundamentals of Computation Theory - 22nd International Symposium,
{FCT} 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11651},
pages = {171--184},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-25027-0\_12},
doi = {10.1007/978-3-030-25027-0\_12},
timestamp = {Tue, 17 May 2022 11:54:28 +0200},
biburl = {https://dblp.org/rec/conf/fct/CarvalhoEP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ErlebachKLSS19,
author = {Thomas Erlebach and
Frank Kammer and
Kelin Luo and
Andrej Sajenko and
Jakob T. Spooner},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Two Moves per Time Step Make a Difference},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {141:1--141:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.141},
doi = {10.4230/LIPICS.ICALP.2019.141},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/ErlebachKLSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LuoEX19,
author = {Kelin Luo and
Thomas Erlebach and
Yinfeng Xu},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Car-Sharing on a Star Network: On-Line Scheduling with k Servers},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {51:1--51:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.51},
doi = {10.4230/LIPICS.STACS.2019.51},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/LuoEX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-09142,
author = {Iago A. Carvalho and
Thomas Erlebach and
Kleitos Papadopoulos},
title = {An Efficient Algorithm for the Fast Delivery Problem},
journal = {CoRR},
volume = {abs/1904.09142},
year = {2019},
url = {http://arxiv.org/abs/1904.09142},
eprinttype = {arXiv},
eprint = {1904.09142},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-09142.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-06828,
author = {Thomas Erlebach and
Jakob T. Spooner},
title = {A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity},
journal = {CoRR},
volume = {abs/1908.06828},
year = {2019},
url = {http://arxiv.org/abs/1908.06828},
eprinttype = {arXiv},
eprint = {1908.06828},
timestamp = {Mon, 26 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-06828.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Erlebach18,
author = {Thomas Erlebach},
editor = {Florin Manea and
Russell G. Miller and
Dirk Nowotka},
title = {Computing and Scheduling with Explorable Uncertainty},
booktitle = {Sailing Routes in the World of Computation - 14th Conference on Computability
in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10936},
pages = {156--160},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94418-0\_16},
doi = {10.1007/978-3-319-94418-0\_16},
timestamp = {Wed, 16 Nov 2022 11:08:36 +0100},
biburl = {https://dblp.org/rec/conf/cie/Erlebach18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LuoEX18,
author = {Kelin Luo and
Thomas Erlebach and
Yinfeng Xu},
editor = {Lusheng Wang and
Daming Zhu},
title = {Car-Sharing Between Two Locations: Online Scheduling with Flexible
Advance Bookings},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {242--254},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_21},
doi = {10.1007/978-3-319-94776-1\_21},
timestamp = {Thu, 20 Aug 2020 16:02:36 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/LuoEX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DurrEMM18,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
editor = {Anna R. Karlin},
title = {Scheduling with Explorable Uncertainty},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {30:1--30:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.30},
doi = {10.4230/LIPICS.ITCS.2018.30},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DurrEMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FickerEMS18,
author = {Annette M. C. Ficker and
Thomas Erlebach and
Mat{\'{u}}s Mihal{\'{a}}k and
Frits C. R. Spieksma},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based
Algorithm},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {45:1--45:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.45},
doi = {10.4230/LIPICS.ISAAC.2018.45},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FickerEMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LuoEX18,
author = {Kelin Luo and
Thomas Erlebach and
Yinfeng Xu},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Online Scheduling of Car-Sharing Requests Between Two Locations with
Many Cars and Flexible Advance Bookings},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {64:1--64:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.64},
doi = {10.4230/LIPICS.ISAAC.2018.64},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LuoEX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ErlebachS18,
author = {Thomas Erlebach and
Jakob T. Spooner},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Faster Exploration of Degree-Bounded Temporal Graphs},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {36:1--36:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.36},
doi = {10.4230/LIPICS.MFCS.2018.36},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/ErlebachS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LuoEX18,
author = {Kelin Luo and
Thomas Erlebach and
Yinfeng Xu},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Car-Sharing between Two Locations: Online Scheduling with Two Servers},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {50:1--50:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.50},
doi = {10.4230/LIPICS.MFCS.2018.50},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/LuoEX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2018,
editor = {Leah Epstein and
Thomas Erlebach},
title = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4},
doi = {10.1007/978-3-030-04693-4},
isbn = {978-3-030-04692-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-01962,
author = {Annette M. C. Ficker and
Thomas Erlebach and
Mat{\'{u}}s Mihal{\'{a}}k and
Frits C. R. Spieksma},
title = {Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based
Algorithm},
journal = {CoRR},
volume = {abs/1807.01962},
year = {2018},
url = {http://arxiv.org/abs/1807.01962},
eprinttype = {arXiv},
eprint = {1807.01962},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-01962.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijsnet/RasulE17,
author = {Aram Rasul and
Thomas Erlebach},
title = {The extra-bit technique for reducing idle listening in data collection},
journal = {Int. J. Sens. Networks},
volume = {25},
number = {1},
pages = {31--44},
year = {2017},
url = {https://doi.org/10.1504/IJSNET.2016.10001535},
doi = {10.1504/IJSNET.2016.10001535},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijsnet/RasulE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ErlebachLLSWZ17,
author = {Thomas Erlebach and
Fu{-}Hong Liu and
Hsiang{-}Hsuan Liu and
Mordechai Shalom and
Prudence W. H. Wong and
Shmuel Zaks},
editor = {Xiaofeng Gao and
Hongwei Du and
Meng Han},
title = {Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals},
booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
{COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {10628},
pages = {317--332},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-71147-8\_22},
doi = {10.1007/978-3-319-71147-8\_22},
timestamp = {Tue, 14 Jun 2022 14:15:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/ErlebachLLSWZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/AlsughayyirE17,
author = {Aeshah Alsughayyir and
Thomas Erlebach},
editor = {Xiaofeng Gao and
Hongwei Du and
Meng Han},
title = {Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous
Processors},
booktitle = {Combinatorial Optimization and Applications - 11th International Conference,
{COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {10628},
pages = {457--465},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-71147-8\_32},
doi = {10.1007/978-3-319-71147-8\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/AlsughayyirE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispan/MashraqiE17,
author = {Aisha Mousa Mashraqi and
Thomas Erlebach},
title = {Throughput Improvement by Reducing Dropped Packets at Interface Queue
{(IFQ)} in Multi-channel Wireless Mesh Networks},
booktitle = {14th International Symposium on Pervasive Systems, Algorithms and
Networks {\&} 11th International Conference on Frontier of Computer
Science and Technology {\&} Third International Symposium of Creative
Computing, {ISPAN-FCST-ISCC} 2017, Exeter, United Kingdom, June 21-23,
2017},
pages = {140--147},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/ISPAN-FCST-ISCC.2017.47},
doi = {10.1109/ISPAN-FCST-ISCC.2017.47},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ispan/MashraqiE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispdc/AlsughayyirE17,
author = {Aeshah Alsughayyir and
Thomas Erlebach},
editor = {Radu Prodan and
Florin Pop and
Ralf{-}Peter Mundani},
title = {A Bi-objective Scheduling Approach for Energy Optimisation of Executing
and Transmitting {HPC} Applications in Decentralised Multi-cloud Systems},
booktitle = {16th International Symposium on Parallel and Distributed Computing,
{ISPDC} 2017, Innsbruck, Austria, July 3-6, 2017},
pages = {44--53},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISPDC.2017.27},
doi = {10.1109/ISPDC.2017.27},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ispdc/AlsughayyirE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02592,
author = {Christoph D{\"{u}}rr and
Thomas Erlebach and
Nicole Megow and
Julie Mei{\ss}ner},
title = {Scheduling with Explorable Uncertainty},
journal = {CoRR},
volume = {abs/1709.02592},
year = {2017},
url = {http://arxiv.org/abs/1709.02592},
eprinttype = {arXiv},
eprint = {1709.02592},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Erlebach0K16,
author = {Thomas Erlebach and
Michael Hoffmann and
Frank Kammer},
title = {Query-competitive algorithms for cheapest set problems under uncertainty},
journal = {Theor. Comput. Sci.},
volume = {613},
pages = {51--64},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.11.025},
doi = {10.1016/J.TCS.2015.11.025},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Erlebach0K16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/Erlebach16,
author = {Thomas Erlebach},
editor = {Daming Zhu and
Sergey Bereg},
title = {Algorithms for Queryable Uncertainty},
booktitle = {Frontiers in Algorithmics, 10th International Workshop, {FAW} 2016,
Qingdao, China, June 30- July 2, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9711},
pages = {1--7},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-39817-4\_1},
doi = {10.1007/978-3-319-39817-4\_1},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/Erlebach16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdp/AlsughayyirE16,
author = {Aeshah Alsughayyir and
Thomas Erlebach},
title = {Energy Aware Scheduling of {HPC} Tasks in Decentralised Cloud Systems},
booktitle = {24th Euromicro International Conference on Parallel, Distributed,
and Network-Based Processing, {PDP} 2016, Heraklion, Crete, Greece,
February 17-19, 2016},
pages = {617--621},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/PDP.2016.83},
doi = {10.1109/PDP.2016.83},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pdp/AlsughayyirE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Erlebach015,
author = {Thomas Erlebach and
Michael Hoffmann},
title = {Query-Competitive Algorithms for Computing with Uncertainty},
journal = {Bull. {EATCS}},
volume = {116},
year = {2015},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/335},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Erlebach015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachP15,
author = {Thomas Erlebach and
Giuseppe Persiano},
title = {Special Issue on Approximation and Online Algorithms},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {135--136},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9589-x},
doi = {10.1007/S00224-014-9589-X},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChiesaBEP15,
author = {Marco Chiesa and
Giuseppe Di Battista and
Thomas Erlebach and
Maurizio Patrignani},
title = {Computational complexity of traffic hijacking under {BGP} and {S-BGP}},
journal = {Theor. Comput. Sci.},
volume = {600},
pages = {143--154},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.07.038},
doi = {10.1016/J.TCS.2015.07.038},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChiesaBEP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Erlebach0K15,
author = {Thomas Erlebach and
Michael Hoffmann and
Frank Kammer},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {On Temporal Graph Exploration},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {444--455},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_36},
doi = {10.1007/978-3-662-47672-7\_36},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Erlebach0K15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/AlqahtaniE15,
author = {Hasna Mohsen Alqahtani and
Thomas Erlebach},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded
Tree-Width},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {13--24},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_2},
doi = {10.1007/978-3-319-29516-9\_2},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/AlqahtaniE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mass/RasulE15,
author = {Aram Rasul and
Thomas Erlebach},
title = {An Energy Efficient and Restricted Tour Construction for Mobile Sink
in Wireless Sensor Networks},
booktitle = {12th {IEEE} International Conference on Mobile Ad Hoc and Sensor Systems,
{MASS} 2015, Dallas, TX, USA, October 19-22, 2015},
pages = {55--63},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/MASS.2015.41},
doi = {10.1109/MASS.2015.41},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mass/RasulE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/ErlebachR15,
author = {Thomas Erlebach and
Matthew Radoja},
editor = {Martin Hoefer},
title = {Further Results on Capacitated Network Design Games},
booktitle = {Algorithmic Game Theory - 8th International Symposium, {SAGT} 2015,
Saarbr{\"{u}}cken, Germany, September 28-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9347},
pages = {57--68},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48433-3\_5},
doi = {10.1007/978-3-662-48433-3\_5},
timestamp = {Fri, 26 Mar 2021 08:28:34 +0100},
biburl = {https://dblp.org/rec/conf/sagt/ErlebachR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Erlebach0K15,
author = {Thomas Erlebach and
Michael Hoffmann and
Frank Kammer},
title = {On Temporal Graph Exploration},
journal = {CoRR},
volume = {abs/1504.07976},
year = {2015},
url = {http://arxiv.org/abs/1504.07976},
eprinttype = {arXiv},
eprint = {1504.07976},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Erlebach0K15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NoyEHNO14,
author = {Amotz Bar{-}Noy and
Thomas Erlebach and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Sotiris E. Nikoletseas and
Pekka Orponen},
title = {Editorial for Algorithms for Sensor Systems, Wireless Ad Hoc Networks
and Autonomous Mobile Entities},
journal = {Theor. Comput. Sci.},
volume = {553},
pages = {1},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.09.004},
doi = {10.1016/J.TCS.2014.09.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NoyEHNO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/winet/GunashekarDEW14,
author = {S. D. Gunashekar and
A. Das and
Thomas Erlebach and
E. M. Warrington},
title = {An experimental study of small multi-hop wireless networks using chirp
spread spectrum},
journal = {Wirel. Networks},
volume = {20},
number = {1},
pages = {89--103},
year = {2014},
url = {https://doi.org/10.1007/s11276-013-0595-8},
doi = {10.1007/S11276-013-0595-8},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/winet/GunashekarDEW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Erlebach0K14,
author = {Thomas Erlebach and
Michael Hoffmann and
Frank Kammer},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {263--274},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_23},
doi = {10.1007/978-3-662-44465-8\_23},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Erlebach0K14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/msn/RasulE14,
author = {Aram Rasul and
Thomas Erlebach},
title = {Reducing Idle Listening during Data Collection in Wireless Sensor
Networks},
booktitle = {10th International Conference on Mobile Ad-hoc and Sensor Networks,
{MSN} 2014, Maui, HI, USA, December 19-21, 2014},
pages = {16--23},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/MSN.2014.10},
doi = {10.1109/MSN.2014.10},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/msn/RasulE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/AlqahtaniE14,
author = {Hasna Mohsen Alqahtani and
Thomas Erlebach},
editor = {Viliam Geffert and
Bart Preneel and
Branislav Rovan and
Julius Stuller and
A Min Tjoa},
title = {Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded
Treewidth},
booktitle = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8327},
pages = {65--76},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04298-5\_7},
doi = {10.1007/978-3-319-04298-5\_7},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/AlqahtaniE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Erlebach014,
author = {Thomas Erlebach and
Michael Hoffmann},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Minimum Spanning Tree Verification Under Uncertainty},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {164--175},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_14},
doi = {10.1007/978-3-319-12340-0\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Erlebach014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adhoc-now/HennaE13,
author = {Shagufta Henna and
Thomas Erlebach},
editor = {Jacek Cichon and
Maciej Gebala and
Marek Klonowski},
title = {Approximating Maximum Disjoint Coverage in Wireless Sensor Networks},
booktitle = {Ad-hoc, Mobile, and Wireless Network - 12th International Conference,
{ADHOC-NOW} 2013, Wroc{\l}aw, Poland, July 8-10, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7960},
pages = {148--159},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39247-4\_13},
doi = {10.1007/978-3-642-39247-4\_13},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/adhoc-now/HennaE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adhoc-now/HennaE13a,
author = {Shagufta Henna and
Thomas Erlebach},
editor = {Jacek Cichon and
Maciej Gebala and
Marek Klonowski},
title = {Least Channel Variation Multi-channel {MAC} {(LCV-MMAC)}},
booktitle = {Ad-hoc, Mobile, and Wireless Network - 12th International Conference,
{ADHOC-NOW} 2013, Wroc{\l}aw, Poland, July 8-10, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7960},
pages = {160--171},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39247-4\_14},
doi = {10.1007/978-3-642-39247-4\_14},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/adhoc-now/HennaE13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AlqahtaniE13,
author = {Hasna Mohsen Alqahtani and
Thomas Erlebach},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Approximation Algorithms for Disjoint \emph{st}-Paths with Minimum
Activation Cost},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {1--12},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_1},
doi = {10.1007/978-3-642-38233-8\_1},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AlqahtaniE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2012,
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {Approximation and Online Algorithms - 10th International Workshop,
{WAOA} 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {7846},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38016-7},
doi = {10.1007/978-3-642-38016-7},
isbn = {978-3-642-38015-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csndsp/GunashekarDEW12,
author = {S. D. Gunashekar and
A. Das and
Thomas Erlebach and
E. M. Warrington},
title = {A simple scheme to improve the throughput of small multi-hop wireless
networks},
booktitle = {8th International Symposium on Communication Systems, Networks {\&}
Digital Signal Processing, {CSNDSP} 2012, Poznan, Poland, July 18-20,
2012},
pages = {1--5},
publisher = {{IEEE}},
year = {2012},
url = {https://doi.org/10.1109/CSNDSP.2012.6292710},
doi = {10.1109/CSNDSP.2012.6292710},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/csndsp/GunashekarDEW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChiesaBEP12,
author = {Marco Chiesa and
Giuseppe Di Battista and
Thomas Erlebach and
Maurizio Patrignani},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Computational Complexity of Traffic Hijacking under {BGP} and {S-BGP}},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7392},
pages = {476--487},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31585-5\_43},
doi = {10.1007/978-3-642-31585-5\_43},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChiesaBEP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/algosensors/2011,
editor = {Thomas Erlebach and
Sotiris E. Nikoletseas and
Pekka Orponen},
title = {Algorithms for Sensor Systems - 7th International Symposium on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile
Entities, {ALGOSENSORS} 2011, Saarbr{\"{u}}cken, Germany, September
8-9, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7111},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28209-6},
doi = {10.1007/978-3-642-28209-6},
isbn = {978-3-642-28208-9},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/algosensors/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-4564,
author = {Marco Chiesa and
Giuseppe Di Battista and
Thomas Erlebach and
Maurizio Patrignani},
title = {Computational Complexity of Traffic Hijacking under {BGP} and {S-BGP}},
journal = {CoRR},
volume = {abs/1205.4564},
year = {2012},
url = {http://arxiv.org/abs/1205.4564},
eprinttype = {arXiv},
eprint = {1205.4564},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-4564.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/suscom/ErlebachGK11,
author = {Thomas Erlebach and
Tom Grant and
Frank Kammer},
title = {Maximising lifetime for fault-tolerant target coverage in sensor networks},
journal = {Sustain. Comput. Informatics Syst.},
volume = {1},
number = {3},
pages = {213--225},
year = {2011},
url = {https://doi.org/10.1016/j.suscom.2011.05.005},
doi = {10.1016/J.SUSCOM.2011.05.005},
timestamp = {Tue, 25 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/suscom/ErlebachGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChangEGK11,
author = {Jessica Chang and
Thomas Erlebach and
Renars Gailis and
Samir Khuller},
title = {Broadcast scheduling: Algorithms and complexity},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {47:1--47:14},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000815},
doi = {10.1145/2000807.2000815},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ChangEGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ieeehpcs/AshrafE11,
author = {Jawad Ashraf and
Thomas Erlebach},
editor = {Waleed W. Smari and
John P. McIntire},
title = {A hybrid scheduling technique for grid workflows in advance reservation
environments},
booktitle = {2011 International Conference on High Performance Computing {\&}
Simulation, {HPCS} 2012, Istanbul, Turkey, July 4-8, 2011},
pages = {98--106},
publisher = {{IEEE}},
year = {2011},
url = {https://doi.org/10.1109/HPCSim.2011.5999812},
doi = {10.1109/HPCSIM.2011.5999812},
timestamp = {Tue, 28 Jul 2020 13:09:02 +0200},
biburl = {https://dblp.org/rec/conf/ieeehpcs/AshrafE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ErlebachGK11,
author = {Thomas Erlebach and
Tom Grant and
Frank Kammer},
editor = {Rajmohan Rajaraman and
Friedhelm Meyer auf der Heide},
title = {Maximising lifetime for fault-tolerant target coverage in sensor networks},
booktitle = {{SPAA} 2011: Proceedings of the 23rd Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011
(Co-located with {FCRC} 2011)},
pages = {187--196},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1989493.1989521},
doi = {10.1145/1989493.1989521},
timestamp = {Wed, 21 Nov 2018 11:16:22 +0100},
biburl = {https://dblp.org/rec/conf/spaa/ErlebachGK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/voecking2011/Erlebach11,
author = {Thomas Erlebach},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Majority - Who Gets Elected Class Rep?},
booktitle = {Algorithms Unplugged},
pages = {239--247},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-15328-0\_24},
doi = {10.1007/978-3-642-15328-0\_24},
timestamp = {Wed, 14 Jun 2017 20:29:01 +0200},
biburl = {https://dblp.org/rec/books/sp/voecking2011/Erlebach11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachHJMW10,
author = {Thomas Erlebach and
Torben Hagerup and
Klaus Jansen and
Moritz Minzlaff and
Alexander Wolff},
title = {Trimming of Graphs, with Application to Point Labeling},
journal = {Theory Comput. Syst.},
volume = {47},
number = {3},
pages = {613--636},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9184-8},
doi = {10.1007/S00224-009-9184-8},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachHJMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaierEHKKPSS10,
author = {Georg Baier and
Thomas Erlebach and
Alexander Hall and
Ekkehard K{\"{o}}hler and
Petr Kolman and
Ondrej Pangr{\'{a}}c and
Heiko Schilling and
Martin Skutella},
title = {Length-bounded cuts and flows},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {1},
pages = {4:1--4:27},
year = {2010},
url = {https://doi.org/10.1145/1868237.1868241},
doi = {10.1145/1868237.1868241},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BaierEHKKPSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiloEMW10,
author = {Davide Bil{\`{o}} and
Thomas Erlebach and
Mat{\'{u}}s Mihal{\'{a}}k and
Peter Widmayer},
title = {Discovery of network properties with all-shortest-paths queries},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {14-15},
pages = {1626--1637},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.01.010},
doi = {10.1016/J.TCS.2010.01.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BiloEMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/ErlebachG10,
author = {Thomas Erlebach and
Tom Grant},
editor = {Christian Scheideler},
title = {Scheduling Multicast Transmissions under {SINR} Constraints},
booktitle = {Algorithms for Sensor Systems - 6th International Workshop on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile
Entities, {ALGOSENSORS} 2010, Bordeaux, France, July 5, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6451},
pages = {47--61},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16988-5\_5},
doi = {10.1007/978-3-642-16988-5\_5},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/ErlebachG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ErlebachL10,
author = {Thomas Erlebach and
Erik Jan van Leeuwen},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {{PTAS} for Weighted Set Cover on Unit Squares},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {166--177},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_13},
doi = {10.1007/978-3-642-15369-3\_13},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ErlebachL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/ErlebachL10,
author = {Thomas Erlebach and
Marco E. L{\"{u}}bbecke},
editor = {Thomas Erlebach and
Marco E. L{\"{u}}bbecke},
title = {Frontmatter, Table of Contents, Preface, Organization},
booktitle = {{ATMOS} 2010 - 10th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, Liverpool, United Kingdom, September
6-10, 2010},
series = {OASIcs},
volume = {14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
year = {2010},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2010.i},
doi = {10.4230/OASICS.ATMOS.2010.I},
timestamp = {Fri, 05 Apr 2024 10:04:16 +0200},
biburl = {https://dblp.org/rec/conf/atmos/ErlebachL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnp/CittadiniBEPR10,
author = {Luca Cittadini and
Giuseppe Di Battista and
Thomas Erlebach and
Maurizio Patrignani and
Massimo Rimondini},
title = {Assigning {AS} relationships to satisfy the Gao-Rexford conditions},
booktitle = {Proceedings of the 18th annual {IEEE} International Conference on
Network Protocols, {ICNP} 2010, Kyoto, Japan, 5-8 October, 2010},
pages = {113--123},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ICNP.2010.5762760},
doi = {10.1109/ICNP.2010.5762760},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icnp/CittadiniBEPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ieeehpcs/AshrafE10,
author = {Jawad Ashraf and
Thomas Erlebach},
editor = {Waleed W. Smari and
John P. McIntire},
title = {A new resource mapping technique for Grid workflows in advance reservation
environments},
booktitle = {Proceedings of the 2010 International Conference on High Performance
Computing {\&} Simulation, {HPCS} 2010, June 28 - July 2, 2010,
Caen, France},
pages = {63--70},
publisher = {{IEEE}},
year = {2010},
url = {https://doi.org/10.1109/HPCS.2010.5547148},
doi = {10.1109/HPCS.2010.5547148},
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
biburl = {https://dblp.org/rec/conf/ieeehpcs/AshrafE10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwcmc/ShahnazE10,
author = {Ambreen Shahnaz and
Thomas Erlebach},
editor = {Ahmed Helmy and
Peter Mueller and
Yan Zhang},
title = {Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless
networks},
booktitle = {Proceedings of the 6th International Wireless Communications and Mobile
Computing Conference, {IWCMC} 2010, Caen, France, June 28 - July 2,
2010},
pages = {529--533},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1815396.1815519},
doi = {10.1145/1815396.1815519},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwcmc/ShahnazE10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/momm/HennaE10,
author = {Shagufta Henna and
Thomas Erlebach},
editor = {Gabriele Kotsis and
David Taniar and
Eric Pardede and
Irfan Awan and
Imad Saleh and
Ismail Khalil},
title = {{CMAB:} cross layer mobility-adaptive broadcasting in mobile ad hoc
networks},
booktitle = {MoMM'2010 - The Eighth International Conference on Advances in Mobile
Computing and Multimedia, 8-10 November 2010, Paris, France},
pages = {94--101},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1971519.1971538},
doi = {10.1145/1971519.1971538},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/momm/HennaE10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/atmos/2010,
editor = {Thomas Erlebach and
Marco E. L{\"{u}}bbecke},
title = {{ATMOS} 2010 - 10th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, Liverpool, United Kingdom, September
6-10, 2010},
series = {OASIcs},
volume = {14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
year = {2010},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/atmos/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinEL09,
author = {Leah Epstein and
Thomas Erlebach and
Asaf Levin},
title = {Variable Sized Online Interval Coloring with Bandwidth},
journal = {Algorithmica},
volume = {53},
number = {3},
pages = {385--401},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9071-0},
doi = {10.1007/S00453-007-9071-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinEL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarE09,
author = {Yossi Azar and
Thomas Erlebach},
title = {Foreword},
journal = {Algorithmica},
volume = {53},
number = {4},
pages = {455--456},
year = {2009},
url = {https://doi.org/10.1007/s00453-008-9262-3},
doi = {10.1007/S00453-008-9262-3},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarE09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/ErlebachMSV09,
author = {Thomas Erlebach and
Linda S. Moonen and
Frits C. R. Spieksma and
Danica Vukadinovic},
title = {Connectivity Measures for Internet Topologies on the Level of Autonomous
Systems},
journal = {Oper. Res.},
volume = {57},
number = {4},
pages = {1006--1025},
year = {2009},
url = {https://doi.org/10.1287/opre.1080.0677},
doi = {10.1287/OPRE.1080.0677},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/ErlebachMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachK09,
author = {Thomas Erlebach and
Christos Kaklamanis},
title = {{WAOA} 2006 Special Issue of {TOCS}},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {427--428},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9189-3},
doi = {10.1007/S00224-009-9189-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EpsteinEL09,
author = {Leah Epstein and
Thomas Erlebach and
Asaf Levin},
title = {Online Capacitated Interval Coloring},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {2},
pages = {822--841},
year = {2009},
url = {https://doi.org/10.1137/070682496},
doi = {10.1137/070682496},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EpsteinEL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/ErlebachM09,
author = {Thomas Erlebach and
Anna Mereu},
title = {Path Splicing with Guaranteed Fault Tolerance},
booktitle = {Proceedings of the Global Communications Conference, 2009. {GLOBECOM}
2009, Honolulu, Hawaii, USA, 30 November - 4 December 2009},
pages = {1--6},
publisher = {{IEEE}},
year = {2009},
url = {https://doi.org/10.1109/GLOCOM.2009.5425984},
doi = {10.1109/GLOCOM.2009.5425984},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/globecom/ErlebachM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwcmc/ErlebachS09,
author = {Thomas Erlebach and
Ambreen Shahnaz},
editor = {Mohsen Guizani and
Peter M{\"{u}}ller and
Klaus{-}Peter F{\"{a}}hnrich and
Athanasios V. Vasilakos and
Yan Zhang and
Jun Zhang},
title = {Approximating node-weighted multicast trees in wireless ad-hoc networks},
booktitle = {Proceedings of the International Conference on Wireless Communications
and Mobile Computing: Connecting the World Wirelessly, {IWCMC} 2009,
Leipzig, Germany, June 21-24, 2009},
pages = {639--643},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1582379.1582518},
doi = {10.1145/1582379.1582518},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwcmc/ErlebachS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ErlebachM09,
author = {Thomas Erlebach and
Mat{\'{u}}s Mihal{\'{a}}k},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {A {(4} + \emph{epsilon})-Approximation for the Minimum-Weight Dominating
Set Problem in Unit Disk Graphs},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {135--146},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_13},
doi = {10.1007/978-3-642-12450-1\_13},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ErlebachM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/opt/ErlebachJKP09,
author = {Thomas Erlebach and
Klaus Jansen and
Christos Kaklamanis and
Giuseppe Persiano},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {Directed Tree Networks},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {716--725},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_127},
doi = {10.1007/978-0-387-74759-0\_127},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/opt/ErlebachJKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErlebachS08,
author = {Thomas Erlebach and
Stamatis Stefanakos},
title = {Routing to reduce the cost of wavelength conversion},
journal = {Discret. Appl. Math.},
volume = {156},
number = {15},
pages = {2911--2923},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.12.001},
doi = {10.1016/J.DAM.2007.12.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErlebachS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachP08,
author = {Thomas Erlebach and
Giuseppe Persiano},
title = {{WAOA} 2005 Special Issue of {TOCS}},
journal = {Theory Comput. Syst.},
volume = {43},
number = {1},
pages = {1--2},
year = {2008},
url = {https://doi.org/10.1007/s00224-007-9041-6},
doi = {10.1007/S00224-007-9041-6},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ErlebachL08,
author = {Thomas Erlebach and
Erik Jan van Leeuwen},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Domination in Geometric Intersection Graphs},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {747--758},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_64},
doi = {10.1007/978-3-540-78773-0\_64},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/ErlebachL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/BiloEMW08,
author = {Davide Bil{\`{o}} and
Thomas Erlebach and
Mat{\'{u}}s Mihal{\'{a}}k and
Peter Widmayer},
editor = {Alexander A. Shvartsman and
Pascal Felber},
title = {Discovery of Network Properties with All-Shortest-Paths Queries},
booktitle = {Structural Information and Communication Complexity, 15th International
Colloquium, {SIROCCO} 2008, Villars-sur-Ollon, Switzerland, June 17-20,
2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5058},
pages = {89--103},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69355-0\_9},
doi = {10.1007/978-3-540-69355-0\_9},
timestamp = {Thu, 23 Jun 2022 19:57:45 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/BiloEMW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChangEGK08,
author = {Jessica Chang and
Thomas Erlebach and
Renars Gailis and
Samir Khuller},
editor = {Shang{-}Hua Teng},
title = {Broadcast scheduling: algorithms and complexity},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {473--482},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347134},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChangEGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ErlebachL08,
author = {Thomas Erlebach and
Erik Jan van Leeuwen},
editor = {Shang{-}Hua Teng},
title = {Approximating geometric coverage problems},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1267--1276},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347220},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ErlebachL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ErlebachHJMW08,
author = {Thomas Erlebach and
Torben Hagerup and
Klaus Jansen and
Moritz Minzlaff and
Alexander Wolff},
editor = {Susanne Albers and
Pascal Weil},
title = {Trimming of Graphs, with Application to Point Labeling},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {265--276},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1350},
doi = {10.4230/LIPICS.STACS.2008.1350},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ErlebachHJMW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HoffmannEKMR08,
author = {Michael Hoffmann and
Thomas Erlebach and
Danny Krizanc and
Mat{\'{u}}s Mihal{\'{a}}k and
Rajeev Raman},
editor = {Susanne Albers and
Pascal Weil},
title = {Computing Minimum Spanning Trees with Uncertainty},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {277--288},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1358},
doi = {10.4230/LIPICS.STACS.2008.1358},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HoffmannEKMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Erlebach08,
author = {Thomas Erlebach},
editor = {Berthold V{\"{o}}cking and
Helmut Alt and
Martin Dietzfelbinger and
R{\"{u}}diger Reischuk and
Christian Scheideler and
Heribert Vollmer and
Dorothea Wagner},
title = {Mehrheitsbestimmung - Wer wird Klassensprecher?},
booktitle = {Taschenbuch der Algorithmen},
series = {eXamen.press},
pages = {245--254},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-76394-9\_24},
doi = {10.1007/978-3-540-76394-9\_24},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Erlebach08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2008,
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3},
doi = {10.1007/978-3-540-92248-3},
isbn = {978-3-540-92247-6},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2854,
author = {Thomas Erlebach and
Torben Hagerup and
Klaus Jansen and
Moritz Minzlaff and
Alexander Wolff},
title = {Trimming of Graphs, with Application to Point Labeling},
journal = {CoRR},
volume = {abs/0802.2854},
year = {2008},
url = {http://arxiv.org/abs/0802.2854},
eprinttype = {arXiv},
eprint = {0802.2854},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2855,
author = {Thomas Erlebach and
Michael Hoffmann and
Danny Krizanc and
Mat{\'{u}}s Mihal{\'{a}}k and
Rajeev Raman},
title = {Computing Minimum Spanning Trees with Uncertainty},
journal = {CoRR},
volume = {abs/0802.2855},
year = {2008},
url = {http://arxiv.org/abs/0802.2855},
eprinttype = {arXiv},
eprint = {0802.2855},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2855.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AdamyAAE07,
author = {Udo Adamy and
Christoph Amb{\"{u}}hl and
R. Sai Anand and
Thomas Erlebach},
title = {Call Control in Rings},
journal = {Algorithmica},
volume = {47},
number = {3},
pages = {217--238},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-0187-4},
doi = {10.1007/S00453-006-0187-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AdamyAAE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ErlebachJMNSW07,
author = {Thomas Erlebach and
Riko Jacob and
Mat{\'{u}}s Mihal{\'{a}}k and
Marc Nunkesser and
G{\'{a}}bor Szab{\'{o}} and
Peter Widmayer},
title = {An Algorithmic View on {OVSF} Code Assignment},
journal = {Algorithmica},
volume = {47},
number = {3},
pages = {269--298},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-0188-3},
doi = {10.1007/S00453-006-0188-3},
timestamp = {Thu, 26 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachJMNSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/ErlebachHPV07,
author = {Thomas Erlebach and
Alexander Hall and
Alessandro Panconesi and
Danica Vukadinovic},
title = {Cuts and Disjoint Paths in the Valley-Free Model},
journal = {Internet Math.},
volume = {3},
number = {3},
pages = {333--359},
year = {2007},
url = {https://doi.org/10.1080/15427951.2006.10129126},
doi = {10.1080/15427951.2006.10129126},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/ErlebachHPV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Erlebach07,
author = {Thomas Erlebach},
title = {Tim Roughgarden, Selfish Routing and the Price of Anarchy, {MIT} Press,
Cambridge, {MA} {(2005)} {ISBN} 0-262-18243-2, pp 196},
journal = {Oper. Res. Lett.},
volume = {35},
number = {3},
pages = {418--419},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2006.06.001},
doi = {10.1016/J.ORL.2006.06.001},
timestamp = {Thu, 06 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Erlebach07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/BattistaEHPPS07,
author = {Giuseppe Di Battista and
Thomas Erlebach and
Alexander Hall and
Maurizio Patrignani and
Maurizio Pizzonia and
Thomas Schank},
title = {Computing the types of the relationships between autonomous systems},
journal = {{IEEE/ACM} Trans. Netw.},
volume = {15},
number = {2},
pages = {267--280},
year = {2007},
url = {http://doi.acm.org/10.1145/1279660.1279662},
doi = {10.1145/1279660.1279662},
timestamp = {Tue, 23 Oct 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ton/BattistaEHPPS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/escape/EpsteinEL07,
author = {Leah Epstein and
Thomas Erlebach and
Asaf Levin},
editor = {Bo Chen and
Mike Paterson and
Guochuan Zhang},
title = {Online Capacitated Interval Coloring},
booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
First International Symposium, {ESCAPE} 2007, Hangzhou, China, April
7-9, 2007, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4614},
pages = {243--254},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74450-4\_22},
doi = {10.1007/978-3-540-74450-4\_22},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/escape/EpsteinEL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/saga/ErlebachHM07,
author = {Thomas Erlebach and
Alexander Hall and
Mat{\'{u}}s Mihal{\'{a}}k},
editor = {Juraj Hromkovic and
Richard Kr{\'{a}}lovic and
Marc Nunkesser and
Peter Widmayer},
title = {Approximate Discovery of Random Graphs},
booktitle = {Stochastic Algorithms: Foundations and Applications, 4th International
Symposium, {SAGA} 2007, Zurich, Switzerland, September 13-14, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4665},
pages = {82--92},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74871-7\_8},
doi = {10.1007/978-3-540-74871-7\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/saga/ErlebachHM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErlebachV06,
author = {Thomas Erlebach and
Danica Vukadinovic},
title = {Path problems in generalized stars, complete graphs, and brick wall
graphs},
journal = {Discret. Appl. Math.},
volume = {154},
number = {4},
pages = {673--683},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.05.017},
doi = {10.1016/J.DAM.2005.05.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErlebachV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/BeerliovaEEHHMR06,
author = {Zuzana Beerliova and
Felix Eberhard and
Thomas Erlebach and
Alexander Hall and
Michael Hoffmann and
Mat{\'{u}}s Mihal{\'{a}}k and
L. Shankar Ram},
title = {Network Discovery and Verification},
journal = {{IEEE} J. Sel. Areas Commun.},
volume = {24},
number = {12},
pages = {2168--2181},
year = {2006},
url = {https://doi.org/10.1109/JSAC.2006.884015},
doi = {10.1109/JSAC.2006.884015},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsac/BeerliovaEEHHMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AmbuhlEMN06,
author = {Christoph Amb{\"{u}}hl and
Thomas Erlebach and
Mat{\'{u}}s Mihal{\'{a}}k and
Marc Nunkesser},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Constant-Factor Approximation for Minimum-Weight (Connected) Dominating
Sets in Unit Disk Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {3--14},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_3},
doi = {10.1007/11830924\_3},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AmbuhlEMN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ErlebachHHM06,
author = {Thomas Erlebach and
Alexander Hall and
Michael Hoffmann and
Mat{\'{u}}s Mihal{\'{a}}k},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {Network Discovery and Verification with Distance Queries},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {69--80},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_10},
doi = {10.1007/11758471\_10},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ErlebachHHM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/comsware/AnandE06,
author = {R. Sai Anand and
Thomas Erlebach},
editor = {Victor Bahl and
Bijendra Nath Jain and
Henning Schulzrinne and
Alfred Z. Spector},
title = {Call control on lines},
booktitle = {Proceedings of the First International Conference on COMmunication
System softWAre and MiddlewaRE {(COMSWARE} 2006), January 8-12, 2006,
New Delhi, India},
pages = {1--6},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/COMSWA.2006.1665178},
doi = {10.1109/COMSWA.2006.1665178},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/comsware/AnandE06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dics/ErlebachHMPSV06,
author = {Thomas Erlebach and
Alexander Hall and
Linda S. Moonen and
Alessandro Panconesi and
Frits C. R. Spieksma and
Danica Vukadinovic},
editor = {J{\"{u}}rg Kohlas and
Bertrand Meyer and
Andr{\'{e}} Schiper},
title = {Robustness of the Internet at the Topology and Routing Level},
booktitle = {Dependable Systems: Software, Computing, Networks, Research Results
of the {DICS} Program},
series = {Lecture Notes in Computer Science},
volume = {4028},
pages = {260--274},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11808107\_12},
doi = {10.1007/11808107\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dics/ErlebachHMPSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaierEHKSS06,
author = {Georg Baier and
Thomas Erlebach and
Alexander Hall and
Ekkehard K{\"{o}}hler and
Heiko Schilling and
Martin Skutella},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Length-Bounded Cuts and Flows},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {679--690},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_59},
doi = {10.1007/11786986\_59},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaierEHKSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/EpsteinEL06,
author = {Leah Epstein and
Thomas Erlebach and
Asaf Levin},
editor = {Lars Arge and
Rusins Freivalds},
title = {Variable Sized Online Interval Coloring with Bandwidth},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {29--40},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_6},
doi = {10.1007/11785293\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/EpsteinEL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/lncs/Erlebach06,
author = {Thomas Erlebach},
editor = {Evripidis Bampis and
Klaus Jansen and
Claire Kenyon},
title = {Approximation Algorithms for Edge-Disjoint Paths and Unsplittable
Flow},
booktitle = {Efficient Approximation and Online Algorithms - Recent Progress on
Classical Combinatorial Optimization Problems and New Applications},
series = {Lecture Notes in Computer Science},
volume = {3484},
pages = {97--134},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671541\_4},
doi = {10.1007/11671541\_4},
timestamp = {Thu, 23 Sep 2021 11:45:21 +0200},
biburl = {https://dblp.org/rec/series/lncs/Erlebach06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/lncs/ErlebachF06,
author = {Thomas Erlebach and
Jir{\'{\i}} Fiala},
editor = {Evripidis Bampis and
Klaus Jansen and
Claire Kenyon},
title = {Independence and Coloring Problems on Intersection Graphs of Disks},
booktitle = {Efficient Approximation and Online Algorithms - Recent Progress on
Classical Combinatorial Optimization Problems and New Applications},
series = {Lecture Notes in Computer Science},
volume = {3484},
pages = {135--155},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671541\_5},
doi = {10.1007/11671541\_5},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/lncs/ErlebachF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/caan/2006,
editor = {Thomas Erlebach},
title = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop,
{CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4235},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11922377},
doi = {10.1007/11922377},
isbn = {3-540-48822-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/caan/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2006,
editor = {Yossi Azar and
Thomas Erlebach},
title = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036},
doi = {10.1007/11841036},
isbn = {3-540-38875-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2005,
editor = {Thomas Erlebach and
Giuseppe Persiano},
title = {Approximation and Online Algorithms, Third International Workshop,
{WAOA} 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {3879},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671411},
doi = {10.1007/11671411},
isbn = {3-540-32207-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2006,
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125},
doi = {10.1007/11970125},
isbn = {3-540-69513-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ErlebachS05,
author = {Thomas Erlebach and
Stamatis Stefanakos},
title = {Wavelength Conversion in All-Optical Networks with Shortest-Path Routing},
journal = {Algorithmica},
volume = {43},
number = {1-2},
pages = {43--61},
year = {2005},
url = {https://doi.org/10.1007/s00453-005-1157-y},
doi = {10.1007/S00453-005-1157-Y},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErlebachJ05,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Conversion of coloring algorithms into maximum weight independent
set algorithms},
journal = {Discret. Appl. Math.},
volume = {148},
number = {1},
pages = {107--125},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.11.007},
doi = {10.1016/J.DAM.2004.11.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErlebachJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ErlebachJS05,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
title = {Polynomial-Time Approximation Schemes for Geometric Intersection Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1302--1323},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402676},
doi = {10.1137/S0097539702402676},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ErlebachJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BeerliovaEEHHMR05,
author = {Zuzana Beerliova and
Felix Eberhard and
Thomas Erlebach and
Alexander Hall and
Michael Hoffmann and
Mat{\'{u}}s Mihal{\'{a}}k and
L. Shankar Ram},
editor = {Dieter Kratsch},
title = {Network Discovery and Verification},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {127--138},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_12},
doi = {10.1007/11604686\_12},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BeerliovaEEHHMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004na,
editor = {Ulrik Brandes and
Thomas Erlebach},
title = {Network Analysis: Methodological Foundations [outcome of a Dagstuhl
seminar, 13-16 April 2004]},
series = {Lecture Notes in Computer Science},
volume = {3418},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/b106453},
doi = {10.1007/B106453},
isbn = {3-540-24979-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2004na.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BeerliovaEEHHMR05,
author = {Zuzana Beerliova and
Felix Eberhard and
Thomas Erlebach and
Alexander Hall and
Michael Hoffmann and
Mat{\'{u}}s Mihal{\'{a}}k and
L. Shankar Ram},
editor = {Susanne Albers and
Rolf H. M{\"{o}}hring and
Georg Ch. Pflug and
R{\"{u}}diger Schultz},
title = {Network Discovery and Verification},
booktitle = {Algorithms for Optimization with Incomplete Information, 16.-21. January
2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05031},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/59},
timestamp = {Thu, 10 Jun 2021 13:02:06 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BeerliovaEEHHMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CieliebakELSW04,
author = {Mark Cieliebak and
Thomas Erlebach and
Zsuzsanna Lipt{\'{a}}k and
Jens Stoye and
Emo Welzl},
title = {Algorithmic complexity of protein identification: combinatorics of
weighted strings},
journal = {Discret. Appl. Math.},
volume = {137},
number = {1},
pages = {27--46},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00187-2},
doi = {10.1016/S0166-218X(03)00187-2},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CieliebakELSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ErlebachH04,
author = {Thomas Erlebach and
Alexander Hall},
title = {NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source
Unsplittable Min-Cost Flow},
journal = {J. Sched.},
volume = {7},
number = {3},
pages = {223--241},
year = {2004},
url = {https://doi.org/10.1023/B:JOSH.0000019682.75022.96},
doi = {10.1023/B:JOSH.0000019682.75022.96},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/ErlebachH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/MiyazawaE04,
author = {Hiroyuki Miyazawa and
Thomas Erlebach},
title = {An Improved Randomized On-Line Algorithm for a Weighted Interval Selection
Problem},
journal = {J. Sched.},
volume = {7},
number = {4},
pages = {293--311},
year = {2004},
url = {https://doi.org/10.1023/B:JOSH.0000031423.39762.d3},
doi = {10.1023/B:JOSH.0000031423.39762.D3},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/MiyazawaE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/ErlebachHPV04,
author = {Thomas Erlebach and
Alexander Hall and
Alessandro Panconesi and
Danica Vukadinovic},
editor = {Alejandro L{\'{o}}pez{-}Ortiz and
Ang{\`{e}}le M. Hamel},
title = {Cuts and Disjoint Paths in the Valley-Free Path Model of Internet
{BGP} Routing},
booktitle = {Combinatorial and Algorithmic Aspects of Networking, First Workshop
on Combinatorial and Algorithmic Aspects of Networking, {CAAN} 2004,
Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3405},
pages = {49--62},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11527954\_6},
doi = {10.1007/11527954\_6},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/caan/ErlebachHPV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BrandesE04,
author = {Ulrik Brandes and
Thomas Erlebach},
editor = {Ulrik Brandes and
Thomas Erlebach},
title = {Introduction},
booktitle = {Network Analysis: Methodological Foundations [outcome of a Dagstuhl
seminar, 13-16 April 2004]},
series = {Lecture Notes in Computer Science},
volume = {3418},
pages = {1--6},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31955-9\_1},
doi = {10.1007/978-3-540-31955-9\_1},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BrandesE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BrandesE04a,
author = {Ulrik Brandes and
Thomas Erlebach},
editor = {Ulrik Brandes and
Thomas Erlebach},
title = {Fundamentals},
booktitle = {Network Analysis: Methodological Foundations [outcome of a Dagstuhl
seminar, 13-16 April 2004]},
series = {Lecture Notes in Computer Science},
volume = {3418},
pages = {7--15},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31955-9\_2},
doi = {10.1007/978-3-540-31955-9\_2},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BrandesE04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/CieliebakEHWW04,
author = {Mark Cieliebak and
Thomas Erlebach and
Fabian Hennecke and
Birgitta Weber and
Peter Widmayer},
editor = {Jean{-}Jacques L{\'{e}}vy and
Ernst W. Mayr and
John C. Mitchell},
title = {Scheduling with Release Times and Deadlines on a Minimum Number of
Machines},
booktitle = {Exploring New Frontiers of Theoretical Informatics, {IFIP} 18th World
Computer Congress, {TC1} 3rd International Conference on Theoretical
Computer Science (TCS2004), 22-27 August 2004, Toulouse, France},
series = {{IFIP}},
volume = {155},
pages = {209--222},
publisher = {Kluwer/Springer},
year = {2004},
url = {https://doi.org/10.1007/1-4020-8141-3\_18},
doi = {10.1007/1-4020-8141-3\_18},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/CieliebakEHWW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/ErlebachR04,
author = {Thomas Erlebach and
Maurice R{\"{u}}egg},
title = {Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing},
booktitle = {Proceedings {IEEE} {INFOCOM} 2004, The 23rd Annual Joint Conference
of the {IEEE} Computer and Communications Societies, Hong Kong, China,
March 7-11, 2004},
pages = {2275--2282},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/INFCOM.2004.1354650},
doi = {10.1109/INFCOM.2004.1354650},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/ErlebachR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iscc/StefanakosE04,
author = {Stamatis Stefanakos and
Thomas Erlebach},
title = {Routing in all-optical ring networks revisited},
booktitle = {Proceedings of the 9th {IEEE} Symposium on Computers and Communications
{(ISCC} 2006), June 28 - July 1, 2004, Alexandria, Egypt},
pages = {288--293},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/ISCC.2004.1358419},
doi = {10.1109/ISCC.2004.1358419},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iscc/StefanakosE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ErlebachJMNSW04,
author = {Thomas Erlebach and
Riko Jacob and
Mat{\'{u}}s Mihal{\'{a}}k and
Marc Nunkesser and
G{\'{a}}bor Szab{\'{o}} and
Peter Widmayer},
editor = {Volker Diekert and
Michel Habib},
title = {An Algorithmic View on {OVSF} Code Assignment},
booktitle = {{STACS} 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2996},
pages = {270--281},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24749-4\_24},
doi = {10.1007/978-3-540-24749-4\_24},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ErlebachJMNSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AdamyEMSSW04,
author = {Udo Adamy and
Thomas Erlebach and
Dieter Mitsche and
Ingo Schurr and
Bettina Speckmann and
Emo Welzl},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Off-line Admission Control for Advance Reservations in Star Networks},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {211--224},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_18},
doi = {10.1007/978-3-540-31833-0\_18},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AdamyEMSSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ErlebachJMNSW04,
author = {Thomas Erlebach and
Riko Jacob and
Mat{\'{u}}s Mihal{\'{a}}k and
Marc Nunkesser and
G{\'{a}}bor Szab{\'{o}} and
Peter Widmayer},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Joint Base Station Scheduling},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {225--238},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_19},
doi = {10.1007/978-3-540-31833-0\_19},
timestamp = {Thu, 26 Apr 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ErlebachJMNSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ErlebachS03,
author = {Thomas Erlebach and
Frits C. R. Spieksma},
title = {Interval selection: Applications, algorithms, and lower bounds},
journal = {J. Algorithms},
volume = {46},
number = {1},
pages = {27--53},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(02)00291-2},
doi = {10.1016/S0196-6774(02)00291-2},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ErlebachS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AnandEHS03,
author = {R. Sai Anand and
Thomas Erlebach and
Alexander Hall and
Stamatis Stefanakos},
title = {Call control with \emph{k} rejections},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {4},
pages = {707--722},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00076-X},
doi = {10.1016/S0022-0000(03)00076-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AnandEHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ErlebachS03,
author = {Thomas Erlebach and
Stamatis Stefanakos},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Wavelength Conversion in Shortest-Path All-Optical Networks},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {595--604},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_61},
doi = {10.1007/978-3-540-24587-2\_61},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ErlebachS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ErlebachS03,
author = {Thomas Erlebach and
Stamatis Stefanakos},
editor = {Helmut Alt and
Michel Habib},
title = {On Shortest-Path All-Optical Networks without Wavelength Conversion
Requirements},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {133--144},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_13},
doi = {10.1007/3-540-36494-3\_13},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ErlebachS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AnandE03,
author = {R. Sai Anand and
Thomas Erlebach},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Michiel H. M. Smid},
title = {Routing and Call Control Algorithms for Ring Networks},
booktitle = {Algorithms and Data Structures, 8th International Workshop, {WADS}
2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2748},
pages = {186--197},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45078-8\_17},
doi = {10.1007/978-3-540-45078-8\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AnandE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AdamyE03,
author = {Udo Adamy and
Thomas Erlebach},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Online Coloring of Intervals with Bandwidth},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {1--12},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_1},
doi = {10.1007/978-3-540-24592-6\_1},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/AdamyE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ErlebachKM03,
author = {Thomas Erlebach and
Vanessa K{\"{a}}{\"{a}}b and
Rolf H. M{\"{o}}hring},
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Scheduling AND/OR-Networks on Identical Parallel Machines},
booktitle = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
pages = {123--136},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24592-6\_10},
doi = {10.1007/978-3-540-24592-6\_10},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ErlebachKM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/CarmiEO03,
author = {Paz Carmi and
Thomas Erlebach and
Yoshio Okamoto},
editor = {Hans L. Bodlaender},
title = {Greedy Edge-Disjoint Paths in Complete Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {143--155},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_13},
doi = {10.1007/978-3-540-39890-5\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/CarmiEO03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ErlebachPPS03,
author = {Thomas Erlebach and
Aris Pagourtzis and
Katerina Potika and
Stamatis Stefanakos},
editor = {Hans L. Bodlaender},
title = {Resource Allocation Problems in Multifiber {WDM} Tree Networks},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {218--229},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_19},
doi = {10.1007/978-3-540-39890-5\_19},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/ErlebachPPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ErlebachH02,
author = {Thomas Erlebach and
Torben Hagerup},
title = {Routing Flow Through a Strongly Connected Graph},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {467--473},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0082-y},
doi = {10.1007/S00453-001-0082-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ErlebachH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccr/VukadinovicEHRS02,
author = {Danica Vukadinovic and
Thomas Erlebach and
Polly Huang and
Maurice R{\"{u}}egg and
Roman Schilter},
title = {Real and generated internet {AS} topologies: structure, spectrum,
robustness},
journal = {Comput. Commun. Rev.},
volume = {32},
number = {3},
pages = {13},
year = {2002},
url = {https://doi.org/10.1145/571697.571702},
doi = {10.1145/571697.571702},
timestamp = {Sun, 06 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccr/VukadinovicEHRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ErlebachF02,
author = {Thomas Erlebach and
Jir{\'{\i}} Fiala},
title = {On-line coloring of geometric intersection graphs},
journal = {Comput. Geom.},
volume = {23},
number = {2},
pages = {243--255},
year = {2002},
url = {https://doi.org/10.1016/S0925-7721(02)00089-5},
doi = {10.1016/S0925-7721(02)00089-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ErlebachF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ErlebachJ02,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Implementation of Approximation Algorithms for Weighted and Unweighted
Edge-Disjoint Paths in Bidirected Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {6},
year = {2002},
url = {https://doi.org/10.1145/944618.944624},
doi = {10.1145/944618.944624},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ErlebachJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mansci/ErlebachKP02,
author = {Thomas Erlebach and
Hans Kellerer and
Ulrich Pferschy},
title = {Approximating Multiobjective Knapsack Problems},
journal = {Manag. Sci.},
volume = {48},
number = {12},
pages = {1603--1612},
year = {2002},
url = {https://doi.org/10.1287/mnsc.48.12.1603.445},
doi = {10.1287/MNSC.48.12.1603.445},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mansci/ErlebachKP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dac/ChakrabortyEKT02,
author = {Samarjit Chakraborty and
Thomas Erlebach and
Simon K{\"{u}}nzli and
Lothar Thiele},
title = {Schedulability of event-driven code blocks in real-time embedded systems},
booktitle = {Proceedings of the 39th Design Automation Conference, {DAC} 2002,
New Orleans, LA, USA, June 10-14, 2002},
pages = {616--621},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/513918.514075},
doi = {10.1145/513918.514075},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dac/ChakrabortyEKT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AdamyAAE02,
author = {Udo Adamy and
Christoph Amb{\"{u}}hl and
R. Sai Anand and
Thomas Erlebach},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Call Control in Rings},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {788--799},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_67},
doi = {10.1007/3-540-45465-9\_67},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AdamyAAE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/CieliebakELSW02,
author = {Mark Cieliebak and
Thomas Erlebach and
Zsuzsanna Lipt{\'{a}}k and
Jens Stoye and
Emo Welzl},
editor = {Ricardo A. Baeza{-}Yates and
Ugo Montanari and
Nicola Santoro},
title = {Algorithmic Complexity of Protein Identification: Searching in Weighted
Strings},
booktitle = {Foundations of Information Technology in the Era of Networking and
Mobile Computing, {IFIP} 17\({}^{\mbox{th}}\) World Computer Congress
- {TC1} Stream / 2\({}^{\mbox{nd}}\) {IFIP} International Conference
on Theoretical Computer Science {(TCS} 2002), August 25-30, 2002,
Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
series = {{IFIP} Conference Proceedings},
volume = {223},
pages = {143--156},
publisher = {Kluwer},
year = {2002},
url = {https://doi.org/10.1007/978-0-387-35608-2\_13},
doi = {10.1007/978-0-387-35608-2\_13},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/CieliebakELSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iics/VukadinovicHE02,
author = {Danica Vukadinovic and
Polly Huang and
Thomas Erlebach},
editor = {Herwig Unger and
Thomas B{\"{o}}hme and
Armin R. Mikler},
title = {On the Spectrum and Structure of Internet Topology Graphs},
booktitle = {Innovative Internet Computing Systems, Second International Workshop,
{IICS} 2002, K{\"{u}}hlungsborn, Germany, June 20-22, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2346},
pages = {83--95},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-48080-3\_8},
doi = {10.1007/3-540-48080-3\_8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iics/VukadinovicHE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/AnandE02,
author = {R. Sai Anand and
Thomas Erlebach},
editor = {Sergio Rajsbaum},
title = {On-line Algorithms for Edge-Disjoint Paths in Trees of Rings},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {584--597},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_50},
doi = {10.1007/3-540-45995-2\_50},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/AnandE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ErlebachH02,
author = {Thomas Erlebach and
Alexander Hall},
editor = {David Eppstein},
title = {NP-hardness of broadcast scheduling and inapproximability of single-source
unsplittable min-cost flow},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {194--202},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545405},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ErlebachH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AnandEHS02,
author = {R. Sai Anand and
Thomas Erlebach and
Alexander Hall and
Stamatis Stefanakos},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Call Control with k Rejections},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {308--317},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_32},
doi = {10.1007/3-540-45471-3\_32},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AnandEHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ErlebachJ01,
author = {Thomas Erlebach and
Klaus Jansen},
title = {The Maximum Edge-Disjoint Paths Problem in Bidirected Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {3},
pages = {326--355},
year = {2001},
url = {https://doi.org/10.1137/S0895480199361259},
doi = {10.1137/S0895480199361259},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ErlebachJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachJ01,
author = {Thomas Erlebach and
Klaus Jansen},
title = {The complexity of path coloring and call scheduling},
journal = {Theor. Comput. Sci.},
volume = {255},
number = {1-2},
pages = {33--50},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00152-8},
doi = {10.1016/S0304-3975(99)00152-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErlebachJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachRSSZ01,
author = {Thomas Erlebach and
Peter Rossmanith and
Hans Stadtherr and
Angelika Steger and
Thomas Zeugmann},
title = {Learning one-variable pattern languages very efficiently on average,
in parallel, and by asking queries},
journal = {Theor. Comput. Sci.},
volume = {261},
number = {1},
pages = {119--156},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00136-5},
doi = {10.1016/S0304-3975(00)00136-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErlebachRSSZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ErlebachV01,
author = {Thomas Erlebach and
Danica Vukadinovic},
editor = {Rusins Freivalds},
title = {New Results for Path Problems in Generalized Stars, Complete Graphs,
and Brick Wall Graphs},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {483--494},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_55},
doi = {10.1007/3-540-44669-9\_55},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/ErlebachV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ErlebachGHNPPSSTW01,
author = {Thomas Erlebach and
Martin Gantenbein and
Daniel H{\"{u}}rlimann and
Gabriele Neyer and
Aris Pagourtzis and
Paolo Penna and
Konrad Schlude and
Kathleen Steinh{\"{o}}fel and
David Scot Taylor and
Peter Widmayer},
editor = {Peter Eades and
Tadao Takaoka},
title = {On the Complexity of Train Assignment Problems},
booktitle = {Algorithms and Computation, 12th International Symposium, {ISAAC}
2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {390--402},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45678-3\_34},
doi = {10.1007/3-540-45678-3\_34},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ErlebachGHNPPSSTW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Erlebach01,
author = {Thomas Erlebach},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Approximation Algorithms and Complexity Results for Path Problems
in Trees of Rings},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {351--362},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_31},
doi = {10.1007/3-540-44683-4\_31},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Erlebach01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ErlebachJS01,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
editor = {S. Rao Kosaraju},
title = {Polynomial-time approximation schemes for geometric graphs},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {671--679},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365562},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ErlebachJS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChakrabortyET01,
author = {Samarjit Chakraborty and
Thomas Erlebach and
Lothar Thiele},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {On the Complexity of Scheduling Conditional Real-Time Code},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {38--49},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_5},
doi = {10.1007/3-540-44634-6\_5},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/ChakrabortyET01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ErlebachKP01,
author = {Thomas Erlebach and
Hans Kellerer and
Ulrich Pferschy},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Approximating Multi-objective Knapsack Problems},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {210--221},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_20},
doi = {10.1007/3-540-44634-6\_20},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/ErlebachKP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/BischofEE00,
author = {Stefan Bischof and
Ralf Ebner and
Thomas Erlebach},
title = {Parallel Load Balancing for Problems with Good Bisectors},
journal = {J. Parallel Distributed Comput.},
volume = {60},
number = {9},
pages = {1047--1073},
year = {2000},
url = {https://doi.org/10.1006/jpdc.2000.1647},
doi = {10.1006/JPDC.2000.1647},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/BischofEE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ErlebachJ00,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Jos{\'{e}} D. P. Rolim and
Andrei Z. Broder and
Andrea Corradini and
Roberto Gorrieri and
Reiko Heckel and
Juraj Hromkovic and
Ugo Vaccaro and
J. B. Wells},
title = {Conversion of Coloring Algorithms into Maximum Weight Independent
Set Algorithms},
booktitle = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the
27th International Colloquium on Automata, Languages and Programming,
Geneva, Switzerland, July 9-15, 2000},
pages = {135--146},
publisher = {Carleton Scientific, Waterloo, Ontario, Canada},
year = {2000},
timestamp = {Sat, 04 Apr 2020 17:15:23 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ErlebachJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ErlebachS00,
author = {Thomas Erlebach and
Frits C. R. Spieksma},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {Simple Algorithms for a Weighted Interval Selection Problem},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {228--240},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_20},
doi = {10.1007/3-540-40996-3\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ErlebachS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/ErlebachJ00,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Stefan N{\"{a}}her and
Dorothea Wagner},
title = {Implementation of Approximation Algorithms for Weighted and Unweighted
Edge-Disjoint Paths in Bidirected Trees},
booktitle = {Algorithm Engineering, 4th International Workshop, {WAE} 2000, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1982},
pages = {195--206},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44691-5\_17},
doi = {10.1007/3-540-44691-5\_17},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/ErlebachJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Erlebach99,
author = {Thomas Erlebach},
title = {Scheduling connections in fast networks},
school = {Technical University Munich, Germany},
year = {1999},
url = {http://tumb1.biblio.tu-muenchen.de/publ/diss/in/1999/erlebach.pdf},
urn = {urn:nbn:de:bvb:91-diss1999050616424},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Erlebach99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ErlebachJ99,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Efficient Implementation of an Optimal Greedy Algorithm for Wavelength
Assignment in Directed Tree Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {4},
year = {1999},
url = {https://doi.org/10.1145/347792.347808},
doi = {10.1145/347792.347808},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ErlebachJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachJKMP99,
author = {Thomas Erlebach and
Klaus Jansen and
Christos Kaklamanis and
Milena Mihail and
Pino Persiano},
title = {Optimal Wavelength Routing on Directed Fiber Trees},
journal = {Theor. Comput. Sci.},
volume = {221},
number = {1-2},
pages = {119--137},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(99)00029-8},
doi = {10.1016/S0304-3975(99)00029-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErlebachJKMP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/arcs/EbnerEGHW99,
author = {Ralf Ebner and
Thomas Erlebach and
Claudia Gold and
Clemens Harlfinger and
Roland Wism{\"{u}}ller},
editor = {Werner Erhard and
Karl{-}Erwin Gro{\ss}pietsch and
Wolfgang Koch and
Erik Maehle and
Eberhard Zehendner},
title = {A Framework for Recording and Visualizing Event Traces in Parallel
Systems with Load Balancing},
booktitle = {Workshops zur Architektur von Rechensystemen - Vortr{\"{a}}ge
Workshops im Rahmen der 15. GI/ITG-Fachtagung {ARCS} '99, 4.-7. Oktober
1999, Jena, Germany},
pages = {155--162},
publisher = {Universit{\"{a}}t Jena, Institut f{\"{u}}r Informatik},
year = {1999},
timestamp = {Tue, 19 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/arcs/EbnerEGHW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/BischofEE99,
author = {Stefan Bischof and
Ralf Ebner and
Thomas Erlebach},
title = {Parallel Load Balancing for Problems with Good Bisectors},
booktitle = {13th International Parallel Processing Symposium / 10th Symposium
on Parallel and Distributed Processing {(IPPS} / {SPDP} '99), 12-16
April 1999, San Juan, Puerto Rico, Proceedings},
pages = {531--538},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/IPPS.1999.760528},
doi = {10.1109/IPPS.1999.760528},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/BischofEE99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/BischofEE98,
author = {Stefan Bischof and
Ralf Ebner and
Thomas Erlebach},
editor = {David J. Pritchard and
Jeff Reeve},
title = {Load Balancing for Problems with Good Bisectors, and Applications
in Finite Element Simulations},
booktitle = {Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference,
Southampton, UK, September 1-4, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1470},
pages = {383--389},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0057878},
doi = {10.1007/BFB0057878},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/BischofEE98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ErlebachJ98,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Kyung{-}Yong Chwa and
Oscar H. Ibarra},
title = {Maximizing the Number of Connections in Optical Tree Networks},
booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
Taejon, Korea, December 14-16, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1533},
pages = {179--188},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49381-6\_20},
doi = {10.1007/3-540-49381-6\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ErlebachJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/ErlebachJ98,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Kurt Mehlhorn},
title = {Efficient Implementation of an Optimal Greedy Algorithm for Wavelength
Assignment in Directed Tree Networks},
booktitle = {Algorithm Engineering, 2nd International Workshop, {WAE} '92, Saarbr{\"{u}}cken,
Germany, August 20-22, 1998, Proceedings},
pages = {13--24},
publisher = {Max-Planck-Institut f{\"{u}}r Informatik},
year = {1998},
timestamp = {Mon, 10 May 2021 14:22:35 +0200},
biburl = {https://dblp.org/rec/conf/wae/ErlebachJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/ErlebachRSSZ97,
author = {Thomas Erlebach and
Peter Rossmanith and
Hans Stadtherr and
Angelika Steger and
Thomas Zeugmann},
editor = {Ming Li and
Akira Maruoka},
title = {Learning One-Variable Pattern Languages Very Efficiently on Average,
in Parallel, and by Asking Queries},
booktitle = {Algorithmic Learning Theory, 8th International Conference, {ALT} '97,
Sendai, Japan, October 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1316},
pages = {260--276},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63577-7\_48},
doi = {10.1007/3-540-63577-7\_48},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/ErlebachRSSZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/ErlebachJKP97,
author = {Thomas Erlebach and
Klaus Jansen and
Christos Kaklamanis and
Giuseppe Persiano},
editor = {Panos M. Pardalos and
Ding{-}Zhu Du},
title = {An optimal greedy algorithm for wavelength allocation in directed
tree networks},
booktitle = {Network Design: Connectivity and Facilities Location, Proceedings
of a {DIMACS} Workshop, Princetin, New Jersey, USA, April 28-30, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {40},
pages = {117--129},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/040/08},
doi = {10.1090/DIMACS/040/08},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/ErlebachJKP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hicss/ErlebachJ97,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Call Scheduling in Trees, Rings and Meshes},
booktitle = {30th Annual Hawaii International Conference on System Sciences (HICSS-30),
7-10 January 1997, Maui, Hawaii, {USA}},
pages = {221},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/HICSS.1997.667220},
doi = {10.1109/HICSS.1997.667220},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hicss/ErlebachJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KaklamanisPEJ97,
author = {Christos Kaklamanis and
Pino Persiano and
Thomas Erlebach and
Klaus Jansen},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Constrained Bipartite Edge Coloring with Applications to Wavelength
Routing},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {493--504},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_205},
doi = {10.1007/3-540-63165-8\_205},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KaklamanisPEJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ErlebachJ97,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Rolf H. M{\"{o}}hring},
title = {Off-Line and On-Line Call-Scheduling in Stars and Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
{WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {199--213},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024499},
doi = {10.1007/BFB0024499},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ErlebachJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI97-03,
author = {Thomas Erlebach and
Klaus Jansen},
title = {An Optimal Greedy Algorithm for Wavelength Allocation in Directed
Tree Networks},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {97-03},
year = {1997},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI97-03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI96-19,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Scheduling of Virtual Connections in Fast Networks},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {96-19},
year = {1996},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI96-19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:59 CEST 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:
