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

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

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

← All conferences

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)
YearPapersWith affiliations
20241817
20251917
20261918

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S4306463922Papers 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
#InstitutionPapers
1Karlsruhe Institute of Technology11
2Heidelberg University6
3University of Vienna3
4University of Bergen3
5Goethe University Frankfurt2
6Centre National de la Recherche Scientifique2
7University of Bonn2
8Lawrence Berkeley National Laboratory2
9Aarhus University2
10Simula Research Laboratory2
Countries with the most ALENEX papers, 2024–2026
#CountryPapers
1Germany28
2United States6
3Denmark5
4France4
5Austria3
6United Kingdom3
7Norway3
8Australia1
9Switzerland1
10Chile1
Keywords with the most ALENEX papers, 2024–2026
#KeywordPapers
1combinatorial optimization4
2computational geometry4
3local search4
4NP-hardness3
5exact algorithms3
6graph partitioning3
7heuristics3
8parallel algorithms3
9Hungarian algorithm2
10approximation algorithms2

Most-cited papers#

Most-cited ALENEX papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
16Near-Optimal Coverage Path Planning with Turn Costs2024-01-01Dominik Krupke
25Counting Polyominoes, Revisited2024-01-01Gill Barequet, Gil Ben-Shachar
35ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force2024-01-01Hans‐Peter Lehmann, Peter Sanders, Stefan Walzer
44Parallel Unconstrained Local Search for Partitioning Irregular Graphs2024-01-01Nikolai Maas, Lars Gottesbüren, Daniel Seemaier
54A Direct k- Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric2024-01-01Tobias Heuer
63A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order2025-01-01Arne Beines, Michael Kaibel, Philip Mayer et al.
73Covering Rectilinear Polygons with Area-Weighted Rectangles2024-01-01Kathrin Hanauer, Martin P. Seybold, Julian Unterweger
82SpiderDAN: Matching Augmentation in Demand-Aware Networks2025-01-01Aleksander Figiel, Darya Melnyk, André Nichterlein et al.
92Batched k-Mer Lookup on the Spectral Burrows-Wheeler Transform2025-01-01Jarno Alanko, Elena Biagi, Joel Mackenzie et al.
102Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring2025-01-01Kenneth Langedal, Fredrik Manne C

Conferences in the same field#

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

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

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

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