Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

Thekla Hamm. Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. In Bart M. P. Jansen, Jan Arne Telle, editors, 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany. Volume 148 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.