Scope

The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms. It is organized in collaboration with the European Association for Theoretical Computer Science (EATCS) and is a part of ALGO 2021.
We hope that by September it will be possible to travel to Portugal from many parts of the world, but we also expect that it may be unsafe, difficult or impossible for some people to attend in person. If your paper is accepted we hope it will be possible for you to present it on location, but remote participation options will be available, and the choice of whether to travel would be yours entirely.

Important Dates

  • Paper submission deadline: May 3, 2021 (23:59 AoE)
  • Notification: June 23, 2021
  • Camera ready: July 3, 2021
  • Conference: September 6 - 8, 2021, in Lisbon, Portugal

Call for Papers

The symposium seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications. Papers with a strong emphasis on the theoretical analysis of algorithms should be submitted to Track A, while papers reporting on the results of extensive experimental evaluations and/or providing original contributions to the engineering of algorithms for practical applications should be submitted to Track B. There will be a Best Student Paper Award as well as a Best Paper Award, both sponsored by EATCS. In order for a paper to be considered for the Best Student Paper Award, all of its authors are required to be students.

Paper Submission and Proceedings

Papers should be submitted electronically via the EasyChair submission system. The ESA 2021 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series.

Submission Guidelines

Authors are invited to submit an extended abstract or full paper of at most 11 pages excluding the title page, references, and an optional appendix. The submission should be typeset using a 10-point or larger font in a single-column format with ample spacing throughout and 2cm margins all around on A4-size paper. We recommend, but not strictly require, making your initial submission adhere to LIPIcs publication guidelines. Proofs omitted due to space constraints must be placed in an appendix. This appendix can even comprise an entire full version of the paper. The appendix will be read by the program committee members at their discretion. In particular, appendices of accepted papers are not going to be published in the proceedings. The main part of the submission should therefore contain a clear technical presentation of the merits of the paper, including a discussion of the paper's importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. These guidelines are strict: submissions deviating significantly from these guidelines risk being rejected without consideration of their merits. Papers should be submitted electronically via the EasyChair submission system. Results previously published (or scheduled for publication) in another conference proceedings or journal will not be accepted at ESA. Simultaneous submission to other conferences with published proceedings, or to both tracks of ESA 2021, is also not permitted. By submitting a paper the authors acknowledge that in case of acceptance, at least one of the authors must register at ALGO 2021, attend the conference, and present the paper.

Press here to submit:paper submission for ESA 2021 is closed

Double-Blind Reviewing

The conference will employ a lightweight double-blind reviewing process. Submissions should not reveal the identity of the authors in any way. In particular, authors' names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should ensure that any references to their own related work is in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). The purpose of the double-blind reviewing is to help PC members and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas. In case there exist publicly available versions of the submission online, the authors might mention this in their submission (without providing references/links), and briefly explain the differences if any. Alternatively, they might communicate the details to the chairs, who will keep them confidential unless revealing them to the PC is needed for a fair judgment. Authors with further questions on double-blind reviewing are encouraged to contact the PC chairs.

Topics

Papers presenting original research in all areas of algorithmic research are sought, including but not limited to:

  • Algorithm engineering
  • Algorithmic aspects of networks
  • Algorithmic game theory
  • Algorithmic Data Science
  • Approximation algorithms
  • Computational biology
  • Computational finance
  • Computational geometry
  • Combinatorial optimization
  • Data compression
  • Data structures
  • Databases and information retrieval
  • Distributed and parallel computing
  • Graph algorithms
  • Hierarchical memories
  • Heuristics and meta-heuristics
  • Mathematical programming
  • Mobile computing
  • Online algorithms
  • Parameterized algorithms
  • Pattern matching
  • Quantum computing
  • Randomized algorithms
  • Scheduling and resource allocation problems
  • Streaming algorithms

COMMITTEES

Chairs

Steering Committee

PC Members (track A)

  • Akanksha Agrawal, Indian Institute of Technology Madras
  • Andrea Lincoln, University of California, Berkeley
  • Andrew McGregor, University of Massachusetts, Amherst
  • Asaf Levin, Technion - Israel Institute of Technology
  • Benjamin Doerr, Ecole Polytechnique
  • Chaitanya Swamy, University of Waterloo
  • Clément Canonne, University of Sydney
  • Debarati Das, University of Copenhagen
  • Édouard Bonnet, École normale supérieure de Lyon
  • Elias Koutsoupias, University of Oxford
  • Eric Price, University of Texas at Austin
  • Frances Rosamond, University of Bergen
  • Gautam Kamath, University of Waterloo
  • Gonzalo Navarro, University of Chile
  • Gramoz Goranci, University of Toronto
  • Guy Kortsarz, Rutgers University
  • Harald Räcke, Technical University Munich
  • Huacheng Yu, Princeton University
  • Ilan Reuven Cohen, Bar Ilan University
  • Ilias Diakonikolas, University of Wisconsin, Madison
  • Irina Kostitsyna, Eindhoven University of Technology
  • Jakub Łącki, Google Research
  • Jason Li, Carnegie Mellon University
  • Jeff M. Phillips, University of Utah
  • Johannes Fischer, Technical University of Dortmund
  • Justin Thaler, Georgetown University
  • Laxman Dhulipala, Massachusetts Institute of Technology
  • Maarten Löffler, Utrecht University
  • Marco Molinaro, Pontifical Catholic University of Rio de Janeiro
  • Marvin Künnemann, Max Planck Institute for Informatics
  • Melanie Schmidt, University of Cologne
  • Michał Pilipczuk, University of Warsaw
  • MohammadTaghi HajiAghayi, University of Maryland
  • Naveen Garg, Indian Institute of Technology Delhi
  • Omri Weinstein, Columbia University and Hebrew University
  • Paloma T. Lima, University of Bergen
  • Pierre Fraigniaud, Université de Paris and CNRS
  • Ran Duan, Tsinghua University
  • Rasmus Kyng, ETH Zurich
  • Rasmus Pagh (Chair), University of Copenhagen
  • Richard Peng, Georgia Institute of Technology
  • Riko Jacob, IT University of Copenhagen
  • Rossano Venturini, University of Pisa
  • Simon Apers, Université libre de Bruxelles and CWI Amsterdam
  • Talya Eden, Massachusetts Institute of Technology
  • Tobias Christiani, Norwegian University of Science and Technology
  • Tobias Friedrich, Hasso Plattner Institute and University of Potsdam
  • Yusuke Kobayashi, Kyoto University
  • Zachary Friggstad, University of Alberta

PC Members (track B)

  • Petra Berenbrink, University of Hamburg
  • Therese Biedl, University of Waterloo
  • Gerth Stølting Brodal, Aarhus University
  • Sanjeeb Dash, IBM T. J. Watson Research Center
  • Kathrin Hanauer, University of Vienna
  • Susana Ladra, University of A Coruña
  • Leo Liberti, CNRS & Institut Polytechnique de Paris
  • Ivana Ljubic, ESSEC Business School of Paris
  • Andrea Marino, University of Florence
  • Henning Meyerhenke, Humboldt-Universität zu Berlin
  • Petra Mutzel (Chair), University of Bonn
  • Manuel Penschuck, Goethe University Frankfurt
  • Cynthia Phillips, Sandia National Laboratories
  • Liam Roditty, Bar-Ilan University
  • Daniel Schmidt, University of Bonn
  • Nodari Sitchinava, University of Hawaii at Manoa
  • Blair D. Sullivan, University of Utah
  • Yihan Sun, University of California, Riverside
  • Christos Zaroliagis, University of Patras

INVITED SPEAKERS

Frauke Liers

Friedrich-Alexander University Erlangen-Nuremberg, Germany

Frauke's main research interests are in the development, analysis and implementation of global algorithms for combinatorial as well as mixed-integer linear and nonlinear optimization. The algorithms usually allow the derivation of provable quality guarantees. She is also interested in optimization under uncertainty. Ongoing research projects are in robust optimization with applications in energy, transport and engineering. She is member of the Editorial Boards of Discrete Optimization, Mathematical Methods of Operations Research and Optimization and Engineering. She is involved in several national and European projects. Currently, Frauke coordinates the European Marie-Curie Innovative Training Network MINOA.

Aaron Roth

University of Pennsylvania, USA

Aaron Roth is a professor of Computer and Information Sciences at the University of Pennsylvania, affiliated with the Warren Center for Network and Data Science, and co-director of the Networked and Social Systems Engineering (NETS) program.  He is also an Amazon Scholar at Amazon AWS. He is the recipient of a Presidential Early Career Award for Scientists and Engineers (PECASE) awarded by President Obama in 2016, an Alfred P. Sloan Research Fellowship, an NSF CAREER award, and research awards from Yahoo, Amazon, and Google.  His research focuses on the algorithmic foundations of data privacy, algorithmic fairness, game theory, learning theory, and machine learning.  Together with Cynthia Dwork, he is the author of the book “The Algorithmic Foundations of Differential Privacy.” Together with Michael Kearns, he is the author of “The Ethical Algorithm”.

Proceedings

The ESA 2021 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series.