---
title: "ALENEX (A): papers and universities"
description: "ALENEX (Workshop on Algorithm Engineering and Experiments) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 56 of its papers from 2024–2026 (18 in 2024, 19 in 2025, 19 in 2026). By the countries of the authors' institutions, the most papers come from Germany (28), the United States (6) and Denmark (5)."
url: https://scholar4ai.com/proceedings/alenex
markdown_url: https://scholar4ai.com/proceedings/alenex.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "ALENEX (Workshop on Algorithm Engineering and Experiments) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 56 of its papers from 2024–2026 (18 in 2024, 19 in 2025, 19 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)
---

# ALENEX: Workshop on Algorithm Engineering and Experiments — papers and institutions, 2024–2026

Papers of ALENEX, Workshop on Algorithm Engineering and Experiments (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

- ALENEX (Workshop on Algorithm Engineering and Experiments) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 56 of its papers from 2024–2026 (18 in 2024, 19 in 2025, 19 in 2026).
- By the countries of the authors' institutions, the most papers come from Germany (28), the United States (6) and Denmark (5).
- The institutions with the most papers are Karlsruhe Institute of Technology (11), Heidelberg University (6) and University of Vienna (3).
- Its most-cited paper of these years is “Near-Optimal Coverage Path Planning with Turn Costs” (2024), with 6 citations.

## Papers per year

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

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 18 | 17 |
| 2025 | 19 | 17 |
| 2026 | 19 | 18 |

## Sources

*Where OpenAlex lists the papers*

| OpenAlex source | Which papers |
|---|---|
| [S4306463922](https://openalex.org/S4306463922) | Papers of the volumes titled “<year> Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)” (SIAM), found by DOI through Crossref |

## Who publishes there

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

| # | Institution | Papers |
|---:|---|---:|
| 1 | Karlsruhe Institute of Technology | 11 |
| 2 | Heidelberg University | 6 |
| 3 | University of Vienna | 3 |
| 4 | University of Bergen | 3 |
| 5 | Goethe University Frankfurt | 2 |
| 6 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 2 |
| 7 | University of Bonn | 2 |
| 8 | Lawrence Berkeley National Laboratory | 2 |
| 9 | Aarhus University | 2 |
| 10 | Simula Research Laboratory | 2 |

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

| # | Country | Papers |
|---:|---|---:|
| 1 | Germany | 28 |
| 2 | United States | 6 |
| 3 | Denmark | 5 |
| 4 | France | 4 |
| 5 | Austria | 3 |
| 6 | United Kingdom | 3 |
| 7 | Norway | 3 |
| 8 | Australia | 1 |
| 9 | Switzerland | 1 |
| 10 | Chile | 1 |

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

| # | Keyword | Papers |
|---:|---|---:|
| 1 | combinatorial optimization | 4 |
| 2 | computational geometry | 4 |
| 3 | local search | 4 |
| 4 | NP-hardness | 3 |
| 5 | exact algorithms | 3 |
| 6 | graph partitioning | 3 |
| 7 | heuristics | 3 |
| 8 | parallel algorithms | 3 |
| 9 | Hungarian algorithm | 2 |
| 10 | approximation algorithms | 2 |

## Most-cited papers

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

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 6 | [Near-Optimal Coverage Path Planning with Turn Costs](https://doi.org/10.1137/1.9781611977929.9) | 2024-01-01 | Dominik Krupke |
| 2 | 5 | [Counting Polyominoes, Revisited](https://doi.org/10.1007/s00453-026-01392-6) | 2024-01-01 | Gill Barequet, Gil Ben-Shachar |
| 3 | 5 | [ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force](https://doi.org/10.1137/1.9781611977929.15) | 2024-01-01 | Hans‐Peter Lehmann, Peter Sanders, Stefan Walzer |
| 4 | 4 | [Parallel Unconstrained Local Search for Partitioning Irregular Graphs](https://doi.org/10.1137/1.9781611977929.3) | 2024-01-01 | Nikolai Maas, Lars Gottesbüren, Daniel Seemaier |
| 5 | 4 | [A Direct k- Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric](https://doi.org/10.1137/1.9781611977929.2) | 2024-01-01 | Tobias Heuer |
| 6 | 3 | [A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order](https://doi.org/10.1137/1.9781611978339.3) | 2025-01-01 | Arne Beines, Michael Kaibel, Philip Mayer et al. |
| 7 | 3 | [Covering Rectilinear Polygons with Area-Weighted Rectangles](https://doi.org/10.1137/1.9781611977929.12) | 2024-01-01 | Kathrin Hanauer, Martin P. Seybold, Julian Unterweger |
| 8 | 2 | [SpiderDAN: Matching Augmentation in Demand-Aware Networks](https://doi.org/10.1137/1.9781611978339.10) | 2025-01-01 | Aleksander Figiel, Darya Melnyk, André Nichterlein et al. |
| 9 | 2 | [Batched k-Mer Lookup on the Spectral Burrows-Wheeler Transform](https://doi.org/10.1137/1.9781611978339.8) | 2025-01-01 | Jarno Alanko, Elena Biagi, Joel Mackenzie et al. |
| 10 | 2 | [Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring](https://doi.org/10.1137/1.9781611978339.5) | 2025-01-01 | Kenneth Langedal, Fredrik Manne C |

## Cite this page

Scholar4AI. (2026). ALENEX: Workshop on Algorithm Engineering and Experiments — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/alenex

```bibtex
@misc{scholar4ai-proceedings-alenex,
  author = {{Scholar4AI}},
  title = {ALENEX: Workshop on Algorithm Engineering and Experiments — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/alenex}},
  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/).