The Directed Flat Wall Theorem

DOI10.1137/1.9781611975994.15MaRDI QIDQ5146780zbMATH OpenOpenAlexFDO

Authors Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.15

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(10)

• A relaxation of the directed disjoint paths problem: a global congestion metric helps
• Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
• Graph theory. Abstracts from the workshop held January 2--8, 2022
• Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
• Adapting the directed grid theorem into an FPT algorithm
• Complete directed minors and chromatic number
• Excluding a planar matching minor in bipartite graphs
• A more accurate view of the flat wall theorem
• On digraphs without onion star immersions
• Polynomial kernel for immersion hitting in tournaments

This page was built for publication: The Directed Flat Wall Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146780)