Call for Papers: European Symposium on Algorithm (ESA) 2026.
------------------------
Part of ALGO 2026, August 31 - September 4 in L'Aquila, Italy.
https://algo-conference.org/2026/
Important Dates
------------------------
Abstract submission deadline: April 21
Paper submission deadline: April 23
Notification: June 26
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 E. 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 (including PhD candidates) at the time of submission.
Paper submission and proceedings
Papers should be submitted electronically via the EasyChair submission system. The ESA 2026 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; for a quick start, duplicate this Overleaf project.
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 2026 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 2026, 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 are not anonymous. The title page should contain the title, authors' names and affiliations, and a concise abstract. 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, even those in the 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.
TEXNICAL DETAILS
Authors must use the socg-lipics-v2021.cls class, which is a lightweight wrapper for the standard LIPIcs document class lipics-v2021. The LIPIcs document class is available from the publisher here (under Author Instructions). Use socg-lipics-v2021 version 0.9 (updated in 2022) and lipics-v2021 version 3.1.3 (updated 2023-05-12).
Further instructions on how to use socg-lipics-v2021 are available here.
The first page describes everything needed for the "standard use case"; the rest of the document goes into detail on how to manually correct the line counting in custom environments, should you desire to do so.
The socg-lipics-v2021 document class and its documentation have originally been developed for the International Symposium on Computational Geometry, SoCG, (hence the name of the document class), but it is a generic template for LIPIcs papers with line counts.
Conflict of Interest
------------------------
The conference will employ a single-blind reviewing process. Still, 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.
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
PC CHAIRS
Seth Pettie (University of Michigan)
Sabine Storandt (University of Konstanz)
Philip Bille (Technical University of Denmark)
PC MEMBERS (TRACK A)
Deeksha Adil (ETH Zürich, Switzerland)
Kristoffer Arnsfelt-Hansen (Aarhus University, Denmark)
Lorenzo Beretta (IBM Research, USA)
Sebastian Brandt (CISPA Helmholtz Center for Information Security, Germany)
Jarosław Błasiok (Bocconi University, Italy)
Karthik C. S. (Rutgers University, USA)
Deeparnab Chakrabarty (Dartmouth College, USA)
Christian Coester (University of Oxford, UK)
Sami Davies (UC Berkeley and RelationalAI, USA)
Kunal Dutta (University of Warsaw, Poland)
Klim Efremenko (Ben Gurion University, Israel)
Robert Ganian (Vienna University of Technology, Austria)
Prantar Ghosh (Tennessee Technological University, USA)
Rohan Ghuge (University of Texas at Austin, USA)
Gramoz Goranci (University of Vienna, Austria)
Yassine Hamoudi (Université de Bordeaux, France)
David Harris (University of Maryland, USA)
Haotian Jiang (University of Chicago, USA)
John Kallaugher (National University of Singapore, Singapore)
Petteri Kaski (Aalto University, Finland)
Dominik Kempa (Stony Brook University, USA)
Sándor Kisfaludi-Bak (Aalto University, Finland)
Hanna Komlós (Max Planck Institute for Informatics, Germany)
Tsvi Kopelowitz (Bar-Ilan University, Israel)
Stefan Kratsch (Humboldt-Universität zu Berlin, Germany)
William Kuszmaul (Carnegie Mellon University, USA)
Michael Lampis (LAMSADE, Université Paris Dauphine, France)
Yi Li (Nanyang Technological University, Singapore)
Yannic Maus (TU Graz, Austria)
Sagnik Mukhopadhyay (University of Birmingham, UK)
Christopher Musco (New York University, USA)
Aleksandar Nikolov (University of Toronto, Canada)
Marcin Pilipczuk (University of Warsaw, Poland)
Adam Polak (Bocconi University, Italy)
Benjamin Raichel (UT Dallas, USA)
Peter Robinson (Augusta University, USA)
Jiří Sgall (Computer Science Institute of Charles University, Czech Republic)
Tatiana Starikovskaya (École Normale Supérieure, France)
He Sun (University of Chinese Academy of Sciences, China)
Paloma T. de Lima (Norwegian School of Economics, Norway, and IT University of Copenhagen, Denmark)
Csaba Tóth (California State University Northridge, USA)
Bartosz Walczak (Jagiellonian University, Poland)
Stefan Walzer (Karlsruhe Institute of Technology, Germany)
Haitao Wang (University of Utah, USA)
Karol Węgrzycki (Max Planck Institute for Informatics, Germany)
Nicole Wein (University of Michigan, USA)
Andreas Wiese (Technical University of Munich, Germany)
Sampson Wong (University of Copenhagen, Denmark)
Mingyu Xiao (University of Electronic Science and Technology of China, China)
Huacheng Yu (Princeton University, USA)
Meirav Zehavi (Ben-Gurion University, Israel)
Tianyi Zhang (Nanjing University, China)
Anna Zych-Pawlewicz (University of Warsaw, Poland)
PC MEMBERS (TRACK E)
Maike Buchin (Ruhr Universität Bochum)
Martin Koutecký (Charles University in Prague)
Vincent Jugé (LIGM – Université Paris-Est Marne-la-Vallée)
Laurent Viennot (INRIA)
Soeren Terziadis (TUM, Heilbronn)
Bora Ucar (CNRS and LIP ENS Lyon)
Andre Schidler (Uni Freiburg)
Dachuan Xu (Beijing University of Technology)
Gonzalo Navarro (University of Chile)
Yihan Sun (University of California, Riverside)
Thomas Bläsius (Karlsruhe Institute of Technology)
Ernestine Großmann (Universiät Heidelberg)
Valentin Polishchuk (Linkoping University)
Pierre-Louis Poirion (RIKEN-AIP)
Christina Boucher (University of Florida)
Giulio Ermanno Pibiri (Ca' Foscari University of Venice)
Kathrin Hanauer (University of Vienna)
PC MEMBERS (TRACK S)
Alexander Conway (Cornell Tech, USA)
Christian Janos Lebeda (INRIA, France)
Danny Hermelin (Ben Gurion University, Israel)
Francesco Silvestri (University of Padova, Italy)
Hideo Bannai (Institute of Science Tokyo, Japan)
Holger Dell (IT University of Copenhagen, Denmark)
Ioana O. Bercea (KTH Royal Institute of Technology, Sweden)
László Kozma (Dresden University of Technology, Germany)
Lene Monrad Favrholdt (University of Southern Denmark, Denmark)
Miguel Mosteiro (Pace University, USA)
Mikkel Abrahamsen (University of Copenhagen, Denmark)
Nick Fischer (INSAIT, Bulgaria)
Nodari Sitchinava (University of Hawaii, USA)
Oren Weimann (University of Haifa, Israel)
Panagiotis Charalampopoulos (King's College, London)
Radu Curticapean (University of Regensburg, Germany)
Shay Mozes (Reichman University, Israel)
Solon Pissis (Centrum Wiskunde & Informatica, The Netherlands)
Teresa Anna Steiner (University of Southern Denmark, Denmark)
Thore Husfeldt (IT University of Copenhagen, Denmark)
**********************************************************
*
* 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
