Presburger Award 2018

The 2018 Presburger Committee consisting of Monika Henzinger, Stephan Kreutzer (chair) and Jukka Suomela has completed its deliberations and unanimously selected Aleksander Mądry as recipient of the 2018 EATCS Presburger Award for young scientists.

Aleksander Mądry has made several groundbreaking contributions to the theory of algorithms which have firmly established him as a leader in his field. Some of his most notable work is on the maximum flow problem in graphs and digraphs. In a 2011 paper, he and his co-authors presented an approximation algorithm for maximum flows in graphs running in time what O(mn1=3). This already was the first algorithmic improvement to the problem for a very long time. But it was quickly followed by his 2013 paper where he presented an exact algorithm for the directed maximum flow problem which was the first ever to break the famous 1975 barrier of O(n3=2) by Evan and Tarjan, a barrier that withstood all attempts to break it for nearly 40 years.

Additional to his work for the maximum flow problem, his work also contributed to significant advances (or groundbreaking advances) for the k-server problem and the Asymmetric Travelling Salesman problem.

Aleksander’s results have been celebrated in the community not only because he broke long standing complexity barriers but moreover because he introduced new and very different techniques to the field which since have successfully been picked up by others.

Aleksander Mądry ’s work is of exceptional standard and visibility, establishing as a leading researcher in his field.

The Presburger Award carries a prize money of 1000 Euros and will be delivered at ICALP 2018, which will take place in Prague, Czech Republic from the 9th till the 13th of July 2018.

The 2018 Presburger Award Committee consisted of Monika Henzinger, Stephan Kreutzer (chair) and Jukka Suomela.

Laudatio your social media marketing partner
European Association for Theoretical Computer Science - Maintained and hosted by RU1 / CTI.