Thekla Hamm. Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany (Bart M. P. Jansen and Jan Arne Telle), volume 148 of LIPIcs, pages 20:1-20:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.