{"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":1725577823832},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_14","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"153-164","source":"Crossref","is-referenced-by-count":1,"title":["Drawing Graphs on a Smartphone"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Da Lozzo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Ingrassia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing reduction in circular layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 332\u2013343. Springer, Heidelberg (2004)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-63938-1_77","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Cohen, R.F., Huang, M.L.: Online animated graph drawing for web navigation. In: di Battista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 330\u2013335. Springer, Heidelberg (1997)"},{"unstructured":"He, H., Sykora, O.: New circular drawing algorithms. In: Proc. ITAT 2004 (2004)","key":"14_CR3"},{"doi-asserted-by":"crossref","unstructured":"Makinen, E.: On circular layouts. Internal Journal of Computer Mathematics, 29\u201337 (1988)","key":"14_CR4","DOI":"10.1080\/00207168808803629"},{"unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: An NP-hard crossing minimization problem for computer network layout. Technical report (1986)","key":"14_CR5"},{"unstructured":"Pixelglow. Instaviz (2008), http:\/\/instaviz.com\/","key":"14_CR6"},{"doi-asserted-by":"crossref","unstructured":"Sarkar, M., Brown, M.H.: Graphical fisheye views of graphs. In: Proceedings of the Conference on Human Factors in Computing Systems CHI 1992 (1992)","key":"14_CR7","DOI":"10.1145\/142750.142763"},{"doi-asserted-by":"crossref","unstructured":"Shneiderman, B.: The eyes have it: A task by data type taxonomy for information visualizations. In: Proc. of the IEEE Symp. on Visual Lang., pp. 336\u2013343 (1996)","key":"14_CR8","DOI":"10.1109\/VL.1996.545307"},{"doi-asserted-by":"crossref","unstructured":"Six, J.M., Tollis, I.G.: Circular drawings of biconnected graphs. In: Proc. ALENEX (1999)","key":"14_CR9","DOI":"10.1007\/3-540-48518-X_4"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T12:44:52Z","timestamp":1559997892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}