About the Authors
Henning Bruhn
Mathematisches Seminar
Universität Hamburg, Germany
Henning Bruhn has been a postdoc at Universität Hamburg since summer 2006. In 2005 he obtained his Ph.D. under the supervision of Reinhard Diestel. He spent the following year in Grenoble learning combinatorial optimisation and French. He likes rock climbing and tries to learn Japanese.
Jakub Černý
Department of Applied Mathematics,
Faculty of Mathematics and Physics
Charles University, Czech Republic
Jakub Černý is finishing his Ph.D. at the Department of Applied Mathematics of Charles University in Prague. His advisor is Pavel Valtr. He is interested in computational and discrete geometry and efficient algorithms in general. His hobbies are aikido, improvisational comedy theatre, outdoor activities.
Alexander Hall
Google Switzerland GmbH
Zurich, Switzerland
Alexander Hall received a Master's degree (“Diplom”) in Computer Science at the Technische Universität München in 1998. In December 2003 he completed his doctoral studies in the group of Thomas Erlebach at the ETH Zürich and received a Ph.D. for his thesis “Scheduling and Flow-Related Problems in Networks.” After being a post-doc at ETH Zürich and UC Berkeley, he is now with Google in Zurich.
Petr Kolman
Department of Applied Mathematics
Faculty of Mathematics and Physics
Charles University, Czech Republic
Petr Kolman is an Assistant Professor at Charles University in Prague, Czech Republic. After obtaining his Ph.D., he spent a year at the Heinz Nixdorf Institut at the University of Paderborn, Germany and a year at the University of California, Riverside.
Jiří Sgall
Institute of Mathematics, AS ČR
Prague, Czech Republic
Jiří Sgall grew up in Prague, Czechoslovakia, where he received his RNDr. degree (equivalent of Master's) at Charles University under supervision of Antonín Sochor. Then he went to Carnegie Mellon University and received his Ph.D. under the supervision of Steven Rudich. After that he went back to Prague, Czech Republic, where he is now a senior researcher at the Institute of Mathematics of the Academy of Sciences of the Czech Republic. His main research interests are online and approximation algorithms for scheduling and other combinatorial problems. He also worked in communication complexity and proof complexity.