{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:23Z","timestamp":1725577823134},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_1","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"1-12","source":"Crossref","is-referenced-by-count":6,"title":["On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Ackerman","sequence":"first","affiliation":[]},{"given":"Radoslav","family":"Fulek","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E. Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J.Combinatorial Theory, Ser. A.\u00a0114(3), 563\u2013571 (2007)","journal-title":"J.Combinatorial Theory, Ser. A."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-11805-0_5","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","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. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 21\u201332. Springer, Heidelberg (2010)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16926-7_14","volume-title":"Graph Theoretic Concepts in Computer Science","author":"K. Arikushi","year":"2010","unstructured":"Arikushi, K., Fulek, R., Keszegh, B., Mori\u0107, F., T\u00f3th, C.D.: Drawing graphs with orthogonal crossings. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, Springer, Heidelberg (2010)"},{"key":"1_CR4","unstructured":"Arikushi, K., T\u00f3th, C.D.: Crossing angles of geometric graphs (manuscript) (2010)"},{"key":"1_CR5","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)"},{"key":"1_CR6","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Computing: The Australian Theory Symp. (CATS 2010 ). CRPIT (2010)"},{"key":"1_CR7","first-page":"97","volume-title":"Proc. 6th Asia-Pacific Symp. Visualization (APVIS)","author":"W. Huang","year":"2007","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: Proc. 6th Asia-Pacific Symp. Visualization (APVIS), pp. 97\u2013100. IEEE, Los Alamitos (2007)"},{"key":"1_CR8","first-page":"41","volume-title":"Proc. IEEE Pacific Visualization Symp.","author":"W. Huang","year":"2008","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proc. IEEE Pacific Visualization Symp., pp. 41\u201346. IEEE, Los Alamitos (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T07:30:58Z","timestamp":1553412658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}