@InProceedings{hlineny_et_al:LIPIcs.ISAAC.2024.40,
  author =	{Hlin\v{e}n\'{y}, Petr and Khazaliya, Liana},
  title =	{{Crossing Number Is NP-Hard for Constant Path-Width (And Tree-Width)}},
  booktitle =	{35th International Symposium on Algorithms and Computation (ISAAC 2024)},
  pages =	{40:1--40:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-354-6},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{322},
  editor =	{Mestre, Juli\'{a}n and Wirth, Anthony},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2024.40},
  URN =		{urn:nbn:de:0030-drops-221677},
  doi =		{10.4230/LIPIcs.ISAAC.2024.40},
  annote =	{Keywords: Graph Drawing, Crossing Number, Tree-width, Path-width}
}