On Arithmetically Progressed Suffix Arrays. - Jacqueline W. Daykin; Dominik Köppl; David Kübel; Florian Stober (Stringology, 2020)

On the Average Case of MergeInsertion. - Florian Stober; Armin Weiß (Theory Comput. Syst., 2020)

The Power Word Problem in Graph Products. - Florian Stober; Armin Weiß (DLT, 2022)

Lower Bounds for Sorting 16, 17, and 18 Elements. - Florian Stober; Armin Weiß (ALENEX, 2023)

Geodetic Graphs: Experiments and New Constructions. - Florian Stober; Armin Weiß (CoRR, 2023)

Finite groups with geodetic Cayley graphs. - Murray Elder; Adam Piggott; Florian Stober; Alexander Thumm; Armin Weiß (CoRR, 2024)

On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms. - Jacqueline W. Daykin; Dominik Köppl; David Kübel; Florian Stober (Discret. Appl. Math., 2024)

The Power Word Problem in Graph Products. - Markus Lohrey; Florian Stober; Armin Weiß (Theory Comput. Syst., 2024)

Membership and Conjugacy in Inverse Semigroups. - Lukas Fleischer; Florian Stober; Alexander Thumm; Armin Weiß (ICALP, 2025)

Exact Lower Bounds for the Number of Comparisons in Selection. - Josua Dörrer; Konrad Gendle; Johanna Betz; Julius von Smercek; Andreas Steding; Florian Stober (SEA, 2025)