Jump to content

European Symposium on Algorithms: Difference between revisions

Edit links
From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
IWOLF (talk | contribs)
15 edits
No edit summary
Citation bot (talk | contribs)
Bots
5,402,853 edits
Add: doi-access, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 460/1051
 
(27 intermediate revisions by 20 users not shown)
Line 1: Line 1:
{{Short description|Annual conference series on algorithms}}
{{Infobox Academic Conference
{{Infobox Academic Conference
| history = 1993–
| history = 1993–present
| discipline = [[Algorithms]]
| discipline = [[Algorithms]]
| abbreviation = ESA
| abbreviation = ESA
| publisher = [[Springer Science+Business Media|Springer]] [[Lecture Notes in Computer Science|LNCS]]
| publisher = [[Springer Science+Business Media]]: [[Lecture Notes in Computer Science]]
| country= International
| country= International
| frequency = annual
| frequency = Annual
}}
}}


The '''European Symposium on Algorithms''' ('''ESA''') is an international conference covering the field of [[algorithms]]. It has been held annually since 1993, typically in a different European location in early Autumn. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in [[Springer Science+Business Media|Springer]] [[Lecture Notes in Computer Science]]. Acceptance rate of ESA is 24% in 2012 in both ''Design and Analysis'' and ''Engineering and Applications'' tracks.<ref>{{ cite web | url=http://www.springerlink.com/content/vvh2rq7353w0/front-matter.pdf | year=2012 | title=Algorithms – ESA 2012 (Lecture Notes in Computer Science) | accessdate=2012-09-17 }}</ref>
The '''European Symposium on Algorithms''' ('''ESA''') is an international conference covering the field of [[algorithms]]. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in [[Springer Science+Business Media|Springer]] [[Lecture Notes in Computer Science]]. Acceptance rate of ESA is 24% in 2012 in both ''Design and Analysis'' and ''Engineering and Applications'' tracks.<ref>{{ cite web | url=http://www.springerlink.com/content/vvh2rq7353w0/front-matter.pdf | year=2012 | title=Algorithms – ESA 2012 (Lecture Notes in Computer Science) | accessdate=2012-09-17 }}{{dead link|date=February 2020|bot=medic}}{{cbignore|bot=medic}}</ref>


==History==
==History==

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


==ALGO conferences==
== ESA Awards ==


=== ESA Test-of-Time Award ===
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.
The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding 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.<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
!Year
!Winners
!'''Award Committee'''
|-
|2022
|Marianne Durand, Philippe Flajolet: Loglog Counting of Large Cardinalities (Extended Abstract). In ESA 2003
Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms. In ESA 2003
|Edith Cohen, Christos Zaroliagis, Andrew Goldberg
|-
|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
Other events in the ALGO conferences include the following.
|Samir Khuller, Edith Cohen, Christos Zaroliagis
* '''WABI''', the '''Workshop on Algorithms in Bioinformatics''', was part of ALGO in 2001–2006 and 2008.
|-
* '''WAOA''', the '''Workshop on Approximation and Online Algorithms''', has been part of ALGO in 2003–2011.
|2020
* '''ATMOS''', the '''Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems''', formerly the ''Workshop on Algorithmic Methods and Models for Optimization of Railways'', has been part of ALGO in 2003–2006 and 2008–2009.
|Rasmus Pagh, Flemming Friche Rodler: Cuckoo Hashing. In ESA 2001
* '''IPEC''', the International Symposium on Parameterized and Exact Computation, is part of ALGO since 2011
|Uri Zwick, Samir Khuller, Edith Cohen
|-
|2019
|Ulrich Meyer, Peter Sanders: Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. In ESA 1998
|Giuseppe F. Italiano, Uri Zwick, Samir Khuller
|-
|2018
|Bernard Chazelle: Car-Pooling as a Data Structuring Device: The Soft Heap. In ESA 1998
|Giuseppe F. Italiano, Jan van Leeuwen, Uri Zwick
|-
|2017
|James Abello, Adam L. Buchsbaum, and Jeffery R. Westbrook: A Functional Approach to External Graph Algorithms. In ESA 1998
|Jan van Leeuwen, Kurt Mehlhorn, Mike Paterson
|-
|2016
|Boris V. Cherkassky, Andrew V. Goldberg: Negative-cycle detection algorithms. In ESA 1996
|Kurt Mehlhorn, Mike Paterson, Jan van Leeuwen
|-
|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 ===
ATMOS was a co-located with the [[International Colloquium on Automata, Languages and Programming]] (ICALP) in 2001–2002.
{| 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.
==ESA locations==


==ALGO conferences==
[[Image:ESA 2009 coffee break.JPG|thumb|right|200px|ESA 2009 at [[IT University of Copenhagen]]]]
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.
* 1993 – Bad Honnef, Germany
* 1994 – Utrecht, Netherlands
* 1995 – Corfu, Greece
* 1996 – Barcelona, Spain
* 1997 – Graz, Austria
* 1998 – Venice, Italy
* 1999 – Prague, Czech Republic
* 2000 – Saarbrücken, Germany
* 2001 – Århus, Denmark
* 2002 – Rome, Italy
* 2003 – Budapest, Hungary
* 2004 – Bergen, Norway
* 2005 – Palma de Mallorca, Spain
* 2006 – Zürich, Switzerland
* 2007 – Eilat, Israel
* 2008 – Karlsruhe, Germany
* 2009 – Copenhagen, Denmark
* 2010 – Liverpool, United Kingdom
* 2011 – Saarbrücken, Germany
* 2012 – Ljubljana, Slovenia
* 2013 - Sophia Antipolis, France
* 2014 - Wrocław, Poland
* 2015 - Patras, Greece


Other events in the ALGO conferences include the following.
==External links==
* '''WABI''', the '''[[Workshop on Algorithms in Bioinformatics]]''', is part of ALGO in most years.
* [http://esa-symposium.org/ Web site of ESA].
* '''WAOA''', the '''Workshop on Approximation and Online Algorithms''', has been part of ALGO since 2003.
* [http://algo2009.itu.dk/history ALGO History] on ALGO 2009 web site.
* '''ATMOS''', the '''Workshop on Algorithmic Approaches for Transportation Modeling, Optimization and Systems''', formerly the ''Workshop on Algorithmic Methods and Models for Optimization of Railways'', has been part of ALGO in 2003–2006 and 2008–2009.
* [http://www.informatik.uni-trier.de/~ley/db/conf/esa/index.html Index of ESA proceedings].
* '''IPEC''', the International Symposium on Parameterized and Exact Computation, founded in 2004 and formerly the International Workshop on Parameterized and Exact Computation (IWPEC), is part of ALGO since 2011


ATMOS was co-located with the [[International Colloquium on Automata, Languages and Programming]] (ICALP) in 2001–2002.
==References==


==References==
{{Reflist}}
{{Reflist}}

==External links==
*{{Official website}}
*[https://dblp.org/streams/conf/esa Index of ESA proceedings] at [[DBLP]]
*[https://link.springer.com/conference/esa List of ESA proceedings] at [[SpringerLink]]
*[http://algo2009.itu.dk/history ALGO History]

{{Authority control}}


[[Category:Theoretical computer science conferences]]
[[Category:Theoretical computer science conferences]]

Latest revision as of 23:43, 28 July 2024

European Symposium on Algorithms
AbbreviationESA
DisciplineAlgorithms
Publication details
PublisherSpringer Science+Business Media: Lecture Notes in Computer Science
History1993–present
FrequencyAnnual

The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.[1]

History

[edit]

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

[edit]

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 Awards

[edit]

ESA Test-of-Time Award

[edit]

The ESA Test-of-Time Award (ESA ToTA) recognizes outstanding 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.[2] Because the 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.

ESA Test-of-Time Award
Year Winners Award Committee
2022 Marianne Durand, Philippe Flajolet: Loglog Counting of Large Cardinalities (Extended Abstract). In ESA 2003

Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms. In ESA 2003

Edith Cohen, Christos Zaroliagis, Andrew Goldberg
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

Samir Khuller, Edith Cohen, Christos Zaroliagis
2020 Rasmus Pagh, Flemming Friche Rodler: Cuckoo Hashing. In ESA 2001 Uri Zwick, Samir Khuller, Edith Cohen
2019 Ulrich Meyer, Peter Sanders: Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. In ESA 1998 Giuseppe F. Italiano, Uri Zwick, Samir Khuller
2018 Bernard Chazelle: Car-Pooling as a Data Structuring Device: The Soft Heap. In ESA 1998 Giuseppe F. Italiano, Jan van Leeuwen, Uri Zwick
2017 James Abello, Adam L. Buchsbaum, and Jeffery R. Westbrook: A Functional Approach to External Graph Algorithms. In ESA 1998 Jan van Leeuwen, Kurt Mehlhorn, Mike Paterson
2016 Boris V. Cherkassky, Andrew V. Goldberg: Negative-cycle detection algorithms. In ESA 1996 Kurt Mehlhorn, Mike Paterson, Jan van Leeuwen
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

[edit]
ESA Best Paper Awards
Year Track A Best Paper Track B Best Paper Track A Best Student Paper Track B Best Student Paper
2022[3] 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[4] 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[5] 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[6] 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[7] 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

[edit]

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.

Other events in the ALGO conferences include the following.

  • WABI, the Workshop on Algorithms in Bioinformatics, is part of ALGO in most years.
  • WAOA, the Workshop on Approximation and Online Algorithms, has been part of ALGO since 2003.
  • ATMOS, the Workshop on Algorithmic Approaches for Transportation Modeling, Optimization and Systems, formerly the Workshop on Algorithmic Methods and Models for Optimization of Railways, has been part of ALGO in 2003–2006 and 2008–2009.
  • IPEC, the International Symposium on Parameterized and Exact Computation, founded in 2004 and formerly the International Workshop on Parameterized and Exact Computation (IWPEC), is part of ALGO since 2011

ATMOS was co-located with the International Colloquium on Automata, Languages and Programming (ICALP) in 2001–2002.

References

[edit]
  1. ^ "Algorithms – ESA 2012 (Lecture Notes in Computer Science)" (PDF). 2012. Retrieved 2012-09-17.[dead link‍]
  2. ^ "Test-of-Time Award – ESA". Retrieved 2023-08-29.
  3. ^ "Schedule – ALGO 2022". Retrieved 2023-08-29.
  4. ^ "ALGO 2020 - September 7-10, 2020 - Pisa, Italy". algo2020.di.unipi.it. Retrieved 2023-08-29.
  5. ^ "ESA 2018: Program". algo2018.hiit.fi. Retrieved 2023-08-29.
  6. ^ Pruhs, Kirk; Sohler, Christian (2017). Pruhs, Kirk; Sohler, Christian (eds.). "Front Matter, Table of Contents, Preface, Programm Committees, External Reviewers". 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs). 87. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 0:i–0:xx. doi:10.4230/LIPIcs.ESA.2017.0. ISBN 978-3-95977-049-1.
  7. ^ Sankowski, Piotr; Zaroliagis, Christos (2016). Sankowski, Piotr; Zaroliagis, Christos (eds.). "Front Matter, Table of Contents, Preface, Programm Committee, External Reviewers". 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs). 57. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik: 0:i–0:xxiv. doi:10.4230/LIPIcs.ESA.2016.0. ISBN 978-3-95977-015-6.
[edit]
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=European_Symposium_on_Algorithms&oldid=1237268831"