Encoding CSP into CCS (Extended Version). - Meike Hatzel; Christoph Wagner; Kirstin Peters; Uwe Nestmann (CoRR, 2015)

Encoding CSP into CCS. - Meike Hatzel; Christoph Wagner; Kirstin Peters; Uwe Nestmann (EXPRESS/SOS, 2015)

The Minimum Shared Edges Problem on Grid-Like Graphs. - Till Fluschnik; Meike Hatzel; Steffen Härtlein; Hendrik Molter; Henning Seidler (WG, 2017)

On Perfect Linegraph Squares. - Meike Hatzel; Sebastian Wiederrecht (WG, 2018)

Polynomial Planar Directed Grid Theorem. - Meike Hatzel; Ken-ichi Kawarabayashi; Stephan Kreutzer (SODA, 2019)

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. - Meike Hatzel; Roman Rabinovich 001; Sebastian Wiederrecht (WG, 2019)

Braces of Perfect Matching Width 2. - Archontia C. Giannopoulou; Meike Hatzel; Sebastian Wiederrecht (CoRR, 2019)

Avoidable Paths in Graphs. - Marthe Bonamy; Oscar Defrain; Meike Hatzel; Jocelyn Thiebaut (Electron. J. Comb., 2020)

Graphs with Two Moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (LAGOS, 2021)

Tuza's Conjecture for Threshold Graphs. - Marthe Bonamy; Lukasz Bozyk; Andrzej Grzesik; Meike Hatzel; Tomás Masarík; Jana Novotná 001; Karolina Okrasa (Discret. Math. Theor. Comput. Sci., 2022)

Constant Congestion Brambles. - Meike Hatzel; Pawel Komosa; Marcin Pilipczuk; Manuel Sorge (Discret. Math. Theor. Comput. Sci., 2022)

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ás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

Simpler and faster algorithms for detours in planar digraphs. - Meike Hatzel; Konrad Majewski; Michal Pilipczuk; Marek Sokolowski 001 (SOSA, 2023)

Decomposition of (infinite) digraphs along directed 1-separations. - Nathan J. Bowler; Florian Gut; Meike Hatzel; Ken-ichi Kawarabayashi; Irene Muzi; Florian Reich (CoRR, 2023)

Dualities in graphs and digraphs. - Meike Hatzel (2023)

Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. - Meike Hatzel; Stephan Kreutzer; Marcelo Garlet Milani; Irene Muzi (FOCS, 2024)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors. - Maria Chudnovsky; Meike Hatzel; Tuukka Korhonen; Nicolas Trotignon; Sebastian Wiederrecht (CoRR, 2024)

Computing 𝒮-DAGs and Parity Games. - Meike Hatzel; Johannes Schröder (CoRR, 2024)

Half-integral Erdös-Pósa property for non-null S-T paths. - Vera Chekan; Colin Geniet; Meike Hatzel; Michal Pilipczuk; Marek Sokolowski 001; Michal T. Seweryn; Marcin Witkowski (CoRR, 2024)

Erdös-Pósa property of tripods in directed graphs. - Marcin Brianski; Meike Hatzel; Karolina Okrasa; Michal Pilipczuk (CoRR, 2024)

Counterexample to Babai's lonely colour conjecture. - James Davies; Meike Hatzel; Liana Yepremyan (CoRR, 2024)

On tree decompositions whose trees are minors. - Pablo Blanco; Linda Cook; Meike Hatzel; Claire Hilaire; Freddie Illingworth; Rose McCarty (J. Graph Theory, 2024)

Graphs with at most two moplexes. - Clément Dallard; Robert Ganian; Meike Hatzel; Matjaz Krnc; Martin Milanic (J. Graph Theory, 2024)

Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. - Meike Hatzel; Gwenaël Joret; Piotr Micek; Marcin Pilipczuk; Torsten Ueckerdt; Bartosz Walczak (Comb., 2024)

Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs. - James Davies; Agelos Georgakopoulos; Meike Hatzel; Rose McCarty (SoCG, 2025)

Bounds on treewidth via excluding disjoint unions of cycles. - Meike Hatzel; Chun-Hung Liu; Bruce Reed; Sebastian Wiederrecht (CoRR, 2025)

On graphs coverable by chubby shortest paths. - Meike Hatzel; Michal Pilipczuk (CoRR, 2025)

Directed treewidth is closed under taking butterfly minors. - Gunwoo Kim; Meike Hatzel; Stephan Kreutzer (CoRR, 2025)

On graphs with a simple structure of maximal cliques. - J. Pascal Gollin; Meike Hatzel; Sebastian Wiederrecht (CoRR, 2025)

Odd coloring graphs with linear neighborhood complexity. - James Davies; Meike Hatzel; Kolja Knauer; Rose McCarty; Torsten Ueckerdt (CoRR, 2025)

Unavoidable butterfly minors in digraphs of large cycle rank. - Meike Hatzel; O-joung Kwon; Myounghwan Lee; Sebastian Wiederrecht (CoRR, 2025)