A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties. - Karl Bringmann; Nick Fischer; Marvin Künnemann (CCC, 2019)

Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours. - Nick Fischer; Rob van Glabbeek (J. Log. Algebraic Methods Program., 2019)

The Computational Complexity of Plethysm Coefficients. - Nick Fischer; Christian Ikenmeyer (Comput. Complex., 2020)

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

Sparse nonnegative convolution is equivalent to dense nonnegative convolution. - Karl Bringmann; Nick Fischer; Vasileios Nakos (STOC, 2021)

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)

Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. - Karl Bringmann; Nick Fischer; Vasileios Nakos (SODA, 2022)

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

Faster Minimization of Tardy Processing Time on a Single Machine. - Karl Bringmann; Nick Fischer; Danny Hermelin; Dvir Shabtay; Philip Wellnitz (Algorithmica, 2022)

Can You Solve Closest String Faster Than Exhaustive Search? - Amir Abboud; Nick Fischer; Elazar Goldenberg; Karthik C. S. 001; Ron Safier (ESA, 2023)

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

Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. - Amir Abboud; Karl Bringmann; Nick Fischer (STOC, 2023)

The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. - Nick Fischer; Marvin Künnemann; Mirza Redzic (CoRR, 2023)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. - Amir Abboud; Nick Fischer; Zander Kelley; Shachar Lovett; Raghu Meka (Electron. Colloquium Comput. Complex., 2023)

Algorithms for sparse convolution and sublinear edit distance. - Nick Fischer (2023)

Deterministic 3SUM-Hardness. - Nick Fischer; Piotr Kaliciak; Adam Polak 001 (ITCS, 2024)

Faster Combinatorial k-Clique Algorithms. - Amir Abboud; Nick Fischer; Yarin Shechter (LATIN (1), 2024)

The Time Complexity of Fully Sparse Matrix Multiplication. - Amir Abboud; Karl Bringmann; Nick Fischer; Marvin Künnemann (SODA, 2024)

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

Dynamic Dynamic Time Warping. - Karl Bringmann; Nick Fischer; Ivor van der Hoog; Evangelos Kipouridis; Tomasz Kociumaka; Eva Rotenberg (SODA, 2024)

Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem. - Nick Fischer (SODA, 2024)

The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties. - Nick Fischer; Marvin Künnemann; Mirza Redzic (SODA, 2024)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths. - Nick Fischer; Bernhard Haeupler; Rustam Latypov; Antti Roeyskoe; Aurelio L. Sulser (CoRR, 2024)

Near-Optimal Directed Low-Diameter Decompositions. - Karl Bringmann; Nick Fischer; Bernhard Haeupler; Rustam Latypov (ICALP, 2025)

The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs. - Nick Fischer; Marvin Künnemann; Mirza Redzic; Julian Stieß (ICALP, 2025)

Recognizing Sumsets is NP-Complete. - Amir Abboud; Nick Fischer; Ron Safier; Nathan Wallheimer (SODA, 2025)

Beating Bellman's Algorithm for Subset Sum. - Karl Bringmann; Nick Fischer; Vasileios Nakos (SODA, 2025)

New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. - Nick Fischer; Ce Jin 001; Yinzhan Xu (SODA, 2025)

Sumsets, 3SUM, Subset Sum: Now for Real! - Nick Fischer (SODA, 2025)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path. - Nick Fischer; Bernhard Haeupler; Rustam Latypov; Antti Roeyskoe; Aurelio L. Sulser (SOSA, 2025)

A Faster Algorithm for Constrained Correlation Clustering. - Nick Fischer; Evangelos Kipouridis; Jonas Klausen; Mikkel Thorup (STACS, 2025)

All-Pairs Shortest Paths with Few Weights per Node. - Amir Abboud; Nick Fischer; Ce Jin 001; Virginia Vassilevska Williams; Zoe Xi (STOC, 2025)

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time. - Nick Fischer; Leo Wennmann (TheoretiCS, 2025)

Hardness of Median and Center in the Ulam Metric. - Nick Fischer; Elazar Goldenberg; Mursalin Habib; Karthik C. S. 001 (CoRR, 2025)

A Simple Algorithm for Trimmed Multipoint Evaluation. - Nick Fischer; Melvin Kallmayer; Leo Wennmann (CoRR, 2025)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. - Amir Abboud; Shyan Akmal; Nick Fischer (CoRR, 2025)