50 years Univerity of Lübeck

Dr. Max Bannach

Research


Research Interests

Publications

2021

  • Max Bannach, Till Tantau:
    On the Descriptive Complexity of Color Coding.
    MDPI Algorithms, 2021. Special Issue: Parameterized Complexity and Algorithms for Nonclassical Logics
    Go to website | Show abstract
  • Marcel Wienöbst, Max Bannach, Maciej Liskiewicz:
    Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs.
    In To appear in: AAAI 2021, AAAI Press, 2021.
    Show PDF

2020

  • Max Bannach, Till Tantau:
    Computing Hitting Set Kernels By AC^0-Circuits.
    Theory of Computing Systems, 64(3):374--399, 2020.
    Go to website | Show abstract
  • Max Bannach, Malte Skambath, Till Tantau:
    Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time.
    In Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), LIPIcs, 2020.
    Go to website | Show abstract
  • Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst:
    PACE Solver Description: PID*.
    In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), LIPIcs, 2020.
    Go to website | Show abstract
  • Max Bannach, Sebastian Berndt, Martin Schuster, Marcel Wienöbst:
    PACE Solver Description: Fluid.
    In Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), LIPIcs, 2020.
    Go to website | Show abstract
  • Max Bannach, Sebastian Berndt, Marten Maack, Matthias Mnich, Alexandra Lassota, Malin Rau, Malte Skambath:
    Solving Packing Problems with Few Small Items Using Rainbow Matchings.
    In Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), LIPIcs, 2020.
    Go to website | Go to website | Show abstract
  • Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
    Complete Edge-Colored Permutation Graphs.
    Technical report , , 2020.
    Go to website | Show abstract

2019

  • Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
    Dynamic Kernels for Hitting Sets and Set Packing.
    Technical report , Electronic Colloquium on Computational Complexity, 2019.
    Go to website | Show abstract
  • Max Bannach, Till Tantau:
    On the Descriptive Complexity of Color Coding.
    In Proceedings of STACS 2019, LIPIcs, LIPIcs, 2019.
    Go to website | Show PDF | Show abstract
  • Max Bannach, Sebastian Berndt:
    Positive-Instance Driven Dynamic Programming for Graph Searching.
    In Proceedings of the 16th Algorithms and Data Structures Symposium (WADS 2019), Springer, 2019.
    Show PDF | Show abstract
  • Max Bannach, Sebastian Berndt:
    Practical Access to Dynamic Programming on Tree Decompositions.
    MDPI Algorithms, 2019. Special Issue: New Frontiers in Parameterized Complexity and Algorithms
    Go to website | Show abstract
  • Max Bannach, Malte Skambath, Till Tantau:
    Towards Work-Efficient Parallel Parameterized Algorithms.
    In Proceedings of the 13th International Conference and Workshops on Algorithms and Computation (WALCOM 2019), Springer, 2019.
    Go to website | Show PDF | Show abstract
  • Tom Hartmann, Max Bannach, Martin Middendorf:
    Sorting Signed Permutations by Inverse Tandem Duplication Random Losses.
    In Proceedings of the 17th Asia Pacific Bioinformatics Conference (APBC 2019), , 2019.
    Show PDF | Show abstract
  • Tom Hartmann, Max Bannach, Martin Middendorf:
    Sorting Signed Permutations by Inverse Tandem Duplication Random Losses.
    IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2019.
    Go to website | Show abstract

2018

  • Max Bannach, Till Tantau:
    Computing Hitting Set Kernels By AC^0-Circuits.
    In Proceedings of the 35th International Symposium on Theoretical Aspects of Computer Science, LIPIcs, 2018.
    Go to website | Show PDF | Show abstract
  • Max Bannach, Till Tantau:
    Computing Kernels in Parallel: Lower and Upper Bounds.
    In Proceedings of the 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), LIPIcs, 2018.
    Go to website | Show PDF | Show abstract
  • Max Bannach, Sebastian Berndt:
    Practical Access to Dynamic Programming on Tree Decompositions.
    In Proceedings of the 26th Annual European Symposium on Algorithms, LIPIcs, 2018.
    Go to website | Show PDF | Show abstract
  • Max Bannach, Sebastian Berndt, Thorsten Ehlers, Dirk Nowotka:
    SAT-Encodings of Tree Decompositions.
    In Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions, , 2018.
    Go to website | Show abstract

2017

  • Max Bannach, Sebastian Berndt, Thorsten Ehlers:
    Jdrasil: A Modular Library for Computing Tree Decompositions.
    In International Symposium on Experimental Algorithms (SEA 2017), Volume 75 of LIPIcs, pp. 28:1--28:21. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017.
    Go to website | Show PDF | Show abstract

2016

  • Max Bannach, Till Tantau:
    Parallel Multivariate Meta-Theorems.
    In Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), LIPIcs, 2016.
    Go to website | Show PDF | Show abstract

2015

  • Max Bannach, Christoph Stockhusen, Till Tantau:
    Fast Parallel Fixed-Parameter Algorithms via Color Coding.
    In Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), LIPIcs, 2015.
    Go to website | Show PDF | Show abstract

2014

  • Max Bannach:
    On the Space and Circuit Complexity of Certain Parameterized Problems.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2014.
    Supervised by: Till Tantau, Maciej Liskiewicz.
    Show PDF | Show abstract

2012

  • Max Bannach:
    Berechnungskomplexitäten von Varianten des Subset-Sum-Problems.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2012.
    Supervised by: Till Tantau, Hans-Martin Teichert.
    Show PDF | Show abstract