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

STACS: International Symposium on Theoretical Aspects of Computer Science — papers and institutions, 2024–2026

Papers of STACS, International Symposium on Theoretical Aspects of Computer Science (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#

  • STACS (International Symposium on Theoretical Aspects of Computer Science) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 185 of its papers from 2024–2026 (44 in 2024, 83 in 2025, 58 in 2026).
  • By the countries of the authors' institutions, the most papers come from Germany (61), France (40) and the United Kingdom (34).
  • The institutions with the most papers are Centre National de la Recherche Scientifique (30), University of Warsaw (12) and Université Paris Cité (11).
  • Its most-cited paper of these years is “Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite” (2024), with 5 citations.

Papers per year#

STACS papers per publication year in OpenAlex (–: not in OpenAlex yet)
YearPapersWith affiliations
20244442
20258382
20265857

Sources#

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

Who publishes there#

Institutions with the most STACS papers, 2024–2026
#InstitutionPapers
1Centre National de la Recherche Scientifique30
2University of Warsaw12
3Université Paris Cité11
4University of Oxford10
5Institut de Recherche en Informatique Fondamentale10
6Helmholtz Center for Information Security9
7RWTH Aachen University9
8Institut national de recherche en sciences et technologies du numérique8
9TU Wien8
10University of Leeds6
Countries with the most STACS papers, 2024–2026
#CountryPapers
1Germany61
2France40
3United Kingdom34
4United States24
5Poland18
6Netherlands17
7India16
8Austria12
9Denmark10
10Japan10
Keywords with the most STACS papers, 2024–2026
#KeywordPapers
1approximation algorithms20
2fixed-parameter tractability17
3NP-hardness12
4computational complexity12
5lower bounds12
6parameterized complexity11
7graph coloring9
8polynomial-time algorithms8
9randomized algorithms8
10treewidth8

Most-cited papers#

Most-cited STACS papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
15Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite2024-01-01Olivier Bournez A, Riccardo Gozzi
23Shortest Two Disjoint Paths in Conservative Graphs2026-03-21Ildikó Schlotter
33The Complexity of Learning LTL, CTL and ATL Formulas2025-01-01Benjamin Bordais, Neider, Daniel, Roy, Rajarshi
43Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters2025-10-03Nicolás Bousquet, Laurent Feuilloley, Sébastien Zeitoun
53Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines2025-06-13Yann Bourreau, Ananth Narayanan, Alexandre Nolin
63Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines2025-06-13Yann Bourreau, Ananth Narayanan, Alexandre Nolin
72Metric Dimension and Geodetic Set Parameterized by Vertex Cover2024-05-02Florent Foucaud, Esther Galby, Liana Khazaliya et al.
82Max Weight Independent Set in sparse graphs with no long claws2026-09-17Tara Abrishami, Maria Chudnovsky, Cemil Dibek et al.
91The 2-Attractor Problem Is NP-Complete2024-01-01Janosch Fuchs, Philip A. Whittington
101A faster algorithm for constructing the frequency difference consensus tree2026-06-18Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee et al.

Conferences in the same field#

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

Cite this page

Scholar4AI. (2026). STACS: International Symposium on Theoretical Aspects of Computer Science — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/stacs

@misc{scholar4ai-proceedings-stacs,
  author = {{Scholar4AI}},
  title = {STACS: International Symposium on Theoretical Aspects of Computer Science — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/stacs}},
  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).