{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T13:14:47Z","timestamp":1792156487024,"version":"4.4.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s11083-006-9028-y","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T08:47:40Z","timestamp":1149670060000},"page":"1-20","source":"Crossref","is-referenced-by-count":7,"title":["Upward Three-Dimensional Grid Drawings of Graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,6,8]]},"reference":[{"key":"9028_CR1","doi-asserted-by":"crossref","unstructured":"Albertson, M.O., Chappell, G.G., Kierstead, H.A., K\u00fcndgen, A., Ramamurthi, R.: Coloring with no 2-colored ${P}_4$ 's. Electron. J. Combin. 11 #R26 (2004)","DOI":"10.37236\/1779"},{"issue":"1","key":"9028_CR2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput. 27(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9028_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.7155\/jgaa.00079","volume":"8","author":"P. Bose","year":"2004","unstructured":"Bose, P., Czyzowicz, J., Morin, P., Wood, D.R.: The maximum number of edges in a three-dimensional grid-drawing. J. Graph Algorithms Appl. 8(1), 21\u201326 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"9028_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0020-0190(97)00098-7","volume":"63","author":"T. Calamoneri","year":"1997","unstructured":"Calamoneri, T., Sterbini, A.: 3D straight-line grid drawing of 4-colorable graphs. Inf. Process. Lett. 63(2), 97\u2013102 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9028_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02522826","volume":"17","author":"R.F. Cohen","year":"1996","unstructured":"Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica 17(2), 199\u2013208 (1996)","journal-title":"Algorithmica"},{"key":"9028_CR6","doi-asserted-by":"crossref","unstructured":"Devillers, O., Everett, H., Lazard, S., Pentcheva, M., Wismath, S.: Drawing $K_{\\,n}$ in three dimensions with one bend per edge. In: Healy, P., Nikolov, N.S. (eds.) Proc. 13th International Symp. on Graph Drawing (GD '05). Lecture Notes in Comput. Sci., vol. 3843, pp. 83\u201388. Springer, Berlin Heidelberg New York (2006)","DOI":"10.1007\/11618058_8"},{"key":"9028_CR7","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs, NJ (1999)"},{"issue":"1","key":"9028_CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.comgeo.2004.11.003","volume":"32","author":"E. Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Liotta, G., Meijer, H.: Computing straight-line 3D grid drawings of graphs in linear volume. Comput. Geom. 32(1), 26\u201358 (2005)","journal-title":"Comput. Geom."},{"key":"9028_CR9","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Liotta, G., Meijer, H., Wismath, S.K.: Volume requirements of 3D upward drawings. In: Healy, P., Nikolov, N.S. (eds) Proc. 13th International Symp. on Graph Drawing (GD '05). Lecture Notes in Comput. Sci., vol. 3843, pp. 101\u2013110. Springer, Berlin Heidelberg New York (2006)","DOI":"10.1007\/11618058_10"},{"key":"9028_CR10","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Meijer, H.: Track drawings of graphs with constant queue number. In: Liotta, G. (ed.) Proc. 11th International Symp. on Graph Drawing (GD '03). Lecture Notes in Comput. Sci., vol. 2912, pp. 214\u2013225. Springer, Berlin Heidelberg New York (2004)","DOI":"10.1007\/978-3-540-24595-7_20"},{"issue":"3","key":"9028_CR11","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553\u2013579 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9028_CR12","first-page":"497","volume":"6","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 497\u2013522 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"9028_CR13","first-page":"339","volume":"6","author":"V. Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"9028_CR14","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol. 342, pp. 55\u201366. Amer. Math. Soc. (2004)","DOI":"10.1090\/conm\/342\/06130"},{"key":"9028_CR15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.46298\/dmtcs.346","volume":"7","author":"V. Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7, 155\u2013202 (2005)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"9028_CR16","first-page":"13","volume-title":"Surveys in combinatorics. London Math. Soc. Lecture Note Ser., vol. 241","author":"K. Edwards","year":"1997","unstructured":"Edwards, K.: The harmonious chromatic number and the achromatic number. In: Surveys in combinatorics. London Math. Soc. Lecture Note Ser., vol. 241, pp. 13\u201347. Cambridge University Press, Cambridge, UK (1997)"},{"issue":"3","key":"9028_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/jgt.3190180305","volume":"18","author":"K. Edwards","year":"1994","unstructured":"Edwards, K., McDiarmid, C.: New upper bounds on harmonious colorings. J. Graph Theory 18(3), 257\u2013267 (1994)","journal-title":"J. Graph Theory"},{"issue":"4","key":"9028_CR18","doi-asserted-by":"crossref","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S. Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 363\u2013398 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"9028_CR19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1002\/jgt.20029","volume":"47","author":"G. Fertin","year":"2004","unstructured":"Fertin, G., Raspaud, A., Reed, B.: On star coloring of graphs. J. Graph Theory 47(3), 163\u2013182 (2004)","journal-title":"J. Graph Theory"},{"issue":"2","key":"9028_CR20","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"9028_CR21","first-page":"203","volume":"1","author":"F. Harary","year":"1972","unstructured":"Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Util. Math. 1, 203\u2013209 (1972)","journal-title":"Util. Math."},{"key":"9028_CR22","doi-asserted-by":"crossref","unstructured":"Hasunuma, T.: Laying out iterated line digraphs using queues. In: Liotta, G. (ed.) Proc. 11th International Symp. on Graph Drawing (GD '03). Lecture Notes in Comput. Sci., vol. 2912, pp. 202\u2013213. Springer, Berlin Heidelberg New York (2004)","DOI":"10.1007\/978-3-540-24595-7_19"},{"issue":"3","key":"9028_CR23","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1137\/0405031","volume":"5","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"9028_CR24","doi-asserted-by":"crossref","first-page":"1588","DOI":"10.1137\/S0097539795291550","volume":"28","author":"L.S. Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V.: Stack and queue layouts of directed acyclic graphs. II. SIAM J. Comput. 28(5), 1588\u20131626 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9028_CR25","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539795280287","volume":"28","author":"L.S. Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V., Trenk, A.N.: Stack and queue layouts of directed acyclic graphs. II. SIAM J. Comput. 28(4), 1510\u20131539 (1999)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"9028_CR26","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/0221055","volume":"21","author":"L.S. Heath","year":"1992","unstructured":"Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927\u2013958 (1992)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9028_CR27","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/S0097539792235906","volume":"25","author":"M.D. Hutton","year":"1996","unstructured":"Hutton, M.D., Lubiw, A.: Upward planar drawing of single-source acyclic digraphs. SIAM J. Comput. 25(2), 291\u2013311 (1996)","journal-title":"SIAM J. Comput."},{"key":"9028_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs: Methods and Models. Lecture Notes in Comput. Sci., vol. 2025","author":"M. Kaufmann","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. Lecture Notes in Comput. Sci., vol. 2025. Springer, Berlin Heidelberg New York (2001)"},{"issue":"3","key":"9028_CR29","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/0215057","volume":"15","author":"F.T. Leighton","year":"1986","unstructured":"Leighton, F.T., Rosenberg, A.L.: Three-dimensional circuit layouts. SIAM J. Comput. 15(3), 793\u2013813 (1986)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9028_CR30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.7155\/jgaa.00095","volume":"8","author":"P. Morin","year":"2004","unstructured":"Morin, P., Wood, D.R.: Three-dimensional 1-bend graph drawings. J. Graph Algorithms Appl. 8(3), 357\u2013366 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"9028_CR31","first-page":"651","volume-title":"Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol. 25","author":"J. Ne\u0161et\u0159il","year":"2003","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Colorings and homomorphisms of minor closed classes. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol. 25, pp. 651\u2013664. Springer, Berlin Heidelberg New York (2003)"},{"key":"9028_CR32","doi-asserted-by":"crossref","unstructured":"Pach, J., Thiele, T., T\u00f3th, G.: Three-dimensional grid drawings of graphs. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in discrete and computational geometry. Contemporary Mathematics, vol. 223, pp. 251\u2013255. Amer. Math. Soc. (1999)","DOI":"10.1090\/conm\/223\/03142"},{"key":"9028_CR33","unstructured":"P\u00f3r, A., Wood, D.R.: No-3-in-line-3D. In: Pach, J. (ed.) Proc. 12th International Symp. on Graph Drawing (GD '04). Lecture Notes in Comput. Sci., vol. 3383, pp. 395\u2013402. Springer, Berlin Heidelberg New York (2004). To appear in Algorithmica"},{"key":"9028_CR34","unstructured":"Poranen, T.: A new algorithm for drawing series-parallel digraphs in 3D. Tech. Rep. A-2000-16, Dept. of Computer and Information Sciences, University of Tampere, Finland (2000)"},{"key":"9028_CR35","doi-asserted-by":"crossref","unstructured":"Ware, C., Franck, G.: Viewing a graph in a virtual reality display is three times as good as a 2D diagram. In: Ambler, A.L., Kimura, T.D. (eds.) Proc. IEEE Symp. Visual Languages (VL '94), pp. 182\u2013183. IEEE (1994)","DOI":"10.1109\/VL.1994.363621"},{"issue":"2","key":"9028_CR36","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/234972.234975","volume":"15","author":"C. Ware","year":"1996","unstructured":"Ware, C., Franck, G.: Evaluating stereo and motion cues for visualizing information nets in three dimensions. ACM Trans. Graphics 15(2), 121\u2013140 (1996)","journal-title":"ACM Trans. Graphics"},{"key":"9028_CR37","unstructured":"Ware, C., Hui, D., Franck, G.: Visualizing object oriented software in three dimensions. In: Proc. IBM Centre for Advanced Studies Conf. (CASCON '93), pp. 1\u201311 (1993)"},{"key":"9028_CR38","unstructured":"Wood, D.R.: Drawing a graph in a hypercube (2004). http:\/\/arxiv.org\/math\/0509455"}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-006-9028-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-006-9028-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-006-9028-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T17:07:35Z","timestamp":1683479255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-006-9028-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["9028"],"URL":"https:\/\/doi.org\/10.1007\/s11083-006-9028-y","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}