{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:06:38Z","timestamp":1742976398688,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341908"},{"type":"electronic","value":"9783642341915"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34191-5_19","type":"book-chapter","created":{"date-parts":[[2012,11,11]],"date-time":"2012-11-11T19:57:47Z","timestamp":1352663867000},"page":"200-209","source":"Crossref","is-referenced-by-count":7,"title":["Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/100819564","volume":"26","author":"E. Ackerman","year":"2012","unstructured":"Ackerman, E., Fulek, R., T\u00f3th, C.D.: Graphs that admit polyline drawings with few crossing angles. SIAM Journal on Discrete Mathematics\u00a026(1), 305\u2013320 (2012)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.7155\/jgaa.00217","volume":"15","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. Journal of Graph Algorithms and Applications\u00a015(1), 53\u201378 (2011)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-18381-2_6","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"E.N. Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem Is NP-Hard. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 74\u201385. Springer, Heidelberg (2011)"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comgeo.2011.11.008","volume":"45","author":"K. Arikushi","year":"2012","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Moric, F., T\u00f3th, C.D.: Graphs that admit right angle crossing drawings. Computational Geometry: Theory & Applications\u00a045(4), 169\u2013177 (2012)","journal-title":"Computational Geometry: Theory & Applications"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-36379-3_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2002","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Optimal Area Algorithm for Planar Polyline Drawings. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 35\u201346. Springer, Heidelberg (2002)"},{"issue":"1","key":"19_CR6","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(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"19_CR7","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory of Computing Systems\u00a049(3), 565\u2013575 (2011)","journal-title":"Theory of Computing Systems"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-03367-4_19","volume-title":"Algorithms and Data Structures","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing Graphs with Right Angle Crossings. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"issue":"39","key":"19_CR10","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. Theoretical Computer Science\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2010)"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K. Diks","year":"1993","unstructured":"Diks, K., Djidjev, H., S\u00fdkora, O., Vrto, I.: Edge separators of planar and outerplanar graphs with applications. J. Algorithms\u00a014(2), 258\u2013279 (1993)","journal-title":"J. Algorithms"},{"key":"19_CR13","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago Journal of Theoretical Computer Science, article 4, 1\u201314 (2011)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-77537-9_33","volume-title":"Graph Drawing","author":"F. Frati","year":"2008","unstructured":"Frati, F., Patrignani, M.: A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 339\u2013344. Springer, Heidelberg (2008)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: Hong, S.H., Ma, K.L. (eds.) Asia-Pacific Symposium on Visualization (APVIS 2007), pp. 97\u2013100. IEEE (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: Pacific Visualization (PacificVis 2008), pp. 41\u201346. IEEE (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E. Korach","year":"1993","unstructured":"Korach, E., Solel, N.: Tree-width, path-widt, and cutwidth. Discrete Applied Mathematics\u00a043(1), 97\u2013101 (1993)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR19","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Symposium on Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representation of planar graphs. Discrete & Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete & Computational Geometry"},{"issue":"9","key":"19_CR21","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., Tollis, I.G.: Planar bookgrid embedding in linear time. IEEE Transactions on Cyrcuits and Systems\u00a036(9), 1230\u20131234 (1989)","journal-title":"IEEE Transactions on Cyrcuits and Systems"},{"issue":"2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transactions on Computers\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.comgeo.2004.06.001","volume":"30","author":"D.R. Wood","year":"2005","unstructured":"Wood, D.R.: Grid drawings of k-colourable graphs. Computational Geometry: Theory & Applications\u00a030(1), 25\u201328 (2005)","journal-title":"Computational Geometry: Theory & Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34191-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:07:12Z","timestamp":1558300032000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34191-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341908","9783642341915"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34191-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}