1. ongoing

    Braces of Perfect Matching Width 2
    Archontia Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
    arxiv-preprint

  2. 2023

    Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
    Meike Hatzel, Lars Jaffke, Paloma T Lima, Tomáš Masařík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
    SODA 2023
    Simpler and faster algorithms for detours in planar digraphs
    Meike Hatzel, Konrad Majewski, Michał Pilipczuk, Marek Sokołowski
    SOSA 2023

  3. 2022

    Tuza's Conjecture for Threshold Graphs
    Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa
    DMTCS
    Constant Congestion Brambles
    Meike Hatzel, Paweł Komosa, Marcin Pilipczuk, Manuel Sorge
    DMTCS

  4. 2021

    Graphs with at most two moplexes
    Clément Dallard, Robert Ganian, Meike Hatzel, Matjaž Krnc, Martin Milanič
    LAGOS 2021
    Tuza's Conjecture for Threshold Graphs (short version)
    Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel, Tomáš Masařík, Jana Novotná, Karolina Okrasa
    Eurocomb 2021

  5. 2020

    Avoidable paths in graphs
    Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
    Electronic journal of combinatorics

  6. 2019

    Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
    Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
    WG2019
    Polynomial Planar Directed Grid Theorem
    Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer
    SODA2019

  7. 2018

    On Perfect Linegraph Squares
    Meike Hatzel, Sebastian Wiederrecht
    WG2018

  8. 2017

    The Minimum Shared Edges Problem on Grid-like Graphs
    Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
    WG2017

  9. 2015

    Encoding CSP into CCS
    Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann
    EXPRESS/SOS, EPTCS 190: 16, 2015