| 2024 | SODA | Faster Sublinear-Time Edit Distance. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka |
| 2023 | ESA | Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. | Karl Bringmann, Alejandro Cassis |
| 2023 | FOCS | Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! | Karl Bringmann, Alejandro Cassis, Nick Fischer |
| 2023 | FOCS | Optimal Algorithms for Bounded Weighted Edit Distance. | Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz |
| 2022 | ICALP | Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. | Karl Bringmann, Alejandro Cassis |
| 2022 | ICALP | A Structural Investigation of the Approximability of Polynomial-Time Problems. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Knnemann |
| 2022 | ICALP | Improved Sublinear-Time Edit Distance for Preprocessed Strings. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2022 | STOC | Almost-optimal sublinear-time edit distance in the low distance regime. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |