50 years Univerity of Lübeck

Institute for Theoretical Computer Science

Publications 2019


Journal articles

  • 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
  • Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
    The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets.
    Discrete Applied Mathematics, 257:101-114, 2019.
    Go to website
  • 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
  • Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Proper learning of k-term DNF formulas from satisfying assignments.
    Journal of Computer and System Sciences, 106:129-144, 2019.
    Go to website | Show abstract
  • Benito van der Zander, Maciej Liskiewicz, Johannes Textor:
    Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework.
    Artificial Intelligence, Vol. 270, Pages 1-40, (270):1-40, 2019.
    Go to website

Conference papers

  • 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, 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
  • Benito van der Zander, Maciej Liskiewicz:
    Finding minimal d-separators in linear time and applications.
    In Proceedings of the 35th Conference on Uncertainty in Artificial Intelligence (UAI'19), AUAI Press, 2019 (to appear).

Masters theses

  • Zacharias Heinrich:
    Dynamische Kernelisierungen für Vertex Cover und Hitting Set.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2019.
    Supervised by: Rüdiger Reischuk, Till Tantau.
  • Hannes Kallwies:
    Efficient Code Generation for Stream-based Specifications.
    Universität zu Lübeck, Institut für Softwaretechnik und Programmiersprachen, 2019.
    Supervised by: Martin Leucker, Till Tantau.
  • Claudius Potts:
    Steganography in Print-Scan Documents.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2019.
    Supervised by: Rüdiger Reischuk, Thomas Eisenbarth.
  • Marcel Wienöbst:
    Constraint-based causal structure learning exploiting low-order conditional independences.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2019.
    Supervised by: Maciej Liskiewicz, Ralf Möller.

Bachelors theses

  • Fabian Grieser:
    Algorithms for the Feedback Arc Set Problem.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2019.
    Supervised by: Rüdiger Reischuk, Heiko Hamann.
  • Himon Herpens:
    Aggregation on the shortest path in a Kilobot swarm.
    Universität zu Lübeck, Institut für Technische Informatik, 2019.
    Supervised by: Heiko Hamann, Rüdiger Reischuk.
  • Seves Martenstein:
    Der Genetische Code und seine Optimierung statistisch untersucht.
    Universität zu Lübeck, Institut für Neuro- und Bioinformatik, 2019.
    Supervised by: Amir Madany Mamlouk, Till Tantau.
  • Stefan Tran:
    Experimental analysis of algorithm substitution attacks.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2019.
    Supervised by: Maciej Liskiewicz, Thomas Eisenbarth.
  • Vincent Wolf:
    Implementierung und Benchmarking eines exakten kombinatorischen Algorithmus für eine minimale Graph Bisektion.
    Universität zu Lübeck, Institut für Theoretische Informatik, 2019.
    Supervised by: Maciej Liskiewicz, Ralf Möller.