---
title: "STACS (A): papers and universities"
description: "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)."
url: https://scholar4ai.com/proceedings/stacs
markdown_url: https://scholar4ai.com/proceedings/stacs.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "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). (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)
---

# 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.

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

## 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)*

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 44 | 42 |
| 2025 | 83 | 82 |
| 2026 | 58 | 57 |

## Sources

*Where OpenAlex lists the papers*

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

## Who publishes there

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

| # | Institution | Papers |
|---:|---|---:|
| 1 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 30 |
| 2 | University of Warsaw | 12 |
| 3 | Université Paris Cité | 11 |
| 4 | [University of Oxford](https://scholar4ai.com/institutions/university-of-oxford.md) | 10 |
| 5 | Institut de Recherche en Informatique Fondamentale | 10 |
| 6 | Helmholtz Center for Information Security | 9 |
| 7 | RWTH Aachen University | 9 |
| 8 | Institut national de recherche en sciences et technologies du numérique | 8 |
| 9 | TU Wien | 8 |
| 10 | University of Leeds | 6 |

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

| # | Country | Papers |
|---:|---|---:|
| 1 | Germany | 61 |
| 2 | France | 40 |
| 3 | United Kingdom | 34 |
| 4 | United States | 24 |
| 5 | Poland | 18 |
| 6 | Netherlands | 17 |
| 7 | India | 16 |
| 8 | Austria | 12 |
| 9 | Denmark | 10 |
| 10 | Japan | 10 |

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

| # | Keyword | Papers |
|---:|---|---:|
| 1 | approximation algorithms | 20 |
| 2 | fixed-parameter tractability | 17 |
| 3 | NP-hardness | 12 |
| 4 | computational complexity | 12 |
| 5 | lower bounds | 12 |
| 6 | parameterized complexity | 11 |
| 7 | graph coloring | 9 |
| 8 | polynomial-time algorithms | 8 |
| 9 | randomized algorithms | 8 |
| 10 | treewidth | 8 |

## Most-cited papers

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

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 5 | [Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite](https://doi.org/10.4230/lipics.stacs.2024.20) | 2024-01-01 | Olivier Bournez A, Riccardo Gozzi |
| 2 | 3 | [Shortest Two Disjoint Paths in Conservative Graphs](https://doi.org/10.1007/s00453-026-01375-7) | 2026-03-21 | Ildikó Schlotter |
| 3 | 3 | [The Complexity of Learning LTL, CTL and ATL Formulas](https://doi.org/10.4230/lipics.stacs.2025.19) | 2025-01-01 | Benjamin Bordais, Neider, Daniel, Roy, Rajarshi |
| 4 | 3 | [Local Certification of Local Properties: Tight Bounds, Trade-Offs, and New Parameters](https://doi.org/10.1137/24m1650041) | 2025-10-03 | Nicolás Bousquet, Laurent Feuilloley, Sébastien Zeitoun |
| 5 | 3 | [Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines](https://doi.org/10.1145/3732772.3733537) | 2025-06-13 | Yann Bourreau, Ananth Narayanan, Alexandre Nolin |
| 6 | 3 | [Brief Announcement: Optimal Deterministic Rendezvous in Labeled Lines](https://doi.org/10.1145/3732772.3733537) | 2025-06-13 | Yann Bourreau, Ananth Narayanan, Alexandre Nolin |
| 7 | 2 | [Metric Dimension and Geodetic Set Parameterized by Vertex Cover](https://doi.org/10.4230/lipics.stacs.2025.33) | 2024-05-02 | Florent Foucaud, Esther Galby, Liana Khazaliya et al. |
| 8 | 2 | [Max Weight Independent Set in sparse graphs with no long claws](https://doi.org/10.1145/3844498) | 2026-09-17 | Tara Abrishami, Maria Chudnovsky, Cemil Dibek et al. |
| 9 | 1 | [The 2-Attractor Problem Is NP-Complete](https://doi.org/10.4230/lipics.stacs.2024.35) | 2024-01-01 | Janosch Fuchs, Philip A. Whittington |
| 10 | 1 | [A faster algorithm for constructing the frequency difference consensus tree](https://doi.org/10.1016/j.jcss.2026.103831) | 2026-06-18 | Jesper Jansson, Wing-Kin Sung, Seyed Ali Tabatabaee et al. |

## 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

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

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