Content deleted Content added
Added test of time award |
|||
| (5 intermediate revisions by 5 users not shown) | |||
Line 14:
The first ESA was held in 1993 and contained 35 papers. The intended scope was all research in algorithms, theoretical as well as applied, carried out in the fields of [[computer science]] and [[discrete mathematics]]. An explicit aim was to intensify the exchange between these two research communities.
===
In 2002, ESA incorporated the conference '''Workshop on Algorithms Engineering''' ('''WAE'''). In its current format, ESA contains two distinct tracks with their own programme committees: a track on the design an [[analysis of algorithms]], and a track on engineering and applications, together accepting around 70 contributions.
== ESA
=== ESA Test-of-Time Award ===
The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding papers in algorithms research that were published in the ESA proceedings
{| class="wikitable"
|+ESA Test-of-Time Award
Line 32 ⟶ 33:
|-
|2021
|Andrew Goldberg, Jason Hartline: Competitive Auctions for Multiple Digital Goods. In ESA 2001
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, and Russell Schwartz: SNPs Problems, Complexity, and Algorithms. In ESA 2001
Line 58 ⟶ 59:
|-
|2015
|[[Mechthild Stoer]], Frank Wagner: A Simple Min Cut Algorithm. In ESA 1994
Sudipto Guha, Samir Khuller: Approximation Algorithms for Connected Dominating Sets. In ESA 1996
|Jan van Leeuwen, Kurt Mehlhorn, Mike Paterson
|}
=== ESA Best Paper Awards ===
{| class="wikitable"
|+ESA Best Paper Awards
!Year
!Track A Best Paper
!Track B Best Paper
!Track A Best Student Paper
!Track B Best Student Paper
|-
|2022<ref>{{Cite web |title=Schedule – ALGO 2022 |url=https://algo-conference.org/2022/schedule/ |access-date=2023-08-29 |language=en-US}}</ref>
|Stefan Walzer:
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold (extended abstract)
|Chris Schwiegelshohn and Omar Ali Sheikh-Omar:
An Empirical Evaluation of k-Means Coresets
|Zoe Xi and William Kuszmaul:
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings
|Tim Zeitz and Nils Werner:
Combining Predicted and Live Traffic with Time-Dependent A* Potentials
|-
|2021
|Zhiyang He, Jason Li and Magnus Wahlström:
Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
|Simon D. Fink, Matthias Pfretzschner and Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees
|Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz and Marek Sokołowski:
Determining 4-edge-connected components in linear time
|Florian Wörz and Jan-Hendrik Lorenz:
Evidence for Long-Tails in SLS Algorithms
|-
|2020<ref>{{Cite web |title=ALGO 2020 - September 7-10, 2020 - Pisa, Italy |url=http://algo2020.di.unipi.it/programme.html |access-date=2023-08-29 |website=algo2020.di.unipi.it |language=en}}</ref>
|Moritz Venzin, Friedrich Eisenbrand:
Approximate $CVP_{\infty}$ in time $2^{0.802 n}$
|Georg Osang, Mael Rouxel-Labbé, Monique Teillaud:
Generalizing CGAL Periodic Delaunay Triangulations
|Hanrui Zhang:
Improved Prophet Inequalities for Combinatorial Welfare Maximization with (Approximately) Subadditive Agents
|
|-
|2019
|Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck and Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms
|Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck and Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
|Cornelius Brand:
Patching Colors with Tensors
|
|-
|2018<ref>{{Cite web |title=ESA 2018: Program |url=http://algo2018.hiit.fi/esa/program/ |access-date=2023-08-29 |website=algo2018.hiit.fi |language=en}}</ref>
|Jacob Holm, Giuseppe F. Italiano, Adam Karczmarz, Jakub Łącki, Eva Rotenberg:
Decremental SPQR-trees for Planar Graphs
|Daniel R. Schmidt, Bernd Zey, François Margot:
An Exact Algorithm for the Steiner Forest Problem
|Maximilian Probst:
On the Complexity of the (Approximate) Nearest Colored Node Problem
|Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions
|-
|2017<ref>{{Cite journal |last1=Pruhs |first1=Kirk |last2=Sohler |first2=Christian |date=2017 |editor-last=Pruhs |editor-first=Kirk |editor2-last=Sohler |editor2-first=Christian |title=Front Matter, Table of Contents, Preface, Programm Committees, External Reviewers |url=http://drops.dagstuhl.de/opus/volltexte/2017/7814 |journal=25th Annual European Symposium on Algorithms (ESA 2017) |series=Leibniz International Proceedings in Informatics (LIPIcs) |___location=Dagstuhl, Germany |publisher=Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik |volume=87 |pages=0:i–0:xx |doi=10.4230/LIPIcs.ESA.2017.0 |doi-access=free |isbn=978-3-95977-049-1}}</ref>
|Marek Cygan, Lukasz Kowalik and Arkadiusz Socala:
Improving TSP tours using dynamic programming over tree decompositions
|Hisao Tamaki:
Positive-instance driven dynamic programming for treewidth
|Marc Roth:
Counting restricted homomorphisms via Möbius inversion over matroid lattice
|
|-
|2016<ref>{{Cite journal |last1=Sankowski |first1=Piotr |last2=Zaroliagis |first2=Christos |date=2016 |editor-last=Sankowski |editor-first=Piotr |editor2-last=Zaroliagis |editor2-first=Christos |title=Front Matter, Table of Contents, Preface, Programm Committee, External Reviewers |url=http://drops.dagstuhl.de/opus/volltexte/2016/6342 |journal=24th Annual European Symposium on Algorithms (ESA 2016) |series=Leibniz International Proceedings in Informatics (LIPIcs) |___location=Dagstuhl, Germany |publisher=Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik |volume=57 |pages=0:i–0:xxiv |doi=10.4230/LIPIcs.ESA.2016.0 |doi-access=free |isbn=978-3-95977-015-6}}</ref>
|Stefan Kratsch:
A randomized polynomial kernelization for Vertex Cover with a smaller parameter
|Thomas Bläsius, Tobias Friedrich, Anton Krohmer and Sören Laue:
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
|Adam Kunysz:
The Strongly Stable Roommates Problem
|Michele Borassi and Emanuele Natale:
KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
|}
Since 2022, ESA also awards the best paper for the Simplicity Track:
* 2022. Alejandro Flores-Velazco: Improved Search of Relevant Points for Nearest-Neighbor Classification.
==ALGO conferences==
Since 2001, ESA is co-located with other algorithms conferences and workshops in a combined meeting called '''ALGO'''. This is the largest European event devoted to algorithms, attracting hundreds of researchers.
| |||