Max Bannach

67 papers A* 4A 8B 16Misc 1Journal 31Unranked 6
YearRankTypeTitle / Venue / Authors
2026 — conf
A Novel Reduction from #SAT to #2SAT Based on Symmetry:
SOSA
Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025 A* conf
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
LICS
Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025 J jnl
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
CoRR
Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher
2025 A* conf
Counting Solutions Under Cardinality Constraints: Structure Counts in Counting.
KR
Max Bannach, Markus Hecher
2025 B conf
PACE Solver Description: UzL Solver for Dominating Set and Hitting Set.
IPEC
Max Bannach, Florian Chudigiewitsch, Marcel Wienöbst
2025 — conf
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators.
NFM
Max Bannach, Jai Grover, Markus Hecher
2025 A conf
Structure-Guided Automated Reasoning.
STACS
Max Bannach, Markus Hecher
2024 J jnl
Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem.
CoRR
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
2024 J jnl
Certifying Guidance & Control Networks: Uncertainty Propagation to an Event Manifold.
CoRR
Sebastien Origer, Dario Izzo, Giacomo Acciarini, Francesco Biscani, Rita Mastroianni, Max Bannach, Harry Holt
2024 A conf
Faster Graph Algorithms Through DAG Compression.
STACS
Max Bannach, Florian Andreas Marwitz, Till Tantau
2024 B conf
On Weighted Maximum Model Counting: Complexity and Fragments.
ICTAI
Max Bannach, Markus Hecher
2024 B conf
On the Descriptive Complexity of Vertex Deletion Problems.
MFCS
Max Bannach, Florian Chudigiewitsch, Till Tantau
2024 J jnl
On the Descriptive Complexity of Vertex Deletion Problems.
CoRR
Max Bannach, Florian Chudigiewitsch, Till Tantau
2024 B conf
PACE Solver Description: UzL Exact Solver for One-Sided Crossing Minimization.
IPEC
Max Bannach, Florian Chudigiewitsch, Kim-Manuel Klein, Marcel Wienöbst
2024 J jnl
Strong Structural Bounds for MaxSAT: The Fine Details of Using Neuromorphic and Quantum Hardware Accelerators.
CoRR
Max Bannach, Jai Grover, Markus Hecher
2024 — conf
Structure-Guided Cube-and-Conquer for MaxSAT.
NFM
Max Bannach, Markus Hecher
2024 — conf
The Space Optimization Competition: Third Edition.
GECCO Companion
Max Bannach, Emmanuel Blazquez, Dario Izzo, Giacomo Acciarini, Alexander Hadjiivanov, Gernot Heißel, Rita Mastroianni, Sebastien Origer, Jai Grover, Dominik Dold, Zacharia Rudge
2023 A* conf
Efficient Enumeration of Markov Equivalent DAGs.
AAAI
Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
2023 J jnl
Efficient Enumeration of Markov Equivalent DAGs.
CoRR
Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz
2023 J jnl
Existential Second-Order Logic Over Graphs: Parameterized Complexity.
CoRR
Max Bannach, Florian Chudigiewitsch, Till Tantau
2023 B conf
Existential Second-Order Logic over Graphs: Parameterized Complexity.
IPEC
Max Bannach, Florian Chudigiewitsch, Till Tantau
2023 J jnl
On the Parallel Parameterized Complexity of MaxSAT Variants.
J. Artif. Intell. Res.
Max Bannach, Malte Skambath, Till Tantau
2023 B conf
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth.
IPEC
Max Bannach, Sebastian Berndt
2023 J jnl
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications.
J. Mach. Learn. Res.
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2023 J jnl
Structure-Guided Automated Reasoning.
CoRR
Max Bannach, Markus Hecher
2022 A conf
A new constructive criterion for Markov equivalence of MAGs.
UAI
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2022 J jnl
Complete edge-colored permutation graphs.
Adv. Appl. Math.
Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2022 J jnl
Dynamic Kernels for Hitting Sets and Set Packing.
Algorithmica
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
2022 — conf
MaxSAT with Absolute Value Functions: A Parameterized Perspective.
SWAT
Max Bannach, Pamela Fleischmann, Malte Skambath
2022 J jnl
MaxSAT with Absolute Value Functions: A Parameterized Perspective.
CoRR
Max Bannach, Pamela Fleischmann, Malte Skambath
2022 A conf
On the Parallel Parameterized Complexity of MaxSAT Variants.
SAT
Max Bannach, Malte Skambath, Till Tantau
2022 J jnl
On the Parallel Parameterized Complexity of MaxSAT Variants.
CoRR
Max Bannach, Malte Skambath, Till Tantau
2022 J jnl
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications.
CoRR
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2022 J jnl
Recent Advances in Positive-Instance Driven Graph Searching.
Algorithms
Max Bannach, Sebastian Berndt
2021 B conf
Dynamic Kernels for Hitting Sets and Set Packing.
IPEC
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
2021 A conf
Extendability of causal graphical models: Algorithms and computational complexity.
UAI
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2021 J jnl
On the Descriptive Complexity of Color Coding.
Algorithms
Max Bannach, Till Tantau
2021 A* conf
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs.
AAAI
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2021 Misc conf
Recent Advances in Counting and Sampling Markov Equivalent DAGs.
KI
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2021 J jnl
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses.
IEEE ACM Trans. Comput. Biol. Bioinform.
Tom Hartmann, Max Bannach, Martin Middendorf
2020 J jnl
Complete Edge-Colored Permutation Graphs.
CoRR
Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth
2020 J jnl
Computing Hitting Set Kernels By AC
Theory Comput. Syst.
Max Bannach, Till Tantau
2020 — conf
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time.
SWAT
Max Bannach, Malte Skambath, Till Tantau
2020 B conf
PACE Solver Description: Fluid.
IPEC
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
2020 B conf
PACE Solver Description: PID^⋆.
IPEC
Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst
2020 J jnl
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs.
CoRR
Marcel Wienöbst, Max Bannach, Maciej Liskiewicz
2020 B conf
Solving Packing Problems with Few Small Items Using Rainbow Matchings.
MFCS
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2020 J jnl
Solving Packing Problems with Few Small Items Using Rainbow Matchings.
CoRR
Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath
2019 J jnl
Dynamic Kernels for Hitting Sets and Set Packing.
Electron. Colloquium Comput. Complex.
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau
2019 A conf
On the Descriptive Complexity of Color Coding.
STACS
Max Bannach, Till Tantau
2019 J jnl
On the Descriptive Complexity of Color Coding.
CoRR
Max Bannach, Till Tantau
2019 — ch.
Parallele Parametrisierte Algorithmen.
Ausgezeichnete Informatikdissertationen
Max Bannach
2019 B conf
Positive-Instance Driven Dynamic Programming for Graph Searching.
WADS
Max Bannach, Sebastian Berndt
2019 J jnl
Positive-Instance Driven Dynamic Programming for Graph Searching.
CoRR
Max Bannach, Sebastian Berndt
2019 J jnl
Practical Access to Dynamic Programming on Tree Decompositions.
Algorithms
Max Bannach, Sebastian Berndt
2019 B conf
Towards Work-Efficient Parallel Parameterized Algorithms.
WALCOM
Max Bannach, Malte Skambath, Till Tantau
2019 J jnl
Towards Work-Efficient Parallel Parameterized Algorithms.
CoRR
Max Bannach, Malte Skambath, Till Tantau
2018 A conf
Computing Hitting Set Kernels By AC^0-Circuits.
STACS
Max Bannach, Till Tantau
2018 J jnl
Computing Hitting Set Kernels By AC^0-Circuits.
CoRR
Max Bannach, Till Tantau
2018 B conf
Computing Kernels in Parallel: Lower and Upper Bounds.
IPEC
Max Bannach, Till Tantau
2018 J jnl
Computing Kernels in Parallel: Lower and Upper Bounds.
CoRR
Max Bannach, Till Tantau
2018 A conf
Practical Access to Dynamic Programming on Tree Decompositions.
ESA
Max Bannach, Sebastian Berndt
2018 J jnl
Practical Access to Dynamic Programming on Tree Decompositions.
CoRR
Max Bannach, Sebastian Berndt
2017 B conf
Jdrasil: A Modular Library for Computing Tree Decompositions.
SEA
Max Bannach, Sebastian Berndt, Thorsten Ehlers
2016 B conf
Parallel Multivariate Meta-Theorems.
IPEC
Max Bannach, Till Tantau
2015 J jnl
Fast Parallel Fixed-Parameter Algorithms via Color Coding.
CoRR
Max Bannach, Christoph Stockhusen, Till Tantau
2015 B conf
Fast Parallel Fixed-parameter Algorithms via Color Coding.
IPEC
Max Bannach, Christoph Stockhusen, Till Tantau