Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)

Hlinený, Petr; Khazaliya, Liana

doi:10.4230/LIPICS.ISAAC.2024.40

by Petr Hlinený, Liana Khazaliya

Reference:

Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)Petr Hlinený, Liana Khazaliya35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia (Julián Mestre, Anthony Wirth, eds.), volume 322 of LIPIcs, pages 40:1–40:15, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{HlinenyK24,
  author       = {Petr Hlinen{\'{y}} and
                  Liana Khazaliya},
  editor       = {Juli{\'{a}}n Mestre and
                  Anthony Wirth},
  title        = {Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)},
  booktitle    = {35th International Symposium on Algorithms and Computation, {ISAAC}
                  2024, December 8-11, 2024, Sydney, Australia},
  series       = {LIPIcs},
  volume       = {322},
  pages        = {40:1--40:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2024.40},
  doi          = {10.4230/LIPICS.ISAAC.2024.40},
  timestamp    = {Wed, 04 Dec 2024 17:11:34 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/HlinenyK24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org},
  keywords = {ParAI}
}