Eades, Peter; Symvonis, Antonios; Whitesides, Sue Three-dimensional orthogonal graph drawing algorithms. (English) Zbl 0958.68135 Discrete Appl. Math. 103, No. 1-3, 55-87 (2000). MSC: 68R10 68U05 05C15 PDFBibTeX XMLCite \textit{P. Eades} et al., Discrete Appl. Math. 103, No. 1--3, 55--87 (2000; Zbl 0958.68135) Full Text: DOI
Eades, Peter; Stirk, Charles; Whitesides, Sue The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings. (English) Zbl 1022.68625 Inf. Process. Lett. 60, No. 2, 97-103 (1996). MSC: 68U05 PDFBibTeX XMLCite \textit{P. Eades} et al., Inf. Process. Lett. 60, No. 2, 97--103 (1996; Zbl 1022.68625) Full Text: DOI
Eades, Peter; Whitesides, Sue The logic engine and the realization problem for nearest neighbor graphs. (English) Zbl 0874.68235 Theor. Comput. Sci. 169, No. 1, 23-37 (1996). MSC: 68R10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Theor. Comput. Sci. 169, No. 1, 23--37 (1996; Zbl 0874.68235) Full Text: DOI
Eades, Peter; Whitesides, Sue The realization problem for Euclidean minimum spanning trees is NP-hard. (English) Zbl 0851.68084 Algorithmica 16, No. 1, 60-82 (1996). MSC: 68R10 68Q15 68W10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Algorithmica 16, No. 1, 60--82 (1996; Zbl 0851.68084) Full Text: DOI
Eades, Peter; Whitesides, Sue Nearest neighbour graph realizability is NP-hard. (English) Zbl 1495.68166 Baeza-Yates, Ricardo (ed.) et al., LATIN ’95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3–7, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 911, 245-256 (1995). MSC: 68R10 05C62 68Q17 68U05 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Lect. Notes Comput. Sci. 911, 245--256 (1995; Zbl 1495.68166) Full Text: DOI
Eades, Peter; Whitesides, Sue Drawing graphs in two layers. (English) Zbl 0819.68086 Theor. Comput. Sci. 131, No. 2, 361-374 (1994). MSC: 68R10 68Q25 05C10 PDFBibTeX XMLCite \textit{P. Eades} and \textit{S. Whitesides}, Theor. Comput. Sci. 131, No. 2, 361--374 (1994; Zbl 0819.68086) Full Text: DOI