Intractability in Graph Drawing and Geometry: FPT Approaches

DOI10.1007/978-3-642-10217-2_5zbMath1267.68123OpenAlexW1635576618MaRDI QIDQ3651531

S. H. Whitesides

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) General topics in the theory of computing (68Q01)

This page was built for publication: Intractability in Graph Drawing and Geometry: FPT Approaches