Fast Parallel Fixed-parameter Algorithms via Color Coding. - Max Bannach; Christoph Stockhusen; Till Tantau (IPEC, 2015)

Parallel Multivariate Meta-Theorems. - Max Bannach; Till Tantau (IPEC, 2016)

Jdrasil: A Modular Library for Computing Tree Decompositions. - Max Bannach; Sebastian Berndt 001; Thorsten Ehlers (SEA, 2017)

Computing Kernels in Parallel: Lower and Upper Bounds. - Max Bannach; Till Tantau (IPEC, 2018)

Computing Hitting Set Kernels By AC^0-Circuits. - Max Bannach; Till Tantau (STACS, 2018)

Positive-Instance Driven Dynamic Programming for Graph Searching. - Max Bannach; Sebastian Berndt 001 (WADS, 2019)

Towards Work-Efficient Parallel Parameterized Algorithms. - Max Bannach; Malte Skambath; Till Tantau (WALCOM, 2019)

Practical Access to Dynamic Programming on Tree Decompositions. - Max Bannach; Sebastian Berndt 001 (Algorithms, 2019)

Dynamic Kernels for Hitting Sets and Set Packing. - Max Bannach; Zacharias Heinrich; Rüdiger Reischuk; Till Tantau (Electron. Colloquium Comput. Complex., 2019)

Parallele Parametrisierte Algorithmen. - Max Bannach (Ausgezeichnete Informatikdissertationen, 2019)

PACE Solver Description: Fluid. - Max Bannach; Sebastian Berndt 001; Martin Schuster; Marcel Wienöbst (IPEC, 2020)

PACE Solver Description: PID^⋆. - Max Bannach; Sebastian Berndt 001; Martin Schuster; Marcel Wienöbst (IPEC, 2020)

Solving Packing Problems with Few Small Items Using Rainbow Matchings. - Max Bannach; Sebastian Berndt 001; Marten Maack; Matthias Mnich; Alexandra Lassota; Malin Rau; Malte Skambath (MFCS, 2020)

Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time. - Max Bannach; Malte Skambath; Till Tantau (SWAT, 2020)

Computing Hitting Set Kernels By AC0-Circuits. - Max Bannach; Till Tantau (Theory Comput. Syst., 2020)

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (AAAI, 2021)

Recent Advances in Counting and Sampling Markov Equivalent DAGs. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (KI, 2021)

Extendability of causal graphical models: Algorithms and computational complexity. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (UAI, 2021)

On the Descriptive Complexity of Color Coding. - Max Bannach; Till Tantau (Algorithms, 2021)

Sorting Signed Permutations by Inverse Tandem Duplication Random Losses. - Tom Hartmann; Max Bannach; Martin Middendorf (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

MaxSAT with Absolute Value Functions: A Parameterized Perspective. - Max Bannach; Pamela Fleischmann; Malte Skambath (SWAT, 2022)

A new constructive criterion for Markov equivalence of MAGs. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (UAI, 2022)

Complete edge-colored permutation graphs. - Tom Hartmann; Max Bannach; Martin Middendorf; Peter F. Stadler; Nicolas Wieseke; Marc Hellmuth (Adv. Appl. Math., 2022)

Recent Advances in Positive-Instance Driven Graph Searching. - Max Bannach; Sebastian Berndt 001 (Algorithms, 2022)

Efficient Enumeration of Markov Equivalent DAGs. - Marcel Wienöbst; Malte Luttermann; Max Bannach; Maciej Liskiewicz (AAAI, 2023)

PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. - Max Bannach; Sebastian Berndt 001 (IPEC, 2023)

Existential Second-Order Logic over Graphs: Parameterized Complexity. - Max Bannach; Florian Chudigiewitsch; Till Tantau (IPEC, 2023)

On the Parallel Parameterized Complexity of MaxSAT Variants. - Max Bannach; Malte Skambath; Till Tantau (J. Artif. Intell. Res., 2023)

Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. - Marcel Wienöbst; Max Bannach; Maciej Liskiewicz (J. Mach. Learn. Res., 2023)

The Space Optimization Competition: Third Edition. - Max Bannach; Emmanuel Blazquez; Dario Izzo; Giacomo Acciarini; Alexander Hadjiivanov; Gernot Heißel; Rita Mastroianni; Sebastien Origer; Jai Grover; Dominik Dold; Zacharia Rudge (GECCO Companion, 2024)

On Weighted Maximum Model Counting: Complexity and Fragments. - Max Bannach; Markus Hecher (ICTAI, 2024)

PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization. - Max Bannach; Florian Chudigiewitsch; Kim-Manuel Klein; Marcel Wienöbst (IPEC, 2024)

On the Descriptive Complexity of Vertex Deletion Problems. - Max Bannach; Florian Chudigiewitsch; Till Tantau (MFCS, 2024)

Structure-Guided Cube-and-Conquer for MaxSAT. - Max Bannach; Markus Hecher (NFM, 2024)

Faster Graph Algorithms Through DAG Compression. - Max Bannach; Florian Andreas Marwitz; Till Tantau (STACS, 2024)

Certifying Guidance & Control Networks: Uncertainty Propagation to an Event Manifold. - Sebastien Origer; Dario Izzo; Giacomo Acciarini; Francesco Biscani; Rita Mastroianni; Max Bannach; Harry Holt (CoRR, 2024)

Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem. - Dario Izzo; Marcus Märtens; Laurent Beauregard; Max Bannach; Giacomo Acciarini; Emmanuel Blazquez; Alexander Hadjiivanov; Jai Grover; Gernot Heißel; Yuri Shimane; Chit Hong Yam (CoRR, 2024)

Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators. - Max Bannach; Jai Grover; Markus Hecher (NFM, 2025)

Structure-Guided Automated Reasoning. - Max Bannach; Markus Hecher (STACS, 2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? - Max Bannach; Erik D. Demaine; Timothy Gomez; Markus Hecher (CoRR, 2025)