Intractability in Graph Drawing and Geometry: FPT Approaches

Sue Whitesides. Intractability in Graph Drawing and Geometry: FPT Approaches. In Jirí Fiala, Jan Kratochvíl, Mirka Miller, editors, Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers. Volume 5874 of Lecture Notes in Computer Science, pages 20-23, Springer, 2009. [doi]

@inproceedings{Whitesides09,
  title = {Intractability in Graph Drawing and Geometry: FPT Approaches},
  author = {Sue Whitesides},
  year = {2009},
  doi = {10.1007/978-3-642-10217-2_5},
  url = {http://dx.doi.org/10.1007/978-3-642-10217-2_5},
  tags = {graph-rewriting, rewriting, systematic-approach},
  researchr = {https://researchr.org/publication/Whitesides09},
  cites = {0},
  citedby = {0},
  pages = {20-23},
  booktitle = {Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers},
  editor = {Jirí Fiala and Jan Kratochvíl and Mirka Miller},
  volume = {5874},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-10216-5},
}