{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T09:49:04Z","timestamp":1747907344181},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:09Z","timestamp":1330295889000},"page":"139-154","source":"Crossref","is-referenced-by-count":17,"title":["Two algorithms for three dimensional orthogonal graph drawing"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"S. Bhatt","year":"1987","unstructured":"S. Bhatt, S. Cosmadakis, \u201cThe Complexity of Minimizing Wire Lengths in VLSI Layouts\u201d, Information Processing Letters, Vol. 25, 1987, pp. 263\u2013267.","journal-title":"Information Processing Letters"},{"key":"12_CR3","unstructured":"T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant, \u201cA Better Heuristic for Orthogonal Graph Drawings\u201d, Proc. 2 nd European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science, Vol. 855, Springer Verlag, 1994, pp. 24\u201335.","DOI":"10.1007\/BFb0049394"},{"key":"12_CR5","unstructured":"T. Biedl, \u201cNew Lower Bounds for Orthogonal Graph Drawings\u201d, Graph Drawing, Lecture Notes in Computer Science, Vol. 1027, Springer Verlag, 1995, pp. 28\u201339."},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, North Holland, Amsterdam, 1976."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. DiBattista","year":"1994","unstructured":"G. DiBattista, P. Eades, R. Tamassia, I. Tollis, \u201cAlgorithms for Drawing Graphs: An Annotated Bibliography\u201d, Computational Geometry: Theory and Applications, Vol. 4, 1994, pp. 235\u2013282.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"12_CR8","first-page":"147","volume-title":"Advances in Computing Research 2","author":"D. Dolev","year":"1984","unstructured":"D. Dolev, F. T. Leighton, H. Trickey, \u201cPlanar Embeddings of Planar Graphs\u201d, Advances in Computing Research 2 (ed. F. P. Preparata), JAI Press Inc., Greenwich CT, USA, 1984, pp. 147\u2013161."},{"key":"12_CR9","volume-title":"TR 95-07, Dept. of Computer Science","author":"P. Eades","year":"1995","unstructured":"P. Eades, C. Stirk, S. Whitesides, The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawings, TR 95-07, Dept. of Computer Science, University of Newcastle NSW, Australia, October 1995."},{"key":"12_CR10","unstructured":"Shimon Even, Graph Algorithms, Computer Science Press, 1979."},{"key":"12_CR11","unstructured":"S. Even and G. Granot, \u201cRectilinear Planar Drawings with Few Bends in Each Edge\u201d, Technical Report 797, Computer Science Department, Technion, 1994."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"A. Garg, R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, TR CS-94-10, Dept. of Computer Science, Brown University, 1994.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall, \u201cOn Representation of Subsets\u201d, J. London Mathematical Society, Vol. 10, 1935, pp. 26\u201330.","journal-title":"J. London Mathematical Society"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft, R. M. Karp, \u201cAn n 5\/2 Algorithm for Maximum Matchings in Bipartite Graphs\u201d, SIAM J. Comput., Vol. 2 (4), 1973, pp. 225\u2013231.","journal-title":"SIAM J. Comput."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Goos Kant, \u201cDrawing Planar Graphs Using the lmc-Ordering\u201d, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"12_CR16","unstructured":"A. N. Komolgorov, Ya. M. Bardzin, \u201cAbout Realisation of Sets in in 3-Dimensional Space\u201d, Problems in Cybernetics, March 1967, pp. 261\u2013268."},{"key":"12_CR17","unstructured":"A. Papakostas and I. Tollis, \u201cA Pairing Technique for Area-Efficient Orthogonal Drawings\u201d, these proceedings."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01744565","volume":"16","author":"F. P. Preparata","year":"1983","unstructured":"F. P. Preparata, \u201cOptimal Three-Dimensional VLSI Layouts\u201d, Mathematical Systems Theory, Vol. 16, 1983, pp.1\u20138.","journal-title":"Mathematical Systems Theory"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"A. L. Rosenberg, \u201cThree-Dimensional Integrated Circuitry\u201d, Advanced Research in VLSI (eds. Kung, Sproule, Steele), 1981, pp. 69\u201380.","DOI":"10.1007\/978-3-642-68402-9_9"},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/2402.322384","volume":"30","author":"A. L. Rosenberg","year":"1983","unstructured":"A. L. Rosenberg, \u201cThree-Dimensional VLSI: A Case Study\u201d, Journal of the ACM, Vol. 30 (3), 1983, pp. 397\u2013416.","journal-title":"Journal of the ACM"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(94)00020-E","volume":"63","author":"M. Sch\u00e4ffter","year":"1995","unstructured":"Markus Sch\u00e4ffter, \u201cDrawing Graphs on Rectangular Grids\u201d, Discrete Applied Math. Vol. 63, 1995, pp. 75\u201389.","journal-title":"Discrete Applied Math."},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia, \u201cOn Embedding a Graph in the Grid with a Minimum Number of Bends\u201d, SIAM J. Comput., Vol. 16 (3), 1987, pp. 421\u2013443.","journal-title":"SIAM J. Comput."},{"key":"12_CR23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. Tollis, \u201cA Unified Approach to Visibility Representations of Planar Graphs\u201d, Discrete and Computational Geometry, Vol. 1, 1986, pp. 321\u2013341.","journal-title":"Discrete and Computational Geometry"},{"key":"12_CR24","unstructured":"R. Tamassia and I. Tollis, \u201cEfficient Embeddings of Planar Graphs in Linear Time\u201d, IEEE Symposium on Circuits and Systems, 1987, pp. 495\u2013498."},{"issue":"9","key":"12_CR25","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. Tollis, \u201cPlanar Grid Embedding in Linear Time\u201d, IEEE Transactions on Circuits and Systems, Vol. 36 (9), 1989, pp. 1230\u20131234.","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"12_CR26","unstructured":"David Wood, \u201cOn Higher-Dimensional Orthogonal Graph Drawing\u201d, manuscript, 1996, Dept. of Computer Science, Monash U."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:13:45Z","timestamp":1640949225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}