Meike Hatzel

From MaRDI portal
Person:1627177



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Braces of Perfect Matching Width 2
(available as arXiv preprint)
N/APaper
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem
(available as arXiv preprint)
N/APaper
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
(available as arXiv preprint)
N/APaper
Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
(available as arXiv preprint)
N/APaper
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs2026-08-11Paper
The Erdős-Pósa property for circle graphs as vertex-minors2026-07-13Paper
On graphs coverable by chubby shortest paths2026-07-10Paper
Cycles of well-linked sets and an elementary bound for the directed grid theorem2026-06-23Paper
Odd coloring graphs with linear neighborhood complexity
(available as arXiv preprint)
2026-01-01Paper
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
(available as arXiv preprint)
2026-01-01Paper
An Erdős-Pósa theorem for cycles and faces of distinct lengths
(available as arXiv preprint)
2026-01-01Paper
A directed flat wall theorem excluding a crossrow grid
(available as arXiv preprint)
2026-01-01Paper
Minimal Cayley graphs with large chromatic number
(available as arXiv preprint)
2026-01-01Paper
Potatoes and Onions
(available as arXiv preprint)
2026-01-01Paper
Graphs with two moplexes
Procedia Computer Science
2025-12-02Paper
Girth in \(\mathsf{GF}(q)\)-representable matroids
Bulletin of the London Mathematical Society
2025-11-27Paper
Unavoidable induced subgraphs in graphs with complete bipartite induced minors
SIAM Journal on Discrete Mathematics
2025-10-29Paper
Braces of perfect matching width 2
The Electronic Journal of Combinatorics
2025-03-25Paper
Bounds on treewidth via excluding disjoint unions of cycles
(available as arXiv preprint)
2025-01-01Paper
On graphs coverable by chubby shortest paths
(available as arXiv preprint)
2025-01-01Paper
Quasi-isometries between graphs with variable edge lengths
(available as arXiv preprint)
2025-01-01Paper
Directed treewidth is closed under taking butterfly minors
(available as arXiv preprint)
2025-01-01Paper
Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
(available as arXiv preprint)
2025-01-01Paper
On graphs with a simple structure of maximal cliques
(available as arXiv preprint)
2025-01-01Paper
The Erdős-Pósa property for circle graphs as vertex-minors
(available as arXiv preprint)
2025-01-01Paper
Unavoidable butterfly minors in digraphs of large cycle rank
(available as arXiv preprint)
2025-01-01Paper
Dualities in graphs and digraphs
Foundations of Computing
2024-11-01Paper
Graphs with at most two moplexes
Journal of Graph Theory
2024-08-30Paper
Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation2024-05-14Paper
Half-integral Erdős-Pósa property for non-null S-T paths
(available as arXiv preprint)
2024-01-01Paper
Erdős-Pósa property of tripods in directed graphs
(available as arXiv preprint)
2024-01-01Paper
Counterexample to Babai's lonely colour conjecture
(available as arXiv preprint)
2024-01-01Paper
Generating strongly 2-connected digraphs
(available as arXiv preprint)
2024-01-01Paper
Constant Congestion Brambles
Discrete Mathematics & Theoretical Computer Science
2023-05-30Paper
Tuza's Conjecture for Threshold Graphs
Discrete Mathematics & Theoretical Computer Science
2023-05-30Paper
Decomposition of (infinite) digraphs along directed 1-separations2023-05-16Paper
On tree decompositions whose trees are minors2023-02-23Paper
Tight bound on treedepth in terms of pathwidth and longest path2023-02-06Paper
Simpler and faster algorithms for detours in planar digraphs2023-01-06Paper
Decomposition of (infinite) digraphs along directed 1-separations
(available as arXiv preprint)
2023-01-01Paper
Encoding CSP into CCS
(available as arXiv preprint)
2021-12-03Paper
Encoding CSP into CCS2021-12-03Paper
Graphs with at most two moplexes2021-06-18Paper
Avoidable paths in graphs
The Electronic Journal of Combinatorics
2020-12-13Paper
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
(available as arXiv preprint)
2020-02-24Paper
Polynomial planar directed grid theorem
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
(available as arXiv preprint)
2019-02-04Paper
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs2018-12-13Paper
On perfect linegraph squares2018-11-22Paper
The minimum shared edges problem on grid-like graphs
(available as arXiv preprint)
2018-01-04Paper
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs
(available as arXiv preprint)
2018-01-01Paper


Research outcomes over time


This page was built for person: Meike Hatzel