{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:22Z","timestamp":1725558862245},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_15","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"133-143","source":"Crossref","is-referenced-by-count":2,"title":["Layouts of Graph Subdivisions"],"prefix":"10.1007","author":[{"given":"Vida","family":"Dujmovi\u0107","sequence":"first","affiliation":[]},{"given":"David R.","family":"Wood","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Blankenship, R., Oporowski, B.: Drawing subdivisions of complete and complete bipartite graphs on books. Technical Report 1999-4, Department of Mathematics, Louisiana State University (1999)"},{"issue":"1","key":"15_CR2","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.\u00a08(1), 21\u201326 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","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.: Threedimensional graph drawing. Algorithmica\u00a017(2), 199\u2013208 (1996)","journal-title":"Algorithmica"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Meijer, H.: Track drawings of graphs with constant queue number. In: Liotta [16], pp. 214\u2013225","DOI":"10.1007\/978-3-540-24595-7_20"},{"key":"15_CR5","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. (to appear)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Submitted; see arXiv:cs.DM\/0407033 (2004)","DOI":"10.46298\/dmtcs.315"},{"key":"15_CR7","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Stacks, queues and tracks: Layouts of graph subdivisions. Submitted; see Tech. Rep. TR-2003-08, School of Computer Science, Carleton University, Ottawa, Canada (2003)"},{"issue":"2","key":"15_CR8","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.\u00a06(2), 339\u2013358 (2004)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Dujmovi\u0107, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach [18], pp. 55\u201366","DOI":"10.1090\/conm\/342\/06130"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1137\/S0895480195280319","volume":"12","author":"H. Enomoto","year":"1999","unstructured":"Enomoto, H., Miyauchi, M.S.: Embedding graphs into a three page book with O(M logN) crossings of edges over the spine. SIAM J. Discrete Math.\u00a012(3), 337\u2013341 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR11","unstructured":"Enomoto, H., Miyauchi, M.S.: Embedding a graph into a d + 1-page book with \u2308m log d n\u2309 edge-crossings over the spine. IPSJ SIGNotes ALgorithms, 051, Abstract No. 008 (2001)"},{"issue":"2-3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00044-X","volume":"92","author":"H. Enomoto","year":"1999","unstructured":"Enomoto, H., Miyauchi, M.S., Ota, K.: Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. Discrete Appl. Math.\u00a092(2-3), 149\u2013155 (1999)","journal-title":"Discrete Appl. Math."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Separating thickness from geometric thickness. In: Pach [18], pp. 75\u201386","DOI":"10.1090\/conm\/342\/06132"},{"issue":"4","key":"15_CR14","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.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl.\u00a07(4), 363\u2013398 (2003)","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","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.\u00a05(3), 398\u2013412 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Graph Drawing","year":"2004","unstructured":"Liotta, G. (ed.): GD 2003. LNCS, vol.\u00a02912. Springer, Heidelberg (2004)"},{"key":"15_CR17","unstructured":"Miyauchi, M.S.: An O(nm) algorithm for embedding graphs into a 3-page book. Trans. IEICE E77-A(3), pp. 521\u2013526 (1994)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Pach, J. (ed.): Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol.\u00a0342. Amer. Math. Soc. (2004)","DOI":"10.1090\/conm\/342"},{"key":"15_CR19","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.\u00a0223, pp. 251\u2013255. Amer. Math. Soc. (1999)","DOI":"10.1090\/conm\/223\/03142"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T19:55:56Z","timestamp":1635623756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}