{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:24:54Z","timestamp":1760441094383},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_12","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"91-102","source":"Crossref","is-referenced-by-count":10,"title":["h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Angelini, P., Di Battista, G., Didimo, W., Frati, F., Hong, S.-H., Kaufmann, M., Liotta, G., Lubiw, A.: RAC and LAC drawings of planar graphs in subquadratic area. In: ECG 2011, pp. 125\u2013128 (2011)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","first-page":"75","volume-title":"Proc. of GD 2011","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Di Battista, G., Kaufmann, M., Mchedlidze, T., Roselli, V., Squarcella, C.: Small Point Sets for Simply-Nested Planar Graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 75\u201385. Springer, Heidelberg (2011)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-36151-0_6","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"2002","unstructured":"Biedl, T.C.: Drawing Outer-Planar Graphs in O(n logn) Area. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 133\u2013148. Springer, Heidelberg (2002)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-11805-0_27","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"2010","unstructured":"Biedl, T.C.: Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 280\u2013291. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. TCS\u00a0209(1-2), 1\u201345 (1998)","journal-title":"TCS"},{"issue":"3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"O. Borodin","year":"1979","unstructured":"Borodin, O.: On acyclic colorings of planar graphs. Discr. Math.\u00a025(3), 211\u2013236 (1979)","journal-title":"Discr. Math."},{"key":"12_CR7","first-page":"187","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. CGTA\u00a02, 187\u2013200 (1992)","journal-title":"CGTA"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-007-9117-3","volume":"54","author":"G. Battista Di","year":"2009","unstructured":"Di Battista, G., Frati, F.: Small area drawings of outerplanar graphs. Algorithmica\u00a054, 25\u201353 (2009)","journal-title":"Algorithmica"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. In: Proc. of FOCS 2010, pp. 365\u2013374 (2010)","DOI":"10.1109\/FOCS.2010.42"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24595-7_22","volume-title":"Graph Drawing","author":"E. Giacomo Di","year":"2004","unstructured":"Di Giacomo, E.: Drawing Series-Parallel Graphs on Restricted Integer 3D Grids. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 238\u2013246. Springer, Heidelberg (2004)"},{"issue":"1","key":"12_CR12","first-page":"26","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. CGTA\u00a032(1), 26\u201358 (2005)","journal-title":"CGTA"},{"issue":"39","key":"12_CR13","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W. Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. TCS\u00a0412(39), 5156\u20135166 (2011)","journal-title":"TCS"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","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. on Comp.\u00a034(3), 553\u2013579 (2005)","journal-title":"SIAM J. on Comp."},{"issue":"2","key":"12_CR15","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. DMTCS\u00a06(2), 497\u2013522 (2004)","journal-title":"DMTCS"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S.-H. Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.: F\u00e1ry\u2019s Theorem for 1-Planar Graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-45848-4_26","volume-title":"Graph Drawing","author":"S. Felsner","year":"2002","unstructured":"Felsner, S., Liotta, G., Wismath, S.K.: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 328\u2013342. Springer, Heidelberg (2002)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Coloring k\n                  \n                    k\n                  -free intersection graphs of geometric objects in the plane. In: Proc. of SCG 2008, pp. 346\u2013354. ACM (2008)","DOI":"10.1145\/1377676.1377735"},{"issue":"5","key":"12_CR19","first-page":"139","volume":"12","author":"F. Frati","year":"2010","unstructured":"Frati, F.: Lower bounds on the area requirements of series-parallel graphs. DMTCS\u00a012(5), 139\u2013174 (2010)","journal-title":"DMTCS"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica\u00a017, 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","first-page":"266","volume-title":"Proc. of GD 2011","author":"A. Suk","year":"2011","unstructured":"Suk, A.: k-Quasi-Planar Graphs. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 266\u2013277. Springer, Heidelberg (2011)"},{"issue":"1","key":"12_CR22","first-page":"25","volume":"30","author":"D.R. Wood","year":"2005","unstructured":"Wood, D.R.: Grid drawings of k-colourable graphs. CGTA\u00a030(1), 25\u201328 (2005)","journal-title":"CGTA"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T09:26:35Z","timestamp":1557307595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}