Complexity results for three-dimensional orthogonal graph drawing

Marizio Patrignani
Proc. 13th Int. Symp. Graph Drawing (GD 2005), Lecture Notes in Computer Science 3843, Patrick Healy and Nikola S. Nikolov, ed., Springer-Verlag, 2005, pp. 368–379

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!