| 2026 | ESA | Robustifying Sparse Matrix Multiplication. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2026 | ICALP | Node-Weighted Triangles: Faster and Simpler. | Shyan Akmal, Nick Fischer |
| 2026 | SODA | A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. | Amir Abboud, Shyan Akmal, Nick Fischer |
| 2026 | SODA | Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems. | Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak |
| 2026 | STOC | Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. | Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Knnemann, Xiao Mao, Mirza Redzic |
| 2026 | STOC | Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses. | Nick Fischer |
| 2025 | ESA | Hardness of Median and Center in the Ulam Metric. | Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S. |
| 2025 | ESA | A Simple Algorithm for Trimmed Multipoint Evaluation. | Nick Fischer, Melvin Kallmayer, Leo Wennmann |
| 2025 | FOCS | ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling. | Nick Fischer, Vasileios Nakos |
| 2025 | ICALP | Near-Optimal Directed Low-Diameter Decompositions. | Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov |
| 2025 | ICALP | The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. | Nick Fischer, Marvin Knnemann, Mirza Redzic, Julian Stie |
| 2025 | SODA | Recognizing Sumsets is NP-Complete. | Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer |
| 2025 | SODA | Beating Bellman's Algorithm for Subset Sum. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2025 | SODA | New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. | Nick Fischer, Ce Jin, Yinzhan Xu |
| 2025 | SODA | Sumsets, 3SUM, Subset Sum: Now for Real! | Nick Fischer |
| 2025 | STOC | All-Pairs Shortest Paths with Few Weights per Node. | Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi |
| 2025 | STACS | A Faster Algorithm for Constrained Correlation Clustering. | Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup |
| 2024 | ICALP | Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. | Nick Fischer, Leo Wennmann |
| 2024 | LATIN | Faster Combinatorial k-Clique Algorithms. | Amir Abboud, Nick Fischer, Yarin Shechter |
| 2024 | SODA | The Time Complexity of Fully Sparse Matrix Multiplication. | Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Knnemann |
| 2024 | SODA | Faster Sublinear-Time Edit Distance. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka |
| 2024 | SODA | Dynamic Dynamic Time Warping. | Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg |
| 2024 | SODA | Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. | Nick Fischer |
| 2024 | SODA | The Effect of Sparsity on | Nick Fischer, Marvin Knnemann, Mirza Redzic |
| 2024 | STOC | New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. | Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka |
| 2023 | ESA | Can You Solve Closest String Faster Than Exhaustive Search? | Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier |
| 2023 | FOCS | Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! | Karl Bringmann, Alejandro Cassis, Nick Fischer |
| 2023 | STOC | Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. | Amir Abboud, Karl Bringmann, Nick Fischer |
| 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 | SODA | Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. | Karl Bringmann, 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 |
| 2021 | STOC | Sparse nonnegative convolution is equivalent to dense nonnegative convolution. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2020 | ICALP | Faster Minimization of Tardy Processing Time on a Single Machine. | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz |