Travel Award
Dear Colleague,
As Editor-in-Chief of Algorithms, I am pleased to announce the winner of the 2019 Algorithms Travel Award on behalf of the Evaluation Committee:
The winner is Henry Förster, Ph.D. student at University of Tübingen, whose research interests concern theoretical aspects of Computer Science, focusing on algorithms and their complexity. He is planning to present his work “Planar Graphs of Bounded Degree Have Bounded Queue Number” at the 51st Annual ACM Symposium on the Theory of Computing, (STOC 2019), June 23 - 26, 2019, Phoenix, AZ. The award consists of 800 Swiss Francs towards attending this conference.
It was a difficult decision with such high quality applications for the award and we thank all applicants. We wish to congratulate Mr. Henry Förster for his accomplishments.