| Faster knapsack algorithms via bounded monotone min-plus-convolution K Bringmann, A Cassis arXiv preprint arXiv:2205.08493, 2022 | 18 | 2022 |
| Almost-optimal sublinear-time edit distance in the low distance regime K Bringmann, A Cassis, N Fischer, V Nakos Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 10 | 2022 |
| Faster 0-1-knapsack via near-convex min-plus-convolution K Bringmann, A Cassis arXiv preprint arXiv:2305.01593, 2023 | 9 | 2023 |
| Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! K Bringmann, A Cassis, N Fischer 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 8 | 2023 |
| Improved sublinear-time edit distance for preprocessed strings K Bringmann, A Cassis, N Fischer, V Nakos arXiv preprint arXiv:2204.14137, 2022 | 8 | 2022 |
| Optimal algorithms for bounded weighted edit distance A Cassis, T Kociumaka, P Wellnitz 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 4 | 2023 |
| Fine-grained completeness for optimization in P K Bringmann, A Cassis, N Fischer, M Künnemann arXiv preprint arXiv:2107.01721, 2021 | 3 | 2021 |
| A structural investigation of the approximability of polynomial-time problems K Bringmann, A Cassis, N Fischer, M Künnemann arXiv preprint arXiv:2204.11681, 2022 | 2 | 2022 |
| Faster Sublinear-Time Edit Distance K Bringmann, A Cassis, N Fischer, T Kociumaka Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 1 | 2024 |
