HALLO

Biographie

• 2020-heute Doktorand am CISPA Helmholtz-Zentrum für Informationssicherheit und an der Universität des Saarlandes in Saarbrücken
• 2018-2020 Master of Science in Informatik an der Universität des Saarlandes in Saarbrücken
  Titel der Master-Arbeit: Fine-Grained Complexity and Shaving Log-Factors for Regular Expression Pattern Matching and Membership
  
• 2015-2018 Bachelor of Science in Informatik an der Technischen Universität Kaiserslautern (jetzt RPTU Kaiserslautern-Landau)
  Schwerpunkt Algorithmik und Deduktion
  Titel der Bachelor-Arbeit: The Complexity of Formal Language Decision Problems
• 2015 Abitur am Gymnasium in Kusel
• 1995 Geboren

Wissenschaftliche Arbeiten — Scientific Work

Sofern nicht anders angegeben, nur in Englisch verfügbar.
For full list see dblp.org.

• Shining Light on Periodic Dominating Sets in Bounded-Treewidth Graphs
  Joint work with Jakob Greilhuber, and Philip Wellnitz
  Conference version (STACS 2025) | Full version (arXiv)
• Hitting Meets Packing: How Hard Can It Be?
  Joint work with Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, and Karol Węgrzycki
  Full version (arXiv) | Conference version (ESA 2024) | Slides of conference talk
• Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
  Joint work with Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, and Philip Wellnitz
  Journal/Full version of Part I: Algorithmic Results (TALG 2025) | Full version of Part 1: Algorithmic Results (arXiv) | Journal/Full version of Part II: Hardness Results (TOCT 2025) | Full version of Part 2: Hardness Results (arXiv) | Conference version (SODA 2023) | Slides of conference talk
• Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)
  Joint work with Dániel Marx and Govind S. Sankar
  Journal/Full version (Algorithmica 2024) | Full version at arXiv | Conference version (IPEC 2022) | Slides of conference talk
• Domination and Cut Problems on Chordal Graphs with Bounded Leafage
  Joint work with Esther Galby, Dániel Marx, Roohani Sharma, and Prafullkumar Tale
  Journal/Full version (Algorithmica 2024) | Full version (arXiv) | Conference version (IPEC 2022)
• Computing Generalized Convolutions Faster Than Brute Force
  Joint work with Baris Can Esmer, Ariel Kulik, Dániel Marx, and Karol Węgrzycki
  Journal/Full version (Algorithmica 2024) | Full version (arXiv) | Conference version (IPEC 2022) | Slides of conference talk
• Parameterized Complexity of Weighted Multicut in Trees
  Joint work with Esther Galby, Dániel Marx, Roohani Sharma, and Prafullkumar Tale
  Journal/Full version (TCS 2023) | Full version (arXiv) | Conference version (WG 2022) | Slides of conference talk
• Subcubic certificates for CFL reachability
  Joint work with Dmitry Chistikov and Rupack Majumdar
  Full Version (arXiv) | Conference Version (POPL 2022)
• Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
  Joint work with Dániel Marx and Govind S. Sankar
  Conference version (ICALP 2021) | Full version (arXiv) | Slides of conference talk (short talk)
• Fine-Grained Complexity of Regular Expression Pattern Matching and Membership
  Conference version (ESA 2020) | Full version (arXiv) | Slides of conference talk
• Fine-Grained Complexity and Shaving Log-Factors for Regular Expression Pattern Matching and Membership (Master's Thesis, Saarland University, 2020)
  Master's Thesis | Slides | Abstract in English and German
• Foundations of Mathematics: An Introduction to Sets and Types (Seminar, Saarland University, 2019)
  Paper | Slides
• Selected Topics in Fine-Grained Complexity Theory (Seminar, Saarland University, 2018)
  Paper | Slides
• The Complexity of Formal Language Decision Problems (Bachelor's Thesis, TU Kaiserslautern (now RPTU), 2018)
  Bachelor's Thesis | Slides | Abstract in English and German
• The Dafny and Boogie Verification Tools (Software-Seminar, TU Kaiserslautern (now RPTU), 2018)
  Paper | Slides

Was ich in meiner Freizeit mache

• Mitglieder der Freiwilligen Feuerwehr Herchweiler
• Stellvertretender Jugendwart der Jugendfeuerwehr Herchweiler
• 1. Vorsitzender und Lokführer bei der Ostertalbahn

Projekte

• Betreuung von Webseiten verschiedener Organisationen
• Entwicklung von EPL, ein Personal- und Einsatzmanager für die Ostertalbahn

Ehemalige Projekte:

• Design und Entwurf von Plakaten und des Logo der ehemaligen Rockband Complete Rock
• Entwicklung von Software für den Bildungsbereich