Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth (bibtex)
by , , , , ,
Reference:
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by TreewidthBart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill SimonovGraph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II (Michael A. Bekos, Markus Chimani, eds.), volume 14466 of Lecture Notes in Computer Science, pages 203–217, 2023, Springer Verlag.
Bibtex Entry:
@string{springer="Springer Verlag"}
@inproceedings{DBLP:conf/gd/JansenKKLMS23,
  author       = {Bart M. P. Jansen and
                  Liana Khazaliya and
                  Philipp Kindermann and
                  Giuseppe Liotta and
                  Fabrizio Montecchiani and
                  Kirill Simonov},
  editor       = {Michael A. Bekos and
                  Markus Chimani},
  title        = {Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth},
  booktitle    = {Graph Drawing and Network Visualization - 31st International Symposium,
                  {GD} 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023,
                  Revised Selected Papers, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {14466},
  pages        = {203--217},
  publisher    = {Springer},
  year         = {2023},
  keywords  = {ParAI,PGD}, 
  url          = {https://doi.org/10.1007/978-3-031-49275-4\_14},
  doi          = {10.1007/978-3-031-49275-4\_14},
  timestamp    = {Sat, 10 Feb 2024 18:04:44 +0100},
  biburl       = {https://dblp.org/rec/conf/gd/JansenKKLMS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
Powered by bibtexbrowser