---
title: "ICALP (A*): papers and universities"
description: "ICALP (International Colloquium on Automata Languages and Programming) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 513 of its papers from 2024–2026 (149 in 2024, 211 in 2025, 153 in 2026). By the countries of the authors' institutions, the most papers come from the United States (168), Germany (107) and France (81)."
url: https://scholar4ai.com/proceedings/icalp
markdown_url: https://scholar4ai.com/proceedings/icalp.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "ICALP (International Colloquium on Automata Languages and Programming) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 513 of its papers from 2024–2026 (149 in 2024, 211 in 2025, 153 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)
---

# ICALP: International Colloquium on Automata Languages and Programming — papers and institutions, 2024–2026

Papers of ICALP, International Colloquium on Automata Languages and Programming (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

- ICALP (International Colloquium on Automata Languages and Programming) is rated A* by the CORE Conference Rankings (ICORE2026); OpenAlex lists 513 of its papers from 2024–2026 (149 in 2024, 211 in 2025, 153 in 2026).
- By the countries of the authors' institutions, the most papers come from the United States (168), Germany (107) and France (81).
- The institutions with the most papers are Centre National de la Recherche Scientifique (62), University of Warsaw (25) and University of Oxford (24).
- Its most-cited paper of these years is “Tight Algorithm and Hardness for Submodular Linear Ordering” (2026), with 92 citations.

## Papers per year

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

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 149 | 143 |
| 2025 | 211 | 207 |
| 2026 | 153 | 152 |

## Sources

*Where OpenAlex lists the papers*

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

## Who publishes there

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

| # | Institution | Papers |
|---:|---|---:|
| 1 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 62 |
| 2 | University of Warsaw | 25 |
| 3 | [University of Oxford](https://scholar4ai.com/institutions/university-of-oxford.md) | 24 |
| 4 | University of Michigan | 22 |
| 5 | Massachusetts Institute of Technology | 22 |
| 6 | [Tel Aviv University](https://scholar4ai.com/institutions/tel-aviv-university.md) | 21 |
| 7 | Université Paris Cité | 18 |
| 8 | ETH Zurich | 18 |
| 9 | Institut de Recherche en Informatique Fondamentale | 18 |
| 10 | University of Copenhagen | 16 |

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

| # | Country | Papers |
|---:|---|---:|
| 1 | United States | 168 |
| 2 | Germany | 107 |
| 3 | France | 81 |
| 4 | United Kingdom | 74 |
| 5 | Israel | 53 |
| 6 | China | 47 |
| 7 | Poland | 35 |
| 8 | Switzerland | 34 |
| 9 | Denmark | 29 |
| 10 | Austria | 28 |

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

| # | Keyword | Papers |
|---:|---|---:|
| 1 | approximation algorithms | 61 |
| 2 | lower bounds | 55 |
| 3 | NP-hardness | 30 |
| 4 | fixed-parameter tractability | 30 |
| 5 | randomized algorithms | 27 |
| 6 | parameterized complexity | 26 |
| 7 | decidability | 24 |
| 8 | hardness of approximation | 24 |
| 9 | computational complexity | 22 |
| 10 | directed graphs | 21 |

## Most-cited papers

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

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 92 | [Tight Algorithm and Hardness for Submodular Linear Ordering](https://doi.org/10.4230/lipics.icalp.2026.4) | 2026-01-01 | Abboud, Evan, Schwartz, Roy |
| 2 | 4 | [Learning Low-Degree Quantum Objects](https://doi.org/10.4230/lipics.icalp.2024.13) | 2024-01-01 | Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez et al. |
| 3 | 3 | [A Note on Approximating Weighted Nash Social Welfare with Additive Valuations](https://doi.org/10.46298/theoretics.25.17) | 2025-08-14 | Yuda Feng, Shi Li |
| 4 | 3 | [An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs](https://doi.org/10.4230/lipics.icalp.2024.62) | 2024-01-01 | Weiming Feng, Guo, Heng |
| 5 | 3 | [Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time](https://doi.org/10.4230/lipics.icalp.2025.59) | 2025-01-01 | Nathan Claudet, Simon Perdrix |
| 6 | 3 | [The Complexity of Computing in Continuous Time: Space Complexity Is Precision](https://doi.org/10.4230/lipics.icalp.2024.129) | 2024-01-01 | Manon Blanc, Olivier Bournez A |
| 7 | 3 | [Regular Expressions with Backreferences and Lookaheads Capture NLOG](https://doi.org/10.4230/lipics.icalp.2024.155) | 2024-01-01 | Yuya Uezato |
| 8 | 3 | [Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration](https://doi.org/10.4230/lipics.icalp.2024.85) | 2024-01-01 | Shuichi Hirahara, Naoto Ohsaka |
| 9 | 3 | [New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths](https://doi.org/10.1007/s00453-026-01407-2) | 2026-09-28 | Michal Dory, Sebastian Forster, Yasamin Nazari et al. |
| 10 | 3 | [On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words](https://doi.org/10.4230/lipics.icalp.2024.144) | 2024-01-01 | Kebis, Pavol, Florian Luca, Ouaknine, Joël et al. |

## Cite this page

Scholar4AI. (2026). ICALP: International Colloquium on Automata Languages and Programming — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/icalp

```bibtex
@misc{scholar4ai-proceedings-icalp,
  author = {{Scholar4AI}},
  title = {ICALP: International Colloquium on Automata Languages and Programming — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/icalp}},
  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/).