Publications by Topics

Graphs and Logic

• ■ Advances in Algorithmic Meta Theorems. (Invited Paper)
  With Sebastian Siebertz. Presented at FSTTCS 2024.
• ■ Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
  With Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis and Dimitrios M. Thilikos. Presented at LICS 2024.
• ■ Algorithms and data structures for first-order logic with connectivity under vertex failures.
  With Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz and Szymon Toruńczyk. Presented at ICALP 2022.
• ■ First-Order Logic with Connectivity Operators.
  With Nicole Schirrmacher and Sebastian Siebertz. Presented at CSL 2022 and published in ACM Trans. Cpomput. Log.

Graph Combinatorics

• ■ Lower bounds for dominating set reconfiguration on sparse (directed) graphs.
  With Jona Dirks. Only on arXiv.
• ■ Weighted Treedepth is NP-complete on Graphs of Bounded Degree.
  With Jona Dirks, Nicole Schirrmacher, and Sebastian Siebertz. Only on arXiv.
• ■ Testing H-freeness on sparse graphs, the case of bounded expansion.
  With Samuel Humeau, Mamadou Kanté, Daniel Mock, and Timothé Picavet. Presented at STACS 2026.
• ■ Elimination Distance to Dominated Clusters.
  With Nicole Schirrmacher and Sebastian Siebertz. Presented at MFCS 2025.
• ■ Token Sliding Reconfiguration on DAGs.
  With Jona Dirks. Presented at MFCS 2025.
• ■ Combinatorial and Algorithmic Aspects of Monadic Stability.
  With Jan Dreier, Nikolas Mählmann, Amer E. Mouawad and Sebastian Siebertz. Presented at ISAAC 2022.
• ■ Discrepancy and Sparsity.
  With Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez and Sebastian Siebertz. Published in J. Comb. Theory B.
• ■ Recursive Backdoors for SAT.
  With Nikolas Mählmann and Sebastian Siebertz. Presented at MFCS 2021.
• ■ Elimination Distance to Bounded Degree on Planar Graphs.
  With Alexander Lindermayr and Sebastian Siebertz. Presented at MFCS 2020 and published in Fundamenta Informaticae. Video presentation.

Distributed computing

• ■ Distributed Domination on Sparse Graph Classes.
  With Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez and Sebastian Siebertz. Published in Eur. J. Comb.
• ■ Local planar domination revisited.
  With Ozan Heydt and Sebastian Siebertz. Presented at SIROCCO 2022.
• ■ Constant Round Distributed Domination on Graph Classes with Bounded Expansion.
  With Simeon Kublenz and Sebastian Siebertz. Presented at SIROCCO 2021.
• ■ Parameterized Distributed Complexity Theory: A logical approach.
  With Sebastian Siebertz. Only on arXiv.

Query Enumeration

• ■ Dynamic Query Evaluation Over Structures with Low Degree.
  Only on arXiv.
• ■ Enumeration for FO Queries over Nowhere Dense Graphs.
  With Nicole Schweikardt and Luc Segoufin. Presented at PODS 2018 and published in J. ACM.
• ■ Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion.
  With Luc Segoufin. Presented at ICDT 2017.

All Publications

Journals

• ■ Distributed Domination on Sparse Graph Classes.
  With Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez and Sebastian Siebertz. Published in Eur. J. Comb.
• ■ First-Order Logic with Connectivity Operators.
  With Nicole Schirrmacher and Sebastian Siebertz. Presented at CSL 2022 and published in ACM Trans. Cpomput. Log.
• ■ Discrepancy and Sparsity.
  With Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez and Sebastian Siebertz. Published in J. Comb. Theory B.
• ■ Elimination Distance to Bounded Degree on Planar Graphs.
  With Alexander Lindermayr and Sebastian Siebertz. Presented at MFCS 2020 and published in Fundamenta Informaticae. Video presentation.
• ■ Enumeration for FO Queries over Nowhere Dense Graphs.
  With Nicole Schweikardt and Luc Segoufin. Presented at PODS 2018 and published in J. ACM.

Conferences

• ■ Testing H-freeness on sparse graphs, the case of bounded expansion.
  With Samuel Humeau, Mamadou Kanté, Daniel Mock, and Timothé Picavet. Presented at STACS 2026.
• ■ Elimination Distance to Dominated Clusters.
  With Nicole Schirrmacher and Sebastian Siebertz. Presented at MFCS 2025.
• ■ Token Sliding Reconfiguration on DAGs.
  With Jona Dirks. Presented at MFCS 2025.
• ■ Advances in Algorithmic Meta Theorems. (Invited Paper)
  With Sebastian Siebertz. Presented at FSTTCS 2024.
• ■ Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes.
  With Nicole Schirrmacher, Sebastian Siebertz, Giannos Stamoulis and Dimitrios M. Thilikos. Presented at LICS 2024.
• ■ Combinatorial and Algorithmic Aspects of Monadic Stability.
  With Jan Dreier, Nikolas Mählmann, Amer E. Mouawad and Sebastian Siebertz. Presented at ISAAC 2022.
• ■ Algorithms and data structures for first-order logic with connectivity under vertex failures.
  With Michał Pilipczuk, Nicole Schirrmacher, Sebastian Siebertz and Szymon Toruńczyk. Presented at ICALP 2022.
• ■ First-Order Logic with Connectivity Operators.
  With Nicole Schirrmacher and Sebastian Siebertz. Presented at CSL 2022 and published in ACM Trans. Cpomput. Log.
• ■ Local planar domination revisited.
  With Ozan Heydt and Sebastian Siebertz. Presented at SIROCCO 2022.
• ■ Constant Round Distributed Domination on Graph Classes with Bounded Expansion.
  With Simeon Kublenz and Sebastian Siebertz. Presented at SIROCCO 2021.
• ■ Recursive Backdoors for SAT.
  With Nikolas Mählmann and Sebastian Siebertz. Presented at MFCS 2021.
• ■ Elimination Distance to Bounded Degree on Planar Graphs.
  With Alexander Lindermayr and Sebastian Siebertz. Presented at MFCS 2020 and published in Fundamenta Informaticae. Video presentation.
• ■ Enumeration for FO Queries over Nowhere Dense Graphs.
  With Nicole Schweikardt and Luc Segoufin. Presented at PODS 2018 and published in J. ACM.
• ■ Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion.
  With Luc Segoufin. Presented at ICDT 2017.

Unpublished

• ■ Lower bounds for dominating set reconfiguration on sparse (directed) graphs.
  With Jona Dirks. Only on arXiv.
• ■ Weighted Treedepth is NP-complete on Graphs of Bounded Degree.
  With Jona Dirks, Nicole Schirrmacher, and Sebastian Siebertz. Only on arXiv.
• ■ Parameterized Distributed Complexity Theory: A logical approach.
  With Sebastian Siebertz. Only on arXiv.
• ■ Dynamic Query Evaluation Over Structures with Low Degree.
  Only on arXiv.