Volgen
Meike Hatzel
Meike Hatzel
IBS DIMAG, Daejeon, Korea
Geverifieerd e-mailadres voor meikehatzel.com - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
M Hatzel, R Rabinovich, S Wiederrecht
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
202019
Encoding CSP into CCS
M Hatzel, C Wagner, K Peters, U Nestmann
arXiv preprint arXiv:1508.06712, 2015
162015
Polynomial planar directed grid theorem
M Hatzel, K Kawarabayashi, S Kreutzer
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
122019
Avoidable paths in graphs
M Bonamy, O Defrain, M Hatzel, J Thiebaut
arXiv preprint arXiv:1908.03788, 2019
102019
Constant congestion brambles
M Hatzel, P Komosa, M Pilipczuk, M Sorge
Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022
92022
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
M Hatzel, L Jaffke, PT Lima, T Masařík, M Pilipczuk, R Sharma, M Sorge
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
82023
Simpler and faster algorithms for detours in planar digraphs
M Hatzel, K Majewski, M Pilipczuk, M Sokołowski
Symposium on Simplicity in Algorithms (SOSA), 156-165, 2023
52023
Tuza's Conjecture for Threshold Graphs
M Bonamy, Ł Bożyk, A Grzesik, M Hatzel, T Masařík, J Novotná, K Okrasa
Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022
52022
The minimum shared edges problem on grid-like graphs
T Fluschnik, M Hatzel, S Härtlein, H Molter, H Seidler
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
42017
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
M Chudnovsky, M Hatzel, T Korhonen, N Trotignon, S Wiederrecht
arXiv preprint arXiv:2405.01879, 2024
32024
Decomposition of (infinite) digraphs along directed 1-separations
N Bowler, F Gut, M Hatzel, K Kawarabayashi, I Muzi, F Reich
arXiv preprint arXiv:2305.09192, 2023
32023
Dualities in graphs and digraphs
M Hatzel
Universitätsverlag der Technischen Universität Berlin, 2023
32023
Graphs with two moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
Procedia Computer Science 195, 248-256, 2021
32021
Braces of perfect matching width 2
AC Giannopoulou, M Hatzel, S Wiederrecht
arXiv preprint arXiv:1902.06307, 2019
32019
Tight bound on treedepth in terms of pathwidth and longest path
M Hatzel, G Joret, P Micek, M Pilipczuk, T Ueckerdt, B Walczak
Combinatorica 44 (2), 417-427, 2024
22024
On perfect linegraph squares
M Hatzel, S Wiederrecht
International Workshop on Graph-Theoretic Concepts in Computer Science, 252-265, 2018
22018
Graphs with at most two moplexes
C Dallard, R Ganian, M Hatzel, M Krnc, M Milanič
Journal of Graph Theory 107 (1), 38-69, 2024
12024
Half-integral Erd\H{o}s-P\'{o}sa property for non-null - paths
V Chekan, C Geniet, M Hatzel, M Pilipczuk, M Sokołowski, MT Seweryn, ...
arXiv preprint arXiv:2408.16344, 2024
12024
Encoding CSP into CCS (Extended Version)
M Hatzel, C Wagner, K Peters, U Nestmann
arXiv preprint arXiv:1508.01127, 2015
12015
Bounds on treewidth via excluding disjoint unions of cycles
M Hatzel, CH Liu, B Reed, S Wiederrecht
arXiv preprint arXiv:2501.01703, 2025
2025
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20