Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time

Hamm, Thekla

doi:10.4230/LIPIcs.IPEC.2019.20

by Thekla Hamm

Reference:

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

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{Hamm19,
  author    = {Thekla Hamm},
  editor    = {Bart M. P. Jansen and
               Jan Arne Telle},
  title     = {Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in
               Linear Time},
  booktitle = {14th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2019, September 11-13, 2019, Munich, Germany},
  series    = {LIPIcs},
  volume    = {148},
  pages     = {20:1--20:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {10.4230/LIPIcs.IPEC.2019.20">https://doi.org/10.4230/LIPIcs.IPEC.2019.20},
  doi       = {10.4230/LIPIcs.IPEC.2019.20},
  keywords = {nfpc}
}