33rd Annual European Symposium on Algorithms (ESA 2025)
https://algo-conference.org/2025/esa/
The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms and is a part of ALGO 2025, to be held at
at the Faculty of Physics at the University of Warsaw in Warsaw, Poland.
IMPORTANT DATES: (all tracks)
- Paper submission deadline: 23 April, 23:59 AoE
(https://easychair.org/conferences/?conf=esa2025)
- Notification: 23 June
- Camera ready: 7 July
- Conference: 15-17 September
🆕 NOTE: Change to paper submission format (lines, not pages)
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 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 2025 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. Submissions must be formatted in accordance with the LIPIcs proceedings guidelines and may not exceed *500 lines* of text. Authors must use the LaTeX class file socg-lipics-v2021.cls (https://computational-geometry.org/guidelines/socg-lipics-v2021.cls); for a quick start, you can duplicate this Overleaf project: https://www.overleaf.com/read/vhfbgqwsmsvr#4c5597
Proofs omitted due to the line constraint 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 must be submitted electronically via the EasyChair submission system. Results previously published (or scheduled for publication) in another conference proceedings or journal should not be submitted to ESA. Simultaneous submission to other conferences with published proceedings, journals, or to multiple tracks of ESA 2025, 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 2025, 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).
PRECISE FORMAT DEFINITIONS
Submissions must not exceed 500 lines, excluding front matter (title, authors, and affiliations), references, and a clearly marked appendix (further described below), but including all other lines (in abstract, algorithms, tables, captions, etc.).
The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors to not exceed 500 lines even if some lines are not counted automatically. In case of doubt (such as substantial amounts of text appearing as part of a graphic), the actual text content as judged by the program committee will replace the automated line count in deciding conformity.
Further TeXnical details on the website, https://algo-conference.org/2025/esa/.
"WE'VE ALWAYS MERRILY COUNTED PAGES; WHY BOTHER WITH COUNTING LINES NOW?"
Counting lines is the attempt to make authoring submissions for ESA more efficient for everyone involved.
To enable a timely reviewing process, most conferences have a (sometimes soft) page limit beyond which submissions are read at the Program Committee's discretion only. Counting lines fulfills that same purpose, but is a much more fine-grained function of the input text size than the page count, whose often chaotic behavior in the LaTeX typesetting process has been a perennial frustration for authors and editors alike. 500 lines are similar to 12 pages of text.
DOUBLE-BLIND REVIEWING:
The conference will employ a lightweight double-blind reviewing process. 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.
Submissions should not reveal the identity of the authors. 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 …").
Double-blind reviewing is intended to help PC members and reviewers to counter 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.
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
PC CHAIRS:
- Haim Kaplan (Tel Aviv University) — Track A
- Anne Benoit (ENS Lyon) — Track B
- Sebastian Wild (University of Marburg and University of Liverpool) — Track S
PC MEMBERS (TRACK A):
- Hee-Kap Ahn (Pohang University, Korea)
- Shyan Akmal (Institute for Computer Science, Artificial Intelligence and Technology (INSAIT) Sofia, Bulgaria)
- Boris Aronov (NYU)
- Alkida Balliu (Gran Sasso Science Institute (GSSI), L'Aquila, Italy)
- Hideo Bannai (Tokyo medical and dental university)
- Soheil Behnezhad (Northeastern University)
- Omri Ben Eliezer (Technion)
- Ioana O. Bercea (KTH)
- Ahmad Biniaz (University of Windsor, Canada)
- Eric Blais (University of Waterloo)
- Edouard Bonnet (CNRS, Parallel Computation Laboratory, Lyon)
- Karl Bringmann (Saarland University, MPI)
- Kevin Buchin (Technical University, Dortmund)
- Eden Chalamtac (Ben Gurion University)
- Amit Chakrabarti (Dartmouth)
- Chandra Chekuri (Illinois, Urbana-Champaign)
- Yann Disser (Technische Universität Darmstadt)
- Dan Dorfman (MPI)
- Shaddin Dughmi (University of Southern California)
- Marek Elias (Bocconi University in Milan)
- David Ellis Hershkowitz (Brown University)
- Esther Ezra (Bar Ilan University)
- Paolo Ferragina (University of Pisa)
- Aris Filos-Ratsikas (University of Edinburgh)
- Pierre Fraigniaud (CNRS, University of Paris Cite)
- Pinar Heggernes (University of Bergen)
- Zhiyi Huang (The University of Hong Kong)
- Arun Jambulapati (University of Michigan)
- Rajesh Jayaram (Google)
- Thomas Kesselheim (University of Bonn)
- Linda Kleist (TU Braunschweig)
- Kuba Lacki (Google)
- Stefano Leonard (Sapienza University of Rome)
- Roie Levin (Rutgers University)
- Daniel Lokshtanov (University of California Santa Barbara)
- Pasin Manurangsi (Google)
- Daniel Marx (CISPA Helmholtz Center for Information Security)
- Benjamin Moseley (Carnegie Mellon University)
- Sagnik Mukhopadhyay (University of Birmingham)
- Cameron Musco (University of Massachusetts, Amherst)
- Aaron Potechin (University of Chicago)
- Manish Purohit (Google)
- Chris Schwiegelshohn (Aarhus University)
- Cliff Stein (Columbia University)
- Ioan Todinca (Univ. Orléans)
- Jie Xue (NYU Shanghai)
- Sorrachai Yingchareonthawornchai (ETH)
PC MEMBERS (TRACK B):
- Petra Berenbrink (University of Hamburg, Germany)
- Florina Ciorba (University of Basel, Switzerland)
- SM Ferdous (Pacific Northwest National Lab, USA)
- Li Han (ECNU, China)
- Valentin Honoré (ENSIIE, France)
- Kamer Kaya (Sabancı University, Turkey)
- Alba Cristina Magalhaes Alves de Melo (University of Brasilia, Brazil)
- Henning Meyerhenke (Humboldt-Universität zu Berlin, Germany)
- Valia Mitsou (IRIF, France)
- Cynthia Phillips (Sandia National Laboratories, USA)
- Krzysztof Rzadca (University of Warsaw and Google, Poland)
- Blair D. Sullivan (University of Utah, USA)
- Hongyang Sun (University of Kansas, USA)
- Sivan Toledo (Tel-Aviv University, Israel)
- Jesper Larsson Träff (TU Vienna, Austria)
- Ulrike Meier Yang (LLNL, USA)
PC MEMBERS (TRACK S):
- Martin Aumüller (ITU Copenhagen, Denmark)
- Peyman Afshani (Aarhus University, Denmark)
- Parinya Chalmersook (University of Sheffield, UK)
- Rathish Das (University of Houston, USA)
- David Eppstein (University of California, Irvine, USA)
- Rolf Fagerberg (University of Southern Denmark, Denmark)
- José Fuentes-Sepúlveda (University of Concepción, Chile)
- Christian Ikenmeyer (University of Warwick, UK)
- Akitoshi Kawamura (Kyoto University, Japan)
- Phillip Keldenich (TU Braunschweig, Germany)
- Tsvi Kopelowitz (Bar Ilan University, Israel)
- Pascal Lenzner (University of Augsburg, Germany)
- Namrata (University of Liverpool, UK)
- Sharma Thankachan (NC State University, USA)
- Will Rosenbaum (University of Liverpool, UK)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
