World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
32
Citations
5769
World Ranking
12992
National Ranking
828

Overview

Thomas Erlebach is affiliated with Durham University in the United Kingdom and has contributed extensively to the field of computer science, with a research focus on areas such as computer networks, computational theory, and operations research.

Their primary field of study is Computer Science, encompassing 64 publications. Within this domain, notable subfields include Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Industrial and Manufacturing Engineering, and Management Science and Operations Research.

Erlebach's research topics cover a variety of subjects. Key themes in their work include:

  • Optimization and Search Problems
  • Opportunistic and Delay-Tolerant Networks
  • Caching and Content Delivery
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Data Management and Algorithms

Their recent papers demonstrate a focus on graph theory, algorithms, and temporal networks. Selected works include:

  • On temporal graph exploration, 2021, Journal of Computer and System Sciences
  • On the fast delivery problem with one or two packages, 2020, Journal of Computer and System Sciences
  • A cop and robber game on edge-periodic temporal graphs, 2024, Journal of Computer and System Sciences
  • Classification and evaluation of the algorithms for vector bin packing, 2024, Computers & Operations Research
  • Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries, 2022, Algorithmica

Frequent coauthors in Erlebach's research include Jakob T. Spooner, Murilo Santos de Lima, Nicole Megow, Jens Schlöter, and Kleitos Papadopoulos.

The scientist often publishes in venues specializing in theoretical computer science and operations research. Frequent publication outlets include:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Journal of Computer and System Sciences
  • SSRN Electronic Journal
  • Algorithmica

In addition to journal and conference papers, Thomas Erlebach has authored a book titled Algorithmics of Wireless Networks, published by Springer Science+Business Media in 2022.

Best Publications

  • Network Analysis: Methodological Foundations

    Ulrik Brandes;Thomas Erlebach

  • Network Discovery and Verification

    Z. Beerliova;F. Eberhard;T. Erlebach;A. Hall

  • Network Analysis: Methodological Foundations (Lecture Notes in Computer Science)

    Ulrik Brandes;Thomas Erlebach

  • On temporal graph exploration

    Thomas Erlebach;Michael Hoffmann;Frank Kammer

  • Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

    Thomas Erlebach;Klaus Jansen;Eike Seidel

  • Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs

    Christoph Ambühl;Thomas Erlebach;Matúš Mihalák;Marc Nunkesser

  • NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow

    Thomas Erlebach;Alexander Hall

  • Polynomial-time approximation schemes for geometric graphs

    Thomas Erlebach;Klaus Jansen;Eike Seidel

  • Optimal bandwidth reservation in hose-model VPNs with multi-path routing

    T. Erlebach;M. Ruegg

  • Approximating Multiobjective Knapsack Problems

    Thomas Erlebach;Hans Kellerer;Ulrich Pferschy

  • The complexity of path coloring and call scheduling

    Thomas Erlebach;Klaus Jansen

  • Scheduling With Release Times and Deadlines on A Minimum Number of Machines

    Mark Cieliebak;Thomas Erlebach;Fabian Hennecke;Birgitta Weber

  • On the Spectrum and Structure of Internet Topology Graphs

    Danica Vukadinovic;Polly Huang;Thomas Erlebach

  • Computing the types of the relationships between autonomous systems

    Giuseppe Di Battista;Thomas Erlebach;Alexander Hall;Maurizio Patrignani

  • Call scheduling in trees, rings and meshes

    T. Erlebach;K. Jansen

  • Optimal wavelength routing on directed fiber trees

    Thomas Erlebach;Klaus Jansen;Christos Kaklamanis;Milena Mihail

  • Constrained Bipartite Edge Coloring with Applications to Wavelength Routing

    Christos Kaklamanis;Pino Persiano;Thomas Erlebach;Klaus Jansen

  • Interval selection: applications, algorithms, and lower bounds

    Thomas Erlebach;Frits C. R. Spieksma

  • On Temporal Graph Exploration

    Thomas Erlebach;Michael Hoffmann;Frank Kammer

  • NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow

    Thomas Erlebach;Alexander Hall

  • Length-bounded cuts and flows

    Georg Baier;Thomas Erlebach;Alexander Hall;Ekkehard Köhler

  • Length-Bounded Cuts and Flows

    Georg Baier;Thomas Erlebach;Alexander Hall;Ekkehard Kohler

  • Network Discovery and Verification

    Zuzana Beerliova;Felix Eberhard;Thomas Erlebach;Alexander Hall

Frequent Co-Authors

Klaus Jansen
Klaus Jansen Kiel University
Peter Widmayer
Peter Widmayer ETH Zurich
Frits C. R. Spieksma
Frits C. R. Spieksma Eindhoven University of Technology
Leah Epstein
Leah Epstein University of Haifa
Emo Welzl
Emo Welzl ETH Zurich
Torben Hagerup
Torben Hagerup University of Augsburg
Alessandro Panconesi
Alessandro Panconesi Sapienza University of Rome
Jens Stoye
Jens Stoye Bielefeld University
Giuseppe Di Battista
Giuseppe Di Battista Roma Tre University
Sotiris Nikoletseas
Sotiris Nikoletseas University of Patras

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA offers flexible opportunities through accredited online programs. Many students begin their journey with an online associate's degree to gain foundational skills and credits at a lower cost. This is a practical pathway for those seeking entry-level roles or planning to transfer to a four-year program.

For those aiming for advanced positions, pursuing graduate degrees that are worth it can lead to greater earning potential and specialized career tracks. Fields like AI, cybersecurity, and data science often require postgraduate qualifications for higher-level roles.

Affordability is crucial, and students can find options among the most affordable online colleges to minimize debt while obtaining a reputable degree. Many of these institutions cater to working professionals and nontraditional students.

Worried about academic history? Some of the best online colleges that accept low GPA welcome applicants seeking a second chance. These schools value potential and offer supportive learning environments, making a CS career more accessible for all backgrounds.

Best Scientists Citing Thomas Erlebach

Trending Scientists