---
title: "ESA (A): papers and universities"
description: "ESA (European Symposium on Algorithms) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 350 of its papers from 2024–2026 (78 in 2024, 123 in 2025, 149 in 2026). By the countries of the authors' institutions, the most papers come from Germany (112), the United States (79) and Denmark (44)."
url: https://scholar4ai.com/proceedings/esa
markdown_url: https://scholar4ai.com/proceedings/esa.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "ESA (European Symposium on Algorithms) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 350 of its papers from 2024–2026 (78 in 2024, 123 in 2025, 149 in 2026). (as of 2026-11-02)"
data_url: https://scholar4ai.com/data/rankings.json
updated: 2026-11-02T12:20:52+09:00
window: 2026-10-04 to 2026-11-02
source: OpenAlex (CC0)
---

# ESA: European Symposium on Algorithms — papers and institutions, 2024–2026

Papers of ESA, European Symposium on Algorithms (CORE rank A; field: Theory of computation), 2024–2026: per year, the institutions, countries and topics, and the most-cited papers. Ranks are those of the CORE Conference Rankings, edition ICORE2026 (portal.core.edu.au), applied to every year shown. Papers are the works OpenAlex lists for the conference's proceedings, or for the issues of a conference-linked journal that publishes its papers (such as PACMPL, PVLDB or ACM TOG), by publication year; workshops, companion volumes, posters and Findings are left out. A paper counts once for each institution and country among its authors' affiliations as OpenAlex assigns them; papers without affiliations in OpenAlex count for none. For conferences published in book series that OpenAlex files as one source (LNCS, LIPIcs, SIAM and IOS Press proceedings), the papers are found by DOI: those of the volumes with the conference's title in Crossref, or LIPIcs DOIs, which name the conference. Conferences without DOIs (PMLR, USENIX, OpenReview) are listed without counts. A dash (–) for a year means OpenAlex has no papers of the conference for it yet: the proceedings are not published or indexed yet, or the conference did not meet that year (some meet every other year). 2026 counts what OpenAlex had indexed by 2026-11-02.

All conferences: https://scholar4ai.com/proceedings.md

## Key findings

- ESA (European Symposium on Algorithms) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 350 of its papers from 2024–2026 (78 in 2024, 123 in 2025, 149 in 2026).
- By the countries of the authors' institutions, the most papers come from Germany (112), the United States (79) and Denmark (44).
- The institutions with the most papers are Karlsruhe Institute of Technology (27), Centre National de la Recherche Scientifique (23) and IT University of Copenhagen (19).
- Its most-cited paper of these years is “Improved Approximations for Flexible Network Design” (2024), with 3 citations.

## Papers per year

*ESA papers per publication year in OpenAlex (–: not in OpenAlex yet)*

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 78 | 77 |
| 2025 | 123 | 121 |
| 2026 | 149 | 148 |

## Sources

*Where OpenAlex lists the papers*

| OpenAlex source | Which papers |
|---|---|
| [S4377196569](https://openalex.org/S4377196569) | LIPIcs papers with the DOIs 10.4230/LIPIcs.ESA.<year>.<n> |

## Who publishes there

*Institutions with the most ESA papers, 2024–2026*

| # | Institution | Papers |
|---:|---|---:|
| 1 | Karlsruhe Institute of Technology | 27 |
| 2 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 23 |
| 3 | IT University of Copenhagen | 19 |
| 4 | University of Warsaw | 17 |
| 5 | University of Bonn | 14 |
| 6 | [Tel Aviv University](https://scholar4ai.com/institutions/tel-aviv-university.md) | 13 |
| 7 | Eindhoven University of Technology | 12 |
| 8 | University of Copenhagen | 11 |
| 9 | University of Southern Denmark | 10 |
| 10 | Institut national de recherche en sciences et technologies du numérique | 9 |

*Countries with the most ESA papers, 2024–2026*

| # | Country | Papers |
|---:|---|---:|
| 1 | Germany | 112 |
| 2 | United States | 79 |
| 3 | Denmark | 44 |
| 4 | Israel | 39 |
| 5 | United Kingdom | 35 |
| 6 | France | 31 |
| 7 | Japan | 24 |
| 8 | Poland | 24 |
| 9 | Netherlands | 22 |
| 10 | Italy | 17 |

*Keywords with the most ESA papers, 2024–2026*

| # | Keyword | Papers |
|---:|---|---:|
| 1 | approximation algorithms | 59 |
| 2 | lower bounds | 45 |
| 3 | fixed-parameter tractability | 31 |
| 4 | parameterized complexity | 28 |
| 5 | NP-hardness | 23 |
| 6 | treewidth | 22 |
| 7 | competitive ratio | 16 |
| 8 | online algorithms | 15 |
| 9 | computational geometry | 13 |
| 10 | conditional lower bounds | 13 |

## Most-cited papers

*Most-cited ESA papers of 2024–2026 (citations counted by OpenAlex)*

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 3 | [Improved Approximations for Flexible Network Design](https://doi.org/10.4230/lipics.esa.2024.74) | 2024-01-01 | Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità |
| 2 | 3 | [Time-Efficient Quantum Entropy Estimator via Samplizer](https://doi.org/10.4230/lipics.esa.2024.101) | 2024-01-01 | Qisheng Wang, Zhicheng Zhang |
| 3 | 2 | [Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time](https://doi.org/10.4230/lipics.esa.2024.81) | 2024-01-01 | Łukasz Kowalik |
| 4 | 2 | [Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing](https://doi.org/10.4230/lipics.esa.2025.109) | 2025-01-01 | Hans‐Peter Lehmann, Peter Sanders, Stefan Walzer et al. |
| 5 | 2 | [Theoretical Analysis of Byte-Pair Encoding](https://doi.org/10.4230/lipics.esa.2026.80) | 2024-11-13 | László Kozma, Johannes Voderholzer |
| 6 | 2 | [Competitive Capacitated Online Recoloring](https://doi.org/10.4230/lipics.esa.2024.95) | 2024-01-01 | Rajmohan Rajaraman, Omer Wasim |
| 7 | 2 | [A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs](https://doi.org/10.4230/lipics.esa.2024.24) | 2024-01-01 | Thérèse Biedl, Prosenjit K. Bose, Karthik Murali |
| 8 | 2 | [PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding](https://doi.org/10.1145/3849725) | 2026-09-24 | Stefan Hermann, Hans‐Peter Lehmann, Giulio Ermanno Pibiri et al. |
| 9 | 2 | [Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing](https://doi.org/10.4230/lipics.esa.2024.33) | 2024-01-01 | Karl Bringmann, Anita Dürr, Adam Polak |
| 10 | 2 | [Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set](https://doi.org/10.4230/lipics.esa.2024.85) | 2024-01-01 | Lima, Paloma T., Martin Milanič, Peter Muršič et al. |

## Cite this page

Scholar4AI. (2026). ESA: European Symposium on Algorithms — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/esa

```bibtex
@misc{scholar4ai-proceedings-esa,
  author = {{Scholar4AI}},
  title = {ESA: European Symposium on Algorithms — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/esa}},
  urldate = {2026-11-02},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}
```

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).