Stable gonality is computable. - Ragnar Groot Koerkamp; Marieke van der Wegen (Discret. Math. Theor. Comput. Sci., 2019)

On rainbow-free colourings of uniform hypergraphs. - Ragnar Groot Koerkamp; Stanislav Zivný (Theor. Comput. Sci., 2021)

PACE Solver Description: OCMu64, a Solver for One-Sided Crossing Minimization. - Ragnar Groot Koerkamp; Mees J. de Vries (IPEC, 2024)

A*PA2: Up to 19× Faster Exact Global Alignment. - Ragnar Groot Koerkamp (WABI, 2024)

The {mod-minimizer}: A Simple and Efficient Sampling Algorithm for Long k-Mers. - Ragnar Groot Koerkamp; Giulio Ermanno Pibiri (WABI, 2024)

RagnarGrootKoerkamp/astar-pairwise-aligner. - Ragnar Groot Koerkamp (DROPS Artifacts, 2024)

OCMu64. - Ragnar Groot Koerkamp; Mees J. de Vries (DROPS Artifacts, 2024)

U-Index: A Universal Indexing Framework for Matching Long Patterns. - Lorraine A. K. Ayad; Gabriele Fici; Ragnar Groot Koerkamp; Grigorios Loukides; Rob Patro; Giulio Ermanno Pibiri; Solon P. Pissis (SEA, 2025)

PtrHash: Minimal Perfect Hashing at RAM Throughput. - Ragnar Groot Koerkamp (SEA, 2025)

SimdMinimizers: Computing Random Minimizers, fast. - Ragnar Groot Koerkamp; Igor Martayan (SEA, 2025)

Compressing Suffix Trees by Path Decompositions. - Ruben Becker; Davide Cenzato; Travis Gagie; Sung-Hwan Kim; Ragnar Groot Koerkamp; Giovanni Manzini; Nicola Prezza (CoRR, 2025)

The open-closed mod-minimizer algorithm. - Ragnar Groot Koerkamp; Daniel Liu; Giulio Ermanno Pibiri (Algorithms Mol. Biol., 2025)