| 2026 | KR | Counting Complexity of ASP. | Max Bannach, Johannes Klaus Fichte, Johanna Groven, Markus Hecher |
| 2025 | KR | Counting Solutions Under Cardinality Constraints: Structure Counts in Counting. | Max Bannach, Markus Hecher |
| 2025 | LICS | #P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought? | Max Bannach, Erik D. Demaine, Timothy Gomez, Markus Hecher |
| 2025 | STACS | Structure-Guided Automated Reasoning. | Max Bannach, Markus Hecher |
| 2024 | GECCO | The Space Optimization Competition: Third Edition. | Max Bannach, Emmanuel Blazquez, Dario Izzo, Giacomo Acciarini, Alexander Hadjiivanov, Gernot Heiel, Rita Mastroianni, Sebastien Origer, Jai Grover, Dominik Dold, Zacharia Rudge |
| 2024 | ICTAI | On Weighted Maximum Model Counting: Complexity and Fragments. | Max Bannach, Markus Hecher |
| 2024 | MFCS | On the Descriptive Complexity of Vertex Deletion Problems. | Max Bannach, Florian Chudigiewitsch, Till Tantau |
| 2024 | STACS | Faster Graph Algorithms Through DAG Compression. | Max Bannach, Florian Andreas Marwitz, Till Tantau |
| 2023 | AAAI | Efficient Enumeration of Markov Equivalent DAGs. | Marcel Wienbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz |
| 2022 | UAI | A new constructive criterion for Markov equivalence of MAGs. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2022 | SAT | On the Parallel Parameterized Complexity of MaxSAT Variants. | Max Bannach, Malte Skambath, Till Tantau |
| 2021 | AAAI | Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2021 | KI | Recent Advances in Counting and Sampling Markov Equivalent DAGs. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2021 | UAI | Extendability of causal graphical models: Algorithms and computational complexity. | Marcel Wienbst, Max Bannach, Maciej Liskiewicz |
| 2020 | MFCS | Solving Packing Problems with Few Small Items Using Rainbow Matchings. | Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath |
| 2019 | STACS | On the Descriptive Complexity of Color Coding. | Max Bannach, Till Tantau |
| 2019 | WADS | Positive-Instance Driven Dynamic Programming for Graph Searching. | Max Bannach, Sebastian Berndt |
| 2019 | WALCOM | Towards Work-Efficient Parallel Parameterized Algorithms. | Max Bannach, Malte Skambath, Till Tantau |
| 2018 | ESA | Practical Access to Dynamic Programming on Tree Decompositions. | Max Bannach, Sebastian Berndt |
| 2018 | STACS | Computing Hitting Set Kernels By AC^0-Circuits. | Max Bannach, Till Tantau |