default search action
Max Bannach
Person information
- affiliation: University of Lübeck, Germany
- affiliation: European Space Agency, Noordwijk, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Max Bannach
, Emmanuel Blazquez
The Space Optimization Competition: Third Edition. GECCO Companion 2024: 21-22 - [c26]Max Bannach, Florian Chudigiewitsch, Till Tantau:
On the Descriptive Complexity of Vertex Deletion Problems. MFCS 2024: 17:1-17:14 - [c25]Max Bannach
Structure-Guided Cube-and-Conquer for MaxSAT. NFM 2024: 3-20 - [c24]Max Bannach, Florian Andreas Marwitz, Till Tantau:
Faster Graph Algorithms Through DAG Compression. STACS 2024: 8:1-8:18 - [i19]Max Bannach, Florian Chudigiewitsch, Till Tantau:
On the Descriptive Complexity of Vertex Deletion Problems. CoRR abs/2406.18299 (2024) - [i18]Sebastien Origer, Dario Izzo, Giacomo Acciarini, Francesco Biscani, Rita Mastroianni, Max Bannach, Harry Holt:
Certifying Guidance & Control Networks: Uncertainty Propagation to an Event Manifold. CoRR abs/2410.03729 (2024) - 2023
- [j9]Max Bannach
On the Parallel Parameterized Complexity of MaxSAT Variants. J. Artif. Intell. Res. 78 (2023) - [j8]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. J. Mach. Learn. Res. 24: 213:1-213:45 (2023) - [c23]Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz:
Efficient Enumeration of Markov Equivalent DAGs. AAAI 2023: 12313-12320 - [c22]Max Bannach, Florian Chudigiewitsch, Till Tantau:
Existential Second-Order Logic over Graphs: Parameterized Complexity. IPEC 2023: 3:1-3:15 - [c21]Max Bannach, Sebastian Berndt:
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. IPEC 2023: 35:1-35:14 - [i17]Marcel Wienöbst, Malte Luttermann, Max Bannach, Maciej Liskiewicz:
Efficient Enumeration of Markov Equivalent DAGs. CoRR abs/2301.12212 (2023) - [i16]Max Bannach, Florian Chudigiewitsch
Existential Second-Order Logic Over Graphs: Parameterized Complexity. CoRR abs/2310.01134 (2023) - [i15]Max Bannach, Markus Hecher:
Structure-Guided Automated Reasoning. CoRR abs/2312.14620 (2023) - 2022
- [j7]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler
Complete edge-colored permutation graphs. Adv. Appl. Math. 139: 102377 (2022) - [j6]Max Bannach, Zacharias Heinrich
Dynamic Kernels for Hitting Sets and Set Packing. Algorithmica 84(11): 3459-3488 (2022) - [j5]Max Bannach
Recent Advances in Positive-Instance Driven Graph Searching. Algorithms 15(2): 42 (2022) - [c20]Max Bannach, Malte Skambath, Till Tantau:
On the Parallel Parameterized Complexity of MaxSAT Variants. SAT 2022: 19:1-19:19 - [c19]Max Bannach, Pamela Fleischmann, Malte Skambath:
MaxSAT with Absolute Value Functions: A Parameterized Perspective. SWAT 2022: 12:1-12:20 - [c18]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
A new constructive criterion for Markov equivalence of MAGs. UAI 2022: 2107-2116 - [i14]Max Bannach, Pamela Fleischmann, Malte Skambath:
MaxSAT with Absolute Value Functions: A Parameterized Perspective. CoRR abs/2204.12614 (2022) - [i13]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications. CoRR abs/2205.02654 (2022) - [i12]Max Bannach, Malte Skambath, Till Tantau:
On the Parallel Parameterized Complexity of MaxSAT Variants. CoRR abs/2206.01280 (2022) - 2021
- [j4]Max Bannach
On the Descriptive Complexity of Color Coding. Algorithms 14(3): 96 (2021) - [j3]Tom Hartmann
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2177-2188 (2021) - [c17]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. AAAI 2021: 12198-12206 - [c16]Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. IPEC 2021: 7:1-7:18 - [c15]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Recent Advances in Counting and Sampling Markov Equivalent DAGs. KI 2021: 271-275 - [c14]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Extendability of causal graphical models: Algorithms and computational complexity. UAI 2021: 1248-1257 - 2020
- [j2]Max Bannach, Till Tantau
Computing Hitting Set Kernels By AC0-Circuits. Theory Comput. Syst. 64(3): 374-399 (2020) - [c13]Max Bannach
PACE Solver Description: Fluid. IPEC 2020: 27:1-27:3 - [c12]Max Bannach
PACE Solver Description: PID^⋆. IPEC 2020: 28:1-28:4 - [c11]Max Bannach
Solving Packing Problems with Few Small Items Using Rainbow Matchings. MFCS 2020: 11:1-11:14 - [c10]Max Bannach, Malte Skambath, Till Tantau:
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time. SWAT 2020: 9:1-9:16 - [i11]Tom Hartmann
Complete Edge-Colored Permutation Graphs. CoRR abs/2004.07118 (2020) - [i10]Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich
Solving Packing Problems with Few Small Items Using Rainbow Matchings. CoRR abs/2007.02660 (2020) - [i9]Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs. CoRR abs/2012.09679 (2020)
2010 – 2019
- 2019
- [j1]Max Bannach
Practical Access to Dynamic Programming on Tree Decompositions. Algorithms 12(8): 172 (2019) - [c9]Max Bannach, Till Tantau:
On the Descriptive Complexity of Color Coding. STACS 2019: 11:1-11:16 - [c8]Max Bannach
Positive-Instance Driven Dynamic Programming for Graph Searching. WADS 2019: 43-56 - [c7]Max Bannach, Malte Skambath, Till Tantau:
Towards Work-Efficient Parallel Parameterized Algorithms. WALCOM 2019: 341-353 - [p1]Max Bannach:
Parallele Parametrisierte Algorithmen. Ausgezeichnete Informatikdissertationen 2019: 29-38 - [i8]Max Bannach, Till Tantau:
On the Descriptive Complexity of Color Coding. CoRR abs/1901.03364 (2019) - [i7]Max Bannach, Malte Skambath, Till Tantau:
Towards Work-Efficient Parallel Parameterized Algorithms. CoRR abs/1902.07660 (2019) - [i6]Max Bannach, Sebastian Berndt:
Positive-Instance Driven Dynamic Programming for Graph Searching. CoRR abs/1905.01134 (2019) - [i5]Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c6]Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions. ESA 2018: 6:1-6:13 - [c5]Max Bannach, Till Tantau:
Computing Kernels in Parallel: Lower and Upper Bounds. IPEC 2018: 13:1-13:14 - [c4]Max Bannach, Till Tantau:
Computing Hitting Set Kernels By AC^0-Circuits. STACS 2018: 9:1-9:14 - [i4]Max Bannach, Till Tantau:
Computing Hitting Set Kernels By AC^0-Circuits. CoRR abs/1801.00716 (2018) - [i3]Max Bannach, Sebastian Berndt:
Practical Access to Dynamic Programming on Tree Decompositions. CoRR abs/1806.10176 (2018) - [i2]Max Bannach, Till Tantau:
Computing Kernels in Parallel: Lower and Upper Bounds. CoRR abs/1807.03604 (2018) - 2017
- [c3]Max Bannach, Sebastian Berndt, Thorsten Ehlers:
Jdrasil: A Modular Library for Computing Tree Decompositions. SEA 2017: 28:1-28:21 - 2016
- [c2]Max Bannach, Till Tantau:
Parallel Multivariate Meta-Theorems. IPEC 2016: 4:1-4:17 - 2015
- [c1]Max Bannach, Christoph Stockhusen, Till Tantau:
Fast Parallel Fixed-parameter Algorithms via Color Coding. IPEC 2015: 224-235 - [i1]Max Bannach, Christoph Stockhusen, Till Tantau:
Fast Parallel Fixed-Parameter Algorithms via Color Coding. CoRR abs/1509.06984 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: