Meike Hatzel

According to our database, Meike Hatzel authored at least 9 papers between 2015 and 2020.

Collaborative distances:

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

2020

Constant Congestion Brambles.

Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge

CoRR, 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