Max Bannach
I am a Research Fellow in Computer Science and Applied Mathematics, currently working on structural graph theory and its applications for highly parallel optimization.
Before joining this team, I was a PostDoc at the Universität zu Lübeck, where I completed my Ph.D. under the supervision of Prof. Dr. Till Tantau. My research interests include parameterized algorithms, descriptive complexity, and logic-based optimization. As someone who works at the intersection of theory and practice, my goal is to integrate the latest theoretical insights into the development of new applications, while using practical insights to refine theoretical frameworks.
My current research focuses on optimization problems with a tree-like structure, using a structural parameter called treewidth. This approach is based on a beautiful result from mathematical logic known as Courselle's theorem, which states that many optimization problems with such a structure can be solved efficiently. I am exploring the potential of this promising technology beyond Earth, with the goal of extending the optimization portfolio of the European Space Agency.
Contact: tni.ase@hcannab.xam
Research at the Advanced Concepts Team
- Marcel Wienöbst, Max Bannach, and Maciej Liśkiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications
Journal of Machine Learning Research 24, no. 213: 1--45 (2023)
[Website] [Code] [Conference Version] [arXiv] - Max Bannach, Florian Chudigiewitsch, and Till Tantau
Existential Second-Order Logic Over Graphs: Parameterized Complexity
IPEC 2023
[Website] [arXiv] - Max Bannach and Sebastian Berndt
The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth
IPEC 2023
[Website] - Max Bannach, Malte Skambath, and Till Tantau
On the Parallel Parameterized Complexity of MaxSAT Variants
Journal of Artificial Intelligence Research
[Website] [Conference Version] [arXiv] - Max Bannach and Markus Hecher
Structure-Guided Automated Reasoning
[arXiv] - Max Bannach and Markus Hecher
Structure-Guided Cube-and-Conquer for MaxSAT
NFM 2024
[Code] - Max Bannach, Florian Andreas Marwitz, and Till Tantau
Faster Graph Algorithms Through DAG Compression
STACS 2024
[Website]
To learn more about my work, please find a list of my publications at dblp or Google Scholar.