University of Leicester


photo of Thomas Erlebach

STAFF — Thomas Erlebach  Dipl.-Inform., Dr.rer.nat. (TU München), FBCS, FHEA

Professor of Computer Science
F20 Ken Edwards Building
School of Computing and Mathematical Sciences,
University of Leicester,
University Road,
LE1 7RH.

T: +44 (0)116 252 3411

New Address

I am leaving University of Leicester to join the Department of Computer Science at Durham University on 20th September 2021. My new e-mail address is firstname DOT surname AT durham DOT ac DOT uk

Open Door Policy

I am working from home. If you want to talk to me, please e-mail me.

Curriculum Vitae

  • You can find a brief CV here.


My research falls into the departmental research theme ACE (Algorithms: Complexity and Engineering). Some of my particular research interests are:

  • Algorithmic aspects of communication networks
  • Time-varying graphs and networks
  • Algorithms for wired and wireless networks
  • Computing with explorable uncertainty
  • Approximation and on-line algorithms for combinatorial optimization problems
  • Algorithmic graph theory


For details, please refer to my list of publications here. There is also a webpage with slides of a few talks I have given.


Past Projects

Program Committees

I was/am involved in the program committees of the following recent/upcoming conferences and workshops:

Older News

  • The following book has been published:
    Algorithms Unplugged

    B. Vöcking et al. (Eds.), Algorithms Unplugged, Springer, 2011.

    The book presents some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. (I wrote the chapter "Majority - Who Gets Elected Class Rep?".) The aim of the book is to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing.

  • Algorithm of the Week:
    Algorithmus der Woche This was an initiative of the Fakultätentag Informatik in Germany. For one whole year, a different algorithm was presented each week, in a manner accessible to high school students.
  • The work on the following book has been completed:

    U. Brandes and T. Erlebach (Eds.), Network Analysis - Methodological Foundations, LNCS Tutorial 3418, Springer Verlag, 2005.

    This book is the product of GINA (GI-Dagstuhl Seminar on Network Analysis).

    Thanks to all contributors!

Past Program Committees

I was a program committee member or co-organizer of the following workshops and conferences:

Some Past Events


I usually teach:

  • CO4219/CO7219: Internet and Cloud Computing
  • CO4200 CO7100/CO7200: Algorithms for Bioinformatics

Author: Thomas Erlebach (, T: +44 (0)116 252 3411.
© University of Leicester 20th August 2004. Last modified: 11th October 2021, 14:53:45
CMS Web Maintainer. Any opinions expressed on this page are those of the author.