| Jdrasil: A modular library for computing tree decompositions M Bannach, S Berndt, T Ehlers 16th International Symposium on Experimental Algorithms (SEA 2017), 2017 | 32 | 2017 |
| Fast parallel fixed-parameter algorithms via color coding M Bannach, C Stockhusen, T Tantau arXiv preprint arXiv:1509.06984, 2015 | 32 | 2015 |
| Polynomial-time algorithms for counting and sampling Markov equivalent dags M Wienöbst, M Bannach, M Liskiewicz Proceedings of the AAAI Conference on Artificial Intelligence 35 (13), 12198 …, 2021 | 24 | 2021 |
| Practical access to dynamic programming on tree decompositions M Bannach, S Berndt Algorithms 12 (8), 172, 2019 | 23 | 2019 |
| Extendability of causal graphical models: Algorithms and computational complexity M Wienöbst, M Bannach, M Liśkiewicz Uncertainty in Artificial Intelligence, 1248-1257, 2021 | 16 | 2021 |
| Computing hitting set kernels by AC0-circuits M Bannach, T Tantau Theory of Computing Systems 64 (3), 374-399, 2020 | 14 | 2020 |
| Parallel multivariate meta-theorems M Bannach, T Tantau 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017 | 14 | 2017 |
| Positive-instance driven dynamic programming for graph searching M Bannach, S Berndt Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 11 | 2019 |
| Computing kernels in parallel: Lower and upper bounds M Bannach, T Tantau arXiv preprint arXiv:1807.03604, 2018 | 9 | 2018 |
| Dynamic kernels for hitting sets and set packing M Bannach, Z Heinrich, R Reischuk, T Tantau Algorithmica 84 (11), 3459-3488, 2022 | 5 | 2022 |
| On the descriptive complexity of color coding M Bannach, T Tantau Algorithms 14 (3), 96, 2021 | 5 | 2021 |
| Solving packing problems with few small items using rainbow matchings M Bannach, S Berndt, M Maack, M Mnich, A Lassota, M Rau, M Skambath arXiv preprint arXiv:2007.02660, 2020 | 4 | 2020 |
| Kernelizing the hitting set problem in linear sequential and constant parallel time M Bannach, M Skambath, T Tantau 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), 2020 | 4 | 2020 |
| A new constructive criterion for markov equivalence of mags M Wienöbst, M Bannach, M Liśkiewicz Uncertainty in Artificial Intelligence, 2107-2116, 2022 | 3 | 2022 |
| Complete edge-colored permutation graphs T Hartmann, M Bannach, M Middendorf, PF Stadler, N Wieseke, ... Advances in Applied Mathematics 139, 102377, 2022 | 3 | 2022 |
| PACE Solver Description: PID^⋆ M Bannach, S Berndt, M Schuster, M Wienöbst 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020 | 3 | 2020 |
| Towards work-efficient parallel parameterized algorithms M Bannach, M Skambath, T Tantau WALCOM: Algorithms and Computation: 13th International Conference, WALCOM …, 2019 | 3 | 2019 |
| SAT-encodings of tree decompositions M Bannach, S Berndt, T Ehlers, D Nowotka SAT COMPETITION 2018, 72, 2018 | 3 | 2018 |
| Efficient enumeration of Markov equivalent DAGs M Wienöbst, M Luttermann, M Bannach, M Liskiewicz Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 12313 …, 2023 | 2 | 2023 |
| Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications M Wienöbst, M Bannach, M Liśkiewicz Journal of Machine Learning Research 24 (213), 1-45, 2023 | 2 | 2023 |
