vix.ing · top · new · best · stats · spec

Hatzel, Meike

  1. Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite\n Graphs
    2019/02/04 by Meike Hatzel, Roman Rabinovich, Hatzel, Meike +3 · 2 citations
    Computer Science · Mathematics · #Advanced Graph Theory Research #Limits and Structures in Graph Theory #Graph theory and applications
  2. Simpler and faster algorithms for detours in planar digraphs
    2023/01/06 by Meike Hatzel, Konrad Majewski, Hatzel, Meike +5 · 2 citations
    Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Interconnection Networks and Systems #VLSI and FPGA Design Techniques
  3. Avoidable paths in graphs
    2019/08/10 by Bonamy, Marthe, Defrain, Oscar, Hatzel, Meike +1 · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  4. Counterexample to Babai's lonely colour conjecture
    2024/10/07 by Davies, James, Hatzel, Meike, Yepremyan, Liana · 2 citations
    #05C15 #05C25 #05C65 #05E16 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Group Theory (math.GR)
  5. Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
    2024/04/30 by Meike Hatzel, Stephan Kreutzer, Hatzel, Meike +5 · 2 citations
    Computer Science · #05C20 #05C83 #68R10 #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #FOS: Mathematics
  6. Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs
    2025/04/01 by Davies, James, Georgakopoulos, Agelos, Hatzel, Meike +1 · 3 citations
    #Combinatorics (math.CO) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Metric Geometry (math.MG)
  7. On graphs with a simple structure of maximal cliques
    2025/04/23 by J. Pascal Gollin, Gollin, J. Pascal, Meike Hatzel +3 · 2 citations
    Mathematics · Computer Science · #Limits and Structures in Graph Theory #Advanced Graph Theory Research #Complexity and Algorithms in Graphs
  8. On graphs coverable by chubby shortest paths
    2025/03/04 by Hatzel, Meike, Pilipczuk, Michał · 1 citation
    #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics