Nick Fischer

78 papers A* 25A 6Journal 43Unranked 3
YearRankTypeTitle / Venue / Authors
2026 A* conf
A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection.
SODA
Amir Abboud, Shyan Akmal, Nick Fischer
2026 J jnl
Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection.
CoRR
Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Künnemann, Xiao Mao, Mirza Redzic
2026 J jnl
Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts.
CoRR
Nick Fischer, Marvin Künnemann, Mirza Redzic
2026 A* conf
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems.
SODA
Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak
2026 J jnl
Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses.
CoRR
Nick Fischer
2025 A conf
A Faster Algorithm for Constrained Correlation Clustering.
STACS
Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
2025 J jnl
A Faster Algorithm for Constrained Correlation Clustering.
CoRR
Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup
2025 A conf
A Simple Algorithm for Trimmed Multipoint Evaluation.
ESA
Nick Fischer, Melvin Kallmayer, Leo Wennmann
2025 J jnl
A Simple Algorithm for Trimmed Multipoint Evaluation.
CoRR
Nick Fischer, Melvin Kallmayer, Leo Wennmann
2025 — conf
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path.
SOSA
Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser
2025 J jnl
A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection.
CoRR
Amir Abboud, Shyan Akmal, Nick Fischer
2025 A* conf
All-Pairs Shortest Paths with Few Weights per Node.
STOC
Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi
2025 J jnl
All-Pairs Shortest Paths with Few Weights per Node.
CoRR
Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi
2025 A* conf
Beating Bellman's Algorithm for Subset Sum.
SODA
Karl Bringmann, Nick Fischer, Vasileios Nakos
2025 A conf
Hardness of Median and Center in the Ulam Metric.
ESA
Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2025 J jnl
Hardness of Median and Center in the Ulam Metric.
CoRR
Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2025 J jnl
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time.
TheoretiCS
Nick Fischer, Leo Wennmann
2025 A* conf
Near-Optimal Directed Low-Diameter Decompositions.
ICALP
Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
2025 J jnl
Near-Optimal Directed Low-Diameter Decompositions.
CoRR
Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
2025 A* conf
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching.
SODA
Nick Fischer, Ce Jin, Yinzhan Xu
2025 A* conf
Recognizing Sumsets is NP-Complete.
SODA
Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer
2025 J jnl
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems.
CoRR
Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak
2025 A* conf
Sumsets, 3SUM, Subset Sum: Now for Real!
SODA
Nick Fischer
2025 A* conf
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs.
ICALP
Nick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß
2025 J jnl
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs.
CoRR
Nick Fischer, Marvin Künnemann, Mirza Redzic, Julian Stieß
2025 J jnl
ℓ
CoRR
Nick Fischer, Vasileios Nakos
2025 A* conf
ℓ2/ℓ2 Sparse Recovery via Weighted Hypergraph Peeling.
FOCS
Nick Fischer, Vasileios Nakos
2024 J jnl
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths.
CoRR
Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser
2024 J jnl
Beating Bellman's Algorithm for Subset Sum.
CoRR
Karl Bringmann, Nick Fischer, Vasileios Nakos
2024 A conf
Deterministic 3SUM-Hardness.
ITCS
Nick Fischer, Piotr Kaliciak, Adam Polak
2024 A* conf
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem.
SODA
Nick Fischer
2024 A* conf
Dynamic Dynamic Time Warping.
SODA
Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
2024 — conf
Faster Combinatorial k-Clique Algorithms.
LATIN (1)
Amir Abboud, Nick Fischer, Yarin Shechter
2024 J jnl
Faster Combinatorial k-Clique Algorithms.
CoRR
Amir Abboud, Nick Fischer, Yarin Shechter
2024 A* conf
Faster Sublinear-Time Edit Distance.
SODA
Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
2024 A* conf
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time.
ICALP
Nick Fischer, Leo Wennmann
2024 J jnl
Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time.
CoRR
Nick Fischer, Leo Wennmann
2024 J jnl
New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching.
CoRR
Nick Fischer, Ce Jin, Yinzhan Xu
2024 A* conf
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms.
STOC
Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2024 J jnl
Recognizing Sumsets is NP-Complete.
CoRR
Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer
2024 J jnl
Sumsets, 3SUM, Subset Sum: Now for Real!
CoRR
Nick Fischer
2024 A* conf
The Effect of Sparsity on
SODA
Nick Fischer, Marvin Künnemann, Mirza Redzic
2024 A* conf
The Time Complexity of Fully Sparse Matrix Multiplication.
SODA
Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
2023 — —
Algorithms for sparse convolution and sublinear edit distance.
Nick Fischer
2023 A conf
Can You Solve Closest String Faster Than Exhaustive Search?
ESA
Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier
2023 J jnl
Can You Solve Closest String Faster than Exhaustive Search?
CoRR
Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier
2023 J jnl
Deterministic 3SUM-Hardness.
CoRR
Nick Fischer, Piotr Kaliciak, Adam Polak
2023 J jnl
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem.
CoRR
Nick Fischer
2023 J jnl
Dynamic Dynamic Time Warping.
CoRR
Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg
2023 J jnl
Faster Sublinear-Time Edit Distance.
CoRR
Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka
2023 A* conf
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
FOCS
Karl Bringmann, Alejandro Cassis, Nick Fischer
2023 J jnl
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
CoRR
Karl Bringmann, Alejandro Cassis, Nick Fischer
2023 J jnl
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms.
CoRR
Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2023 J jnl
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms.
Electron. Colloquium Comput. Complex.
Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka
2023 A* conf
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics.
STOC
Amir Abboud, Karl Bringmann, Nick Fischer
2023 J jnl
The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties.
CoRR
Nick Fischer, Marvin Künnemann, Mirza Redzic
2023 J jnl
The Time Complexity of Fully Sparse Matrix Multiplication.
CoRR
Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Künnemann
2022 A* conf
A Structural Investigation of the Approximability of Polynomial-Time Problems.
ICALP
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
2022 J jnl
A Structural Investigation of the Approximability of Polynomial-Time Problems.
CoRR
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
2022 J jnl
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime.
CoRR
Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022 A* conf
Almost-optimal sublinear-time edit distance in the low distance regime.
STOC
Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022 A* conf
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution.
SODA
Karl Bringmann, Nick Fischer, Vasileios Nakos
2022 J jnl
Faster Minimization of Tardy Processing Time on a Single Machine.
Algorithmica
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2022 A* conf
Improved Sublinear-Time Edit Distance for Preprocessed Strings.
ICALP
Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022 J jnl
Improved Sublinear-Time Edit Distance for Preprocessed Strings.
CoRR
Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos
2022 J jnl
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics.
CoRR
Amir Abboud, Karl Bringmann, Nick Fischer
2021 J jnl
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution.
CoRR
Karl Bringmann, Nick Fischer, Vasileios Nakos
2021 — conf
Fine-Grained Completeness for Optimization in P.
APPROX-RANDOM
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
2021 J jnl
Fine-Grained Completeness for Optimization in P.
CoRR
Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann
2021 J jnl
Sparse Nonnegative Convolution Is Equivalent to Dense Nonnegative Convolution.
CoRR
Karl Bringmann, Nick Fischer, Vasileios Nakos
2021 A* conf
Sparse nonnegative convolution is equivalent to dense nonnegative convolution.
STOC
Karl Bringmann, Nick Fischer, Vasileios Nakos
2020 A* conf
Faster Minimization of Tardy Processing Time on a Single Machine.
ICALP
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2020 J jnl
Faster Minimization of Tardy Processing Time on a Single Machine.
CoRR
Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
2020 J jnl
The Computational Complexity of Plethysm Coefficients.
Comput. Complex.
Nick Fischer, Christian Ikenmeyer
2020 J jnl
The Computational Complexity of Plethysm Coefficients.
CoRR
Nick Fischer, Christian Ikenmeyer
2019 A conf
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties.
CCC
Karl Bringmann, Nick Fischer, Marvin Künnemann
2019 J jnl
Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours.
J. Log. Algebraic Methods Program.
Nick Fischer, Rob van Glabbeek
2018 J jnl
Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours.
CoRR
Nick Fischer, Rob van Glabbeek