European Symposium on Algorithms: Difference between revisions

Revision as of 05:42, 9 September 2023

Latest revision as of 22:23, 4 April 2025

(3 intermediate revisions by 3 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.

=== '''Workshop on Algorithms Engineering''' ===

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.

Line 20:

=== 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 19-2119–21 years ago and which are still influential and stimulating for the field today.<ref>{{Cite web |title=Test-of-Time Award – ESA |url=https://algo-conference.org/esa/test-of-time-award/ |access-date=2023-08-29 |language=en-US}}</ref> Because the [[#History|'''Workshop on Algorithms Engineering''' ('''WAE''')]] merged in with ESA, the Steering Committee decided that the papers from WAE 1999 to WAE 2001 were also to be considered.

{| class="wikitable"

|+ESA Test-of-Time Award

Line 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 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

Line 121:

Practical Access to Dynamic Programming on Tree Decompositions

|-

|2017<ref>{{Cite journal |lastlast1=Pruhs |firstfirst1=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 CommiteesCommittees, 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

Line 130:

|

|-

|2016<ref>{{Cite journal |lastlast1=Sankowski |firstfirst1=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 CommiteeCommittee, 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

Line 140:

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.