Maurizio Patrignani. Complexity Results for Three-Dimensional Orthogonal Graph Drawing. In Patrick Healy, Nikola S. Nikolov, editors, Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers. Volume 3843 of Lecture Notes in Computer Science, pages 368-379, Springer, 2005. [doi]
Abstract is missing.