About the Authors
Matthias Englert
Matthias Englert
Department of Computer Science, DIMAP
University of Warwick, Coventry, UK
Matthias.Englert[ta]warwick[td]ac[td]uk
http://www.dcs.warwick.ac.uk/~englert
Matthias Englert is currently a postdoctoral fellow at the University of Warwick. He graduated, under the supervision of Matthias Westermann, from RWTH Aachen University in 2008. His thesis deals with the design and analysis of online algorithms and is titled “Online Scheduling for Buffering Problems.” His current topics of interest include online algorithms, metric embeddings, load balancing, probabilistic input models, and algorithmic game theory.
Harald Räcke
Harald Räcke
Department of Computer Science, DIMAP
University of Warwick, Coventry, UK
H[td]Raecke[ta]warwick[td]ac[td]uk
http://www.dcs.warwick.ac.uk/~harry
Harald Räcke graduated from Paderborn University in 2003 under the supervision of Friedhelm Meyer auf der Heide. Currently, he is Assistant Professor in the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. He shared the Best Paper award at FOCS 2002 and STOC 2008. His main interests include the design and analysis of routing and graph partitioning algorithms, the theory of metric embeddings, and algorithmic game theory.
Matthias Westermann
Matthias Westermann
Department of Computer Science
University of Bonn, Bonn, Germany
westermann[ta]cs[td]uni-bonn[td]de
http://www.i1.cs.uni-bonn.de/staff/marsu
Matthias Westermann received his Ph.D. at the University of Paderborn under the supervision of Friedhelm Meyer auf der Heide. After a postdoctoral year at the International Computer Science Institute in Berkeley, the German Research Foundation awarded him with a research grant for an independent junior research group at TU Dortmund and RWTH Aachen University. Currently, he is a visiting professor at the University of Bonn. Matthias is interested in the design and analysis of efficient algorithms, mostly online and approximation algorithms. Topics of interest include scheduling algorithms, Internet algorithms, distributed and parallel algorithms, and experimental evaluation.