Fine-Grained Completeness for Optimization in P. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Marvin Künnemann (APPROX-RANDOM, 2021)

Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. - Karl Bringmann; Alejandro Cassis (ICALP, 2022)

A Structural Investigation of the Approximability of Polynomial-Time Problems. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Marvin Künnemann (ICALP, 2022)

Improved Sublinear-Time Edit Distance for Preprocessed Strings. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Vasileios Nakos (ICALP, 2022)

Almost-optimal sublinear-time edit distance in the low distance regime. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Vasileios Nakos (STOC, 2022)

Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. - Karl Bringmann; Alejandro Cassis (ESA, 2023)

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! - Karl Bringmann; Alejandro Cassis; Nick Fischer (FOCS, 2023)

Optimal Algorithms for Bounded Weighted Edit Distance. - Alejandro Cassis; Tomasz Kociumaka; Philip Wellnitz (FOCS, 2023)

Faster Sublinear-Time Edit Distance. - Karl Bringmann; Alejandro Cassis; Nick Fischer; Tomasz Kociumaka (SODA, 2024)

Algorithm Engineering of SSSP with Negative Edge Weights. - Alejandro Cassis; Andreas Karrenbauer; André Nusser; Paolo Luigi Rinaldi (SEA, 2025)