{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:22Z","timestamp":1725577882007},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_6","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"62-67","source":"Crossref","is-referenced-by-count":8,"title":["Maximizing the Total Resolution of Graphs"],"prefix":"10.1007","author":[{"given":"Evmorfia N.","family":"Argyriou","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","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":"6_CR2","doi-asserted-by":"crossref","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. Technical Report arXiv:\/106871 (2010)","DOI":"10.1007\/978-3-642-18469-7_6"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00493-004-0012-0","volume":"24","author":"I. B\u00e1r\u00e1ny","year":"2004","unstructured":"B\u00e1r\u00e1ny, I., Tokushige, N.: The minimum area of convex lattice n-gons. Combinatorica\u00a024(2), 171\u2013185 (2004)","journal-title":"Combinatorica"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G.D. Battista","year":"1994","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom.\u00a04, 235\u2013282 (1994)","journal-title":"Comput. Geom."},{"key":"6_CR5","first-page":"117","volume":"25","author":"C.C. Cheng","year":"1999","unstructured":"Cheng, C.C., Duncanyz, C.A., Goodrichz, M.T., Kobourovz, S.G.: Drawing planar graphs with circular arcs. Discrete and Comp. Geometry\u00a025, 117\u2013126 (1999)","journal-title":"Discrete and Comp. Geometry"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-11805-0_4","volume-title":"Graph Drawing","author":"E. Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 15\u201320. Springer, Heidelberg (2010)"},{"key":"6_CR7","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":"6_CR8","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a0(42), 149\u2013160 (1984)"},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/0222063","volume":"22","author":"M. Formann","year":"1993","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F., Symvonis, A., Welzl, E., Woeginger, G.: Drawing graphs in the plane with high resolution. SIAM J. Comput.\u00a022(5), 1035\u20131052 (1993)","journal-title":"SIAM J. Comput."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Garg, A., Tamassia, R.: Planar drawings and angular resolution: Algorithms and bounds. In: Proc. 2nd Annu. Eur. Sympos. Alg., pp. 12\u201323 (1994)","DOI":"10.1007\/BFb0049393"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"1999","unstructured":"Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 167\u2013182. Springer, Heidelberg (1999)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: Proc. Asia-Pacific Symp. on Visualization, pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proc. of the Pacific Visualization Symp., pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"6_CR15","first-page":"329","volume-title":"Proc. of the 9th Int. Conf. on Inf. Vis.","author":"C.-C. Lin","year":"2005","unstructured":"Lin, C.-C., Yen, H.-C.: A new force-directed graph drawing method based on edge-edge repulsion. In: Proc. of the 9th Int. Conf. on Inf. Vis., pp. 329\u2013334. IEEE, Los Alamitos (2005)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. In: STOC, pp. 527\u2013538 (1992)","DOI":"10.1145\/129712.129764"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:44:59Z","timestamp":1559983499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}