Scholar4AI Updated 2026-11-02 12:20 UTC+09:00

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. Also as Markdown.

Share: X LinkedIn Bluesky Threads Facebook Reddit Hacker News Hatena LINE Email
Copy:

← All conferences

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)
YearPapersWith affiliations
2024149143
2025211207
2026153152

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S4377196569LIPIcs papers with the DOIs 10.4230/LIPIcs.ICALP.<year>.<n>

Who publishes there#

Institutions with the most ICALP papers, 2024–2026
#InstitutionPapers
1Centre National de la Recherche Scientifique62
2University of Warsaw25
3University of Oxford24
4University of Michigan22
5Massachusetts Institute of Technology22
6Tel Aviv University21
7Université Paris Cité18
8ETH Zurich18
9Institut de Recherche en Informatique Fondamentale18
10University of Copenhagen16
Countries with the most ICALP papers, 2024–2026
#CountryPapers
1United States168
2Germany107
3France81
4United Kingdom74
5Israel53
6China47
7Poland35
8Switzerland34
9Denmark29
10Austria28
Keywords with the most ICALP papers, 2024–2026
#KeywordPapers
1approximation algorithms61
2lower bounds55
3NP-hardness30
4fixed-parameter tractability30
5randomized algorithms27
6parameterized complexity26
7decidability24
8hardness of approximation24
9computational complexity22
10directed graphs21

Most-cited papers#

Most-cited ICALP papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
192Tight Algorithm and Hardness for Submodular Linear Ordering2026-01-01Abboud, Evan, Schwartz, Roy
24Learning Low-Degree Quantum Objects2024-01-01Srinivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez et al.
33A Note on Approximating Weighted Nash Social Welfare with Additive Valuations2025-08-14Yuda Feng, Shi Li
43An FPRAS for Two Terminal Reliability in Directed Acyclic Graphs2024-01-01Weiming Feng, Guo, Heng
53Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time2025-01-01Nathan Claudet, Simon Perdrix
63The Complexity of Computing in Continuous Time: Space Complexity Is Precision2024-01-01Manon Blanc, Olivier Bournez A
73Regular Expressions with Backreferences and Lookaheads Capture NLOG2024-01-01Yuya Uezato
83Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration2024-01-01Shuichi Hirahara, Naoto Ohsaka
93New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths2026-09-28Michal Dory, Sebastian Forster, Yasamin Nazari et al.
103On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words2024-01-01Kebis, Pavol, Florian Luca, Ouaknine, Joël et al.

Conferences in the same field#

SODA · STOC · EC · KR · FOCS · SoCG · CAV · LICS · ESA · ITCS · APPROX/RANDOM · STACS · IJCAR · CCC · GD · SAT · ALENEX

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

@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}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).