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
STACS 2025
[arXiv] - Max Bannach and Markus Hecher
Structure-Guided Cube-and-Conquer for MaxSAT
NFM 2024
[Website] [Code] - Max Bannach, Florian Andreas Marwitz, and Till Tantau
Faster Graph Algorithms Through DAG Compression
STACS 2024
[Website] - Max Bannach, Emmanuel Blazquez, Dario Izzo, Giacomo Acciarini, Alexander Hadjiivanov, Gernot Heißel, Rita Mastroianni, Sebastien Origer, Jai Grover, Dominik Dold, Zacharia Rudge
The Space Optimization Competition: Third Edition
GECCO 2024
[Website] - Max Bannach, Florian Chudigiewitsch, and Till Tantau
On the Descriptive Complexity of Vertex Deletion Problems
[Website] [arXiv] - Max Bannach and Markus Hecher
On Weighted Maximum Model Counting: Complexity and Fragments
ICTAI 2024
[Website] - Max Bannach, Giacomo Acciarini, and Dario Izzo
On the Keplerian TSP and VRP: Benchmarks and Encoding Techniques
IAC 2024
[Website] - Max Bannach, Giacomo Acciarini, Jai Grover, and Dario Izzo
Reliability of Constellations with Inter-Satellite Communication
IAC 2024
[Website] - Sebastien Origer, Dario Izzo, Giacomo Acciarini, Francesco Biscani,
Rita Mastroianni, Max Bannach, and Harry Holt
Certifying Guidance & Control Networks: Uncertainty Propagation to an Event Manifold
IAC 2024
[Website][arXiv] - Dario Izzo, Marcus Märtens, Laurent Beauregard, Max Bannach, Giacomo Acciarini, Emmanuel Blazquez, Alexander Hadjiivanov, Jai Grover, Gernot Heißel, Yuri Shimane, and Chit Hong Yam
Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem
to appear in Astrodynamics 2025
[arXiv] - Max Bannach
Ising Machines With Feasibility Guarantee
SPAICE 2024
[Website][Code] - Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, and Marcel Wienöbs
PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization
IPEC 2024
[Website][Code] - Max Bannach, Jai Grover, and Markus Hecher
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators
[arXiv]
To learn more about my work, please find a list of my publications at dblp or Google Scholar.