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