Meike Hatzel

According to our database, Meike Hatzel authored at least 23 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., April, 2024

Counterexample to Babai's lonely colour conjecture.

James Davies, Meike Hatzel, Liana Yepremyan

CoRR, 2024

Erdös-Pósa property of tripods in directed graphs.

Marcin Brianski, Meike Hatzel, Karolina Okrasa, Michal Pilipczuk

CoRR, 2024

Half-integral Erdös-Pósa property for non-null <i>S</i>-<i>T</i> paths.

Vera Chekan, Colin Geniet, Meike Hatzel, Michal Pilipczuk, Marek Sokolowski, Michal T. Seweryn, Marcin Witkowski

CoRR, 2024

Computing 𝒮-DAGs and Parity Games.

Meike Hatzel, Johannes Schröder

CoRR, 2024

Unavoidable induced subgraphs in graphs with complete bipartite induced minors.

Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht

CoRR, 2024

Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem.

Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Dualities in graphs and digraphs.

Meike Hatzel

PhD thesis, 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

Simpler and faster algorithms for detours in planar digraphs.

Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 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ás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Constant Congestion Brambles.

Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge

Discret. Math. Theor. Comput. Sci., 2022

Tuza's Conjecture for Threshold Graphs.

Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa

Discret. Math. Theor. Comput. Sci., 2022

2021

Graphs with at most two moplexes.

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic

CoRR, 2021

Graphs with Two Moplexes.

Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Avoidable Paths in Graphs.

Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut

Electron. J. Comb., 2020

2019

Braces of Perfect Matching Width 2.

Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht

CoRR, 2019

Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.

Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Polynomial Planar Directed Grid Theorem.

Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

On Perfect Linegraph Squares.

Meike Hatzel, Sebastian Wiederrecht

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

The Minimum Shared Edges Problem on Grid-Like Graphs.

Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2015

Encoding CSP into CCS.

Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann

Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, 2015

Encoding CSP into CCS (Extended Version).

Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann

CoRR, 2015