3 papers
cs.DM2026
Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani +1
In 1996, Reed, Robertson, Seymour and Thomas [Combinatorica 1996] proved Younger's Conjecture, which states that, for all directed graphs , there exists a function such that…
cs.DM2026
Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani +1
In 2015, Kawarabayashi and Kreutzer proved the Directed Grid Theorem - the generalisation of the well-known Excluded Grid Theorem to directed graphs - confirming a conjecture by Re…
cs.CC2025
Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors
Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani +1
In the Vertex Disjoint Paths with Congestion problem, the input consists of a digraph , an integer and pairs of vertices , and the task is to find a set of p…