Meike Hatzel

47 papers A* 5B 4C 1Journal 34Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem.
CoRR
Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi
2026 A* conf
The Erdős-Pósa property for circle graphs as vertex-minors.
SODA
Rutger Campbell, Jochen Pascal Gollin, Meike Hatzel, O-joung Kwon, Rose McCarty, Sang-il Oum, Sebastian Wiederrecht
2025 J jnl
Bounds on treewidth via excluding disjoint unions of cycles.
CoRR
Meike Hatzel, Chun-Hung Liu, Bruce Reed, Sebastian Wiederrecht
2025 J jnl
Braces of Perfect Matching Width 2.
Electron. J. Comb.
Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
2025 J jnl
Directed treewidth is closed under taking butterfly minors.
CoRR
Gunwoo Kim, Meike Hatzel, Stephan Kreutzer
2025 J jnl
Odd coloring graphs with linear neighborhood complexity.
CoRR
James Davies, Meike Hatzel, Kolja Knauer, Rose McCarty, Torsten Ueckerdt
2025 B conf
On Graphs Coverable by Chubby Shortest Paths.
WG
Meike Hatzel, Michal Pilipczuk
2025 J jnl
On graphs coverable by chubby shortest paths.
CoRR
Meike Hatzel, Michal Pilipczuk
2025 J jnl
On graphs with a simple structure of maximal cliques.
CoRR
Jochen Pascal Gollin, Meike Hatzel, Sebastian Wiederrecht
2025 A* conf
Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs.
SoCG
James Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty
2025 J jnl
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs.
CoRR
James Davies, Agelos Georgakopoulos, Meike Hatzel, Rose McCarty
2025 J jnl
Unavoidable Induced Subgraphs in Graphs with Complete Bipartite Induced Minors.
SIAM J. Discret. Math.
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht
2025 J jnl
Unavoidable butterfly minors in digraphs of large cycle rank.
CoRR
Meike Hatzel, O-joung Kwon, Myounghwan Lee, Sebastian Wiederrecht
2024 J jnl
Computing 𝒮-DAGs and Parity Games.
CoRR
Meike Hatzel, Johannes Schröder
2024 J jnl
Counterexample to Babai's lonely colour conjecture.
CoRR
James Davies, Meike Hatzel, Liana Yepremyan
2024 A* conf
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem.
FOCS
Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi
2024 J jnl
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem.
CoRR
Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi
2024 J jnl
Erdös-Pósa property of tripods in directed graphs.
CoRR
Marcin Brianski, Meike Hatzel, Karolina Okrasa, Michal Pilipczuk
2024 J jnl
Graphs with at most two moplexes.
J. Graph Theory
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2024 J jnl
Half-integral Erdös-Pósa property for non-null
CoRR
Vera Chekan, Colin Geniet, Meike Hatzel, Michal Pilipczuk, Marek Sokolowski, Michal T. Seweryn, Marcin Witkowski
2024 J jnl
On tree decompositions whose trees are minors.
J. Graph Theory
Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, Rose McCarty
2024 J jnl
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path.
Comb.
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2024 J jnl
Unavoidable induced subgraphs in graphs with complete bipartite induced minors.
CoRR
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht
2023 J jnl
Decomposition of (infinite) digraphs along directed 1-separations.
CoRR
Nathan J. Bowler, Florian Gut, Meike Hatzel, Ken-ichi Kawarabayashi, Irene Muzi, Florian Reich
2023 — —
Dualities in graphs and digraphs.
Meike Hatzel
2023 A* conf
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation.
SODA
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2023 — conf
Simpler and faster algorithms for detours in planar digraphs.
SOSA
Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 J jnl
Simpler and faster algorithms for detours in planar digraphs.
CoRR
Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski
2023 J jnl
Tight bound on treedepth in terms of pathwidth and longest path.
CoRR
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak
2022 J jnl
Constant Congestion Brambles.
Discret. Math. Theor. Comput. Sci.
Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
2022 J jnl
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation.
CoRR
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
2022 J jnl
Tuza's Conjecture for Threshold Graphs.
Discret. Math. Theor. Comput. Sci.
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
2021 C conf
Graphs with Two Moplexes.
LAGOS
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2021 J jnl
Graphs with at most two moplexes.
CoRR
Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic
2021 J jnl
Tuza's Conjecture for Threshold Graphs.
CoRR
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
2020 J jnl
Avoidable Paths in Graphs.
Electron. J. Comb.
Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2020 J jnl
Constant Congestion Brambles.
CoRR
Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge
2019 J jnl
Avoidable paths in graphs.
CoRR
Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2019 J jnl
Braces of Perfect Matching Width 2.
CoRR
Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht
2019 B conf
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.
WG
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
2019 J jnl
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs.
CoRR
Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht
2019 A* conf
Polynomial Planar Directed Grid Theorem.
SODA
Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer
2018 B conf
On Perfect Linegraph Squares.
WG
Meike Hatzel, Sebastian Wiederrecht
2017 B conf
The Minimum Shared Edges Problem on Grid-Like Graphs.
WG
Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
2017 J jnl
The Minimum Shared Edges Problem on Grid-like Graphs.
CoRR
Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler
2015 J jnl
Encoding CSP into CCS (Extended Version).
CoRR
Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann
2015 — conf
Encoding CSP into CCS.
EXPRESS/SOS
Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann