{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:01:42Z","timestamp":1758636102861},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_39","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T09:56:50Z","timestamp":1137751010000},"page":"434-445","source":"Crossref","is-referenced-by-count":3,"title":["Proper and Planar Drawings of Graphs on Three Layers"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Suderman","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S. Arnborg","year":"1986","unstructured":"Arnborg, S., Proskurowski, A.: Characterization and recognition of partial 3-trees. SIAM Journal of Algebraic and Discrete Methods\u00a07, 305\u2013314 (1986)","journal-title":"SIAM Journal of Algebraic and Discrete Methods"},{"key":"39_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-36151-0_4","volume-title":"Graph Drawing","author":"S. Cornelsen","year":"2002","unstructured":"Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 31\u201341. Springer, Heidelberg (2002)"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/3-540-44676-1_41","volume-title":"Algorithms - ESA 2001","author":"V. Dujmovi\u0107","year":"2001","unstructured":"Dujmovi\u0107, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 488\u2013499. Springer, Heidelberg (2001)"},{"key":"39_CR5","unstructured":"Eades, P., McKay, B., Wormald, N.: On an edge crossing problem. In: Proceedings of the 9th Australian Computer Science Conference, pp. 327\u2013334. Australian National University (1986)"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-62592-5_66","volume-title":"Algorithms and Complexity","author":"U. F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Nice drawings for planar bipartite graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol.\u00a01203, pp. 122\u2013134. Springer, Heidelberg (1997)"},{"key":"39_CR7","first-page":"203","volume":"1","author":"F. Harary","year":"1972","unstructured":"Harary, F., Schwenk, A.: A new crossing number for bipartite graphs. Utilitas Mathematica\u00a01, 203\u2013209 (1972)","journal-title":"Utilitas Mathematica"},{"key":"39_CR8","doi-asserted-by":"publisher","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 Journal on Computing\u00a021, 927\u2013958 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"39_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley, Chichester (1990)"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","volume":"12","author":"J. Matousek","year":"1991","unstructured":"Matousek, J., Thomas, R.: Algorithms finding tree-decompositions of graphs. Journal of Algorithms\u00a012, 1\u201322 (1991)","journal-title":"Journal of Algorithms"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0895480193243043","volume":"9","author":"D.P. Sanders","year":"1995","unstructured":"Sanders, D.P.: On linear recognition of tree-width at most four. SIAM Journal on Discrete Mathematics\u00a09, 101\u2013117 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"39_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1142\/S0218195904001433","volume":"14","author":"M. Suderman","year":"2004","unstructured":"Suderman, M.: Pathwidth and layered drawings of trees. International Journal of Computational Geometry & Applications\u00a014, 203\u2013225 (2004)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR15","unstructured":"Tomii, N., Kambayashi, Y., Yajima, S.: On planarization algorithms of 2-level graphs. Technical Report EC77-38, Institute of Electronic and Communication Engineers of Japan, IECEJ (1977)"},{"key":"39_CR16","first-page":"502","volume":"7","author":"J.N. Warfield","year":"1977","unstructured":"Warfield, J.N.: Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man, and Cybernetics\u00a07, 502\u2013523 (1977)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"39_CR17","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02460022","volume":"48","author":"M.S. Waterman","year":"1986","unstructured":"Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bulletin of Mathematical Biology\u00a048, 189\u2013195 (1986)","journal-title":"Bulletin of Mathematical Biology"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:15Z","timestamp":1605643455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11618058_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}