Invitation to Award Ceremony of the ESA Test-of-Time Award 2016

On behalf of the Steering Committee of ESA and the Program Committee of ESA 2017, I would like to invite you to attend the ESA conference and the ESA Test-of-Time 2016 Award Ceremony. The ceremony will take place on the afternoon of 5th of September during ESA 2017 in Vienna and it will include the presentation by the awardees of the recognized paper.
Announcement of the ESA Test-of-Time Award 2016

European Symposium on Algorithms (ESA)

The ESA Test-of-Time Award (ESA ToTA) recognizes excellent papers in algorithms research that were published in the ESA proceedings 19-21 years ago and which are still influential and stimulating for the field today. In this second year in which the award is given, papers from ESA'95 to ESA'97 were considered.

The committee nominates the following paper for the ESA ToTA 2016. The paper stands out as a classic in the algorithms field and by its excellent citation
record still relevant today.

From ESA 95-97:

Boris V. Cherkassky, Andrew V. Goldberg
Negative-cycle detection algorithms
Proceedings ESA'96, also in: Mathematical Programming 85:2 (1999) 277-311

The paper by Cherkassky and Goldberg deals with the problem of finding a
negative-length cycle in a network or proving that there is none. Algorithms
for this are a combination of a shortest-path algorithm and a negative-cycle
detection strategy. The authors analyse known algorithms and some new ones
and determine the best combinations. Novel instance generators are used in
this study. The paper is a model experimental paper in algorithms.

ESA ToTA 2016 Award Committee:
Kurt Mehlhorn (Saarbrucken)
Mike Paterson (Warwick)
Jan van Leeuwen (Utrecht)

Workshop on Kernelization 2013

Last week we organized Workshop on Kernelization (WorKer 2013) in Warsaw. The programmee included

  • an update meeting on graph cut problems,
  • two tutorials (Matroid theory and kernelization by Saket Saurabh, Stefan Kratsch and Magnus Wahlström and Kernel-size lower bounds: the evidence from complexity theory by Andrew Drucker),
  • two invited talks on techniques used outside the kernelization area which might turn out useful in kernelization (on planar graphs by Piotr Sankowski and on spanners by Seth Pettie)
  • a few short contributed talks

We hope it was fun! Below you can see some pictures.



5th Workshop on Flexible Network Design

Last week we have hosted the 5th Workshop on Flexible Network Design. There have been a great number of interesting talks:, site and huge number of open problems. The open problems can be posted and discussed here:

Below there are some photos from the workshop.

Polish ICALP ;)

This was a rather interesting ICALP in Warwick. Actually, doctor some people called it Polish ICALP ;). There was a visible number of participants who were from Poland as well as the ones who graduated from our universities. This includes the main organizer Artur Czumaj. During the event we realized to be the only university that had a PC member in every track:

  • in Track A - Piotr Sankowski, cure
  • in Track B - Bartek Klin and Andrzej Tarlecki,
  • in Track C - Stefan Dziembowski.