Max Bannach

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 52

Top Topics

Tree Decompositions

Parameterized Complexity

Top Venues

Publications

Max Bannach, Markus Hecher
Structure-Guided Cube-and-Conquer for MaxSAT. NFM (2024)
Max Bannach, Florian Andreas Marwitz, Till Tantau
Faster Graph Algorithms Through DAG Compression. STACS (2024)
Max Bannach, Florian Chudigiewitsch, Till Tantau
On the Descriptive Complexity of Vertex Deletion Problems. MFCS (2024)
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 Companion (2024)
Max Bannach, Florian Chudigiewitsch, Till Tantau
On the Descriptive Complexity of Vertex Deletion Problems. CoRR (2024)
Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
Efficient Enumeration of Markov Equivalent DAGs. AAAI (2023)
Max Bannach, Florian Chudigiewitsch, Till Tantau
Existential Second-Order Logic over Graphs: Parameterized Complexity. IPEC (2023)
Max Bannach, Markus Hecher
Structure-Guided Automated Reasoning. CoRR (2023)
Max Bannach, Malte Skambath, Till Tantau
On the Parallel Parameterized Complexity of MaxSAT Variants. J. Artif. Intell. Res. 78 (2023)
Max Bannach, Florian Chudigiewitsch, Till Tantau
Existential Second-Order Logic Over Graphs: Parameterized Complexity. CoRR (2023)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. J. Mach. Learn. Res. 24 (2023)
Max Bannach, Sebastian Berndt
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. IPEC (2023)
Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
Efficient Enumeration of Markov Equivalent DAGs. CoRR (2023)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
A new constructive criterion for Markov equivalence of MAGs. UAI (2022)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. CoRR (2022)
Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Complete edge-colored permutation graphs. Adv. Appl. Math. 139 (2022)
Max Bannach, Pamela Fleischmann, Malte Skambath
MaxSAT with Absolute Value Functions: A Parameterized Perspective. CoRR (2022)
Max Bannach, Sebastian Berndt
Recent Advances in Positive-Instance Driven Graph Searching. Algorithms 15 (2) (2022)
Max Bannach, Malte Skambath, Till Tantau
On the Parallel Parameterized Complexity of MaxSAT Variants. SAT (2022)
Max Bannach, Pamela Fleischmann, Malte Skambath
MaxSAT with Absolute Value Functions: A Parameterized Perspective. SWAT (2022)
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
Dynamic Kernels for Hitting Sets and Set Packing. Algorithmica 84 (11) (2022)
Max Bannach, Malte Skambath, Till Tantau
On the Parallel Parameterized Complexity of MaxSAT Variants. CoRR (2022)
Max Bannach, Till Tantau
On the Descriptive Complexity of Color Coding. Algorithms 14 (3) (2021)
Tom Hartmann, Max Bannach, Martin Middendorf
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses. IEEE ACM Trans. Comput. Biol. Bioinform. 18 (6) (2021)
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
Dynamic Kernels for Hitting Sets and Set Packing. IPEC (2021)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Recent Advances in Counting and Sampling Markov Equivalent DAGs. KI (2021)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. AAAI (2021)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Extendability of causal graphical models: Algorithms and computational complexity. UAI (2021)
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
PACE Solver Description: Fluid. IPEC (2020)
Max Bannach, Till Tantau
-Circuits. Theory Comput. Syst. 64 (3) (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR (2020)
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
PACE Solver Description: PID^⋆. IPEC (2020)
Max Bannach, Malte Skambath, Till Tantau
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time. SWAT (2020)
Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
Complete Edge-Colored Permutation Graphs. CoRR (2020)
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. CoRR (2020)
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS (2020)
Max Bannach, Malte Skambath, Till Tantau
Towards Work-Efficient Parallel Parameterized Algorithms. CoRR (2019)
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
Dynamic Kernels for Hitting Sets and Set Packing. Electron. Colloquium Comput. Complex. 26 (2019)
Max Bannach, Till Tantau
On the Descriptive Complexity of Color Coding. STACS (2019)
Max Bannach, Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions. Algorithms 12 (8) (2019)
Max Bannach, Malte Skambath, Till Tantau
Towards Work-Efficient Parallel Parameterized Algorithms. WALCOM (2019)
Max Bannach, Sebastian Berndt
Positive-Instance Driven Dynamic Programming for Graph Searching. WADS (2019)
Max Bannach, Till Tantau
On the Descriptive Complexity of Color Coding. CoRR (2019)
Max Bannach, Sebastian Berndt
Positive-Instance Driven Dynamic Programming for Graph Searching. CoRR (2019)
Max Bannach, Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions. CoRR (2018)
Max Bannach, Till Tantau
Computing Kernels in Parallel: Lower and Upper Bounds. IPEC (2018)
Max Bannach, Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions. ESA (2018)
Max Bannach, Till Tantau
Computing Hitting Set Kernels By AC^0-Circuits. CoRR (2018)
Max Bannach, Till Tantau
Computing Hitting Set Kernels By AC^0-Circuits. STACS (2018)
Max Bannach, Till Tantau
Computing Kernels in Parallel: Lower and Upper Bounds. CoRR (2018)
Max Bannach, Sebastian Berndt, Thorsten Ehlers
Jdrasil: A Modular Library for Computing Tree Decompositions. SEA (2017)
Max Bannach, Till Tantau
Parallel Multivariate Meta-Theorems. IPEC (2016)
Max Bannach, Christoph Stockhusen, Till Tantau
Fast Parallel Fixed-parameter Algorithms via Color Coding. IPEC (2015)
Max Bannach, Christoph Stockhusen, Till Tantau
Fast Parallel Fixed-Parameter Algorithms via Color Coding. CoRR (2015)