ESA 2024


The European Symposium on Algorithms (ESA) is one of the premier conferences on algorithms and is a part of ALGO 2024, to be held at Royal Holloway, University of London in Egham, United Kingdom.

Important Dates (all tracks)

  • Paper submission deadline: 22 April, 23:59 AoE (EasyChair submission system)
  • Notification: 23 June
  • Camera ready: 30 June
  • Conference: 2-4 September

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. Submissions that prove or explain results, possibly already known, in a particularly clear, simple or elegant way should be submitted to Track S. 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 at the time of submission.

Paper Submission and Proceedings

Papers should be submitted electronically via the EasyChair submission system. The ESA 2024 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 12 pages excluding the title page (consisting of title and abstract), references, and an optional appendix. We recommend, but do not strictly require, making your initial submission adhere to LIPIcs publication guidelines. If not using LIPIcs style, 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. 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, journals, or to multiple tracks of ESA 2024, 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 2024, attend the conference on-site and present the paper. Papers with no author fulfilling this requirement may risk being removed from the final conference proceedings (unless there are extenuating circumstances).

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 judgement 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 judgement. Authors with further questions on double-blind reviewing are encouraged to contact the PC chairs.

When submitting a paper, please indicate Conflict of Interest (CoI) with PC members. A CoI is limited to the following categories:

  1. Family member or close friend.
  2. Ph.D. advisor or advisee (no time limit), or postdoc or undergraduate mentor or mentee within the past 5 years.
  3. Person with the same affiliation.
  4. Involved in an alleged incident of harassment. (It is not required that the incident be reported.)
  5. Reviewer owes author a favor (e.g., recently requested a reference letter).
  6. Frequent or recent collaborator whom you believe cannot objectively review your work.

PC Submissions

Submissions authored or co-authored by members of the program committee are allowed.


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

Invited Speakers

  • Vincent Cohen-Addad, Google Research, France
  • Eva Rotenberg, Technical University of Denmark


PC Chairs

PC Members (Track A)
  • Josh Alman, Columbia University
  • Sayan Bhattacharya, University of Warwick
  • Andreas Björklund, IT University of Copenhagen
  • Gerth Stølting Brodal, Aarhus University
  • Jean Cardinal, Université libre de Bruxelles
  • Timothy Chan (chair), University of Illinois at Urbana-Champaign
  • Yi-Jun Chang, National University of Singapore
  • Panagiotis Charalampopoulos, Birkbeck, University of London
  • Li Chen, Carnegie Mellon University
  • Vida Dujmović, University of Ottawa
  • Moran Feldman, University of Haifa
  • Jeremy Fineman, Georgetown University
  • Nick Fischer, Weizmann Institute
  • Emily Fox, University of Texas at Dallas
  • Loukas Georgiadis, University of Ioannina
  • Petr Golovach, University of Bergen
  • Nick Gravin, Shanghai University of Finance and Economics
  • Elena Grigorescu, Purdue University
  • Thekla Hamm, Utrecht University
  • Bart M. P. Jansen, Eindhoven University of Technology
  • Adam Karczmarz, University of Warsaw and IDEAS NCBR
  • Ken-ichi Kawarabayashi, National Institute of Informatics, Japan
  • Laura Vargas Koch, University of Bonn
  • László Kozma, Freie Universität Berlin
  • Bundit Laekhanukit, Shanghai University of Finance and Economics
  • Alexandra Lassota, Eindhoven University of Technology
  • Hung Le, University of Massachusetts, Amherst
  • Moshe Lewenstein, Bar-Ilan University
  • Nikhil Mande, University of Liverpool
  • Tillmann Miltzow, Utrecht University
  • Matthias Mnich, Hamburg University of Technology
  • Yakov Nekrich, Michigan Technological University
  • Mohammad Salavatipour, University of Alberta
  • Laura Sanità, Bocconi University
  • Saket Saurabh, Institute of Mathematical Sciences, Chennai
  • Roohani Sharma, Max-Planck Institute for Informatics
  • Anastasios Sidiropoulos, University of Illinois at Chicago
  • Makrand Sinha, University of Illinois at Urbana-Champaign
  • Seeun William Umboh, The University of Melbourne
  • Pavel Veselý, Charles University
  • Adrian Vladu, CNRS & IRIF, Université Paris Cité
  • Erik Waingarten, University of Pennsylvania
  • Yinzhan Xu, Massachusetts Institute of Technology
  • Yuichi Yoshida, National Institute of Informatics, Japan
  • Samson Zhou, Texas A&M University
  • Goran Žužić, Google Research, Zürich

PC Members (Track B)
  • Carola Doerr, CNRS and Sorbonne University
  • Jonas Ellert, École Normale Supérieure Paris
  • Johannes Fischer (chair), TU Dortmund University
  • Yan Gu, University of California at Riverside
  • Sharat Ibrahimpur, London School of Economics
  • Stephen Kobourov, University of Arizona
  • Dominik Köppl, University of Yamanashi
  • Florian Kurpicz, Karlsruhe Institute of Technology
  • Zsuzsanna Liptak, University of Verona
  • Quanquan Liu, Yale University
  • Ulrich Meyer, Goethe University Frankfurt
  • André Nusser, CNRS and Inria Center at Université Côte d’Azur
  • Valentin Polishchuk, Linköping University
  • Rajeev Raman, University of Leicester
  • Leena Salmela, University of Helsinki
  • Lena Schlipf, University of Tübingen
  • Christiane Schmidt, Linköping University
  • Bob Sedgewick, Princeton University
  • Darren Strash, Hamilton College

PC Members (Track S)
  • Philip Bille, Technical University of Denmark
  • Greg Bodwin, University of Michigan
  • Yixin Cao, Hong Kong Polytechnic University
  • Talya Eden, Bar-Ilan University
  • Fabrizio Frati, Università degli Studi Roma Tre
  • Maximilian Probst Gutenberg, Eidgenössische Technische Hochschule Zürich
  • Torben Hagerup, Universität Augsburg
  • John Iacono (chair), Université libre de Bruxelles
  • Katharina Klost, Freie Universität Berlin
  • Sixue Cliff Liu, Carnegie Mellon University
  • Pat Morin, Carleton University
  • Christopher Musco, New York University
  • Alantha Newman, Université Grenoble Alpes
  • Eric Price, The University of Texas at Austin
  • Jakub Radoszewski, University of Warsaw and Samsung R&D Warsaw
  • Bettina Speckmann, Technische Universiteit Eindhoven
  • Sebastian Wild, University of Liverpool
  • David P. Williamson, Cornell University

Steering Committee
  • Hannah Bast, University of Freiburg
  • Timothy Chan, University of Illinois at Urbana-Champaign
  • Shiri Chechik, Tel Aviv University
  • Martin Farach-Colton, Rutgers University
  • Johannes Fischer, Technical University of Dortmund
  • Inge Li Gørtz, Technical University of Denmark
  • John Iacono, Université libre de Bruxelles
  • Petra Mutzel, University of Bonn
  • Gonzalo Navarro, Universidad de Chile
  • Rasmus Pagh (chair), University of Copenhagen
  • Solon P. Pissis, CWI
  • Simon J. Puglisi, University of Helsinki
  • Eva Rotenberg, Technical University of Denmark
  • Sabine Storandt, University of Konstanz