Nick Fischer

Nick Fischer

Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
 office: Campus E1 4, Room 328
Saarland Informatics Campus
66123 Saarbrücken
 email: Get my email address via email
 phone: +49 681 9325-1028

Research Interests

  • Fine-grained Complexity and Algorithm Design
  • Computational Problems with an "Additive" Flavor (Subset Sum, Convolutions, etc.)

Research Papers

  1. Sparse Nonnegative Convolution is Equivalent to Dense Nonnegative Convolution (submitted)
    Karl Bringmann, Nick Fischer and Vasileios Nakos
  2. A Structural Investigation of the Approximability of Polynomial-Time Problems
    Karl Bringmann, Alejandro Cassis, Nick Fischer and Marvin Künnemann
  3. The Computational Complexity of Plethysm Coefficients (CC 2020)
    Nick Fischer and Christian Ikenmeyer
  4. Faster Minimization of Tardy Processing Time on a Single Machine (ICALP 2020)
    Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz
  5. A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of ∃k∀-Quantified First-Order Graph Properties (CCC 2019)
    Karl Bringmann, Nick Fischer and Marvin Künnemann
  6. Axiomatising Infinitary Probabilistic Weak Bisimilarity of Finite-State Behaviours (JLAMP 2019)
    Nick Fischer and Rob van Glabbeek