{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:46:47Z","timestamp":1769586407610,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319501055","type":"print"},{"value":"9783319501062","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_4","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"44-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Placing Arrows in Directed Graph Drawings"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[]},{"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"key":"4_CR1","unstructured":"Binucci, C., Chimani, M., Didimo, W., Liotta, G., Montecchiani, F.: Placing arrows in directed graph drawings. ArXiv e-prints abs\/1608.08505 (2016). \n                      http:\/\/arxiv.org\/abs\/1608.08505v1"},{"issue":"1","key":"4_CR2","first-page":"243","volume":"5","author":"U Brandes","year":"2015","unstructured":"Brandes, U., Finocchi, I., N\u00f6llenburg, M., Quigley, A.: Empirical evaluation for graph drawing (Dagstuhl seminar 15052). Dagstuhl Rep. 5(1), 243\u2013258 (2015)","journal-title":"Dagstuhl Rep."},{"key":"4_CR3","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, chap. 17. CRC Press, Boca Raton (2014). \n                      www.ogdf.net"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-45030-3_39","volume-title":"Algorithms and Computation","author":"A Gemsa","year":"2013","unstructured":"Gemsa, A., Niedermann, B., N\u00f6llenburg, M.: Trajectory-based dynamic map labeling. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 413\u2013423. Springer, Heidelberg (2013). doi:\n                      10.1007\/978-3-642-45030-3_39"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-07959-2_20","volume-title":"Experimental Algorithms","author":"A Gemsa","year":"2014","unstructured":"Gemsa, A., N\u00f6llenburg, M., Rutter, I.: Evaluation of labeling strategies for rotating maps. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 235\u2013246. Springer, Heidelberg (2014). doi:\n                      10.1007\/978-3-319-07959-2_20"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285\u2013295. Springer, Heidelberg (2005). doi:\n                      10.1007\/978-3-540-31843-9_29"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Holten, D., Isenberg, P., van Wijk, J.J., Fekete, J.: An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs. In: IEEE PacificVis 2011, pp. 195\u2013202. IEEE (2011)","DOI":"10.1109\/PACIFICVIS.2011.5742390"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Holten, D., van Wijk, J.J.: A user study on visualizing directed edges in graphs. In: CHI 2009, pp. 2299\u20132308. ACM (2009)","DOI":"10.1145\/1518701.1519054"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(00)00025-0","volume":"18","author":"KG Kakoulis","year":"2001","unstructured":"Kakoulis, K.G., Tollis, I.G.: On the complexity of the edge label placement problem. Comput. Geom. 18(1), 1\u201317 (2001)","journal-title":"Comput. Geom."},{"key":"4_CR10","first-page":"489","volume-title":"Handbook on Graph Drawing and Visualization","author":"KG Kakoulis","year":"2013","unstructured":"Kakoulis, K.G., Tollis, I.G.: Labeling algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 489\u2013515. Chapman and Hall\/CRC, New York (2013)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","volume":"13","author":"MJ van Kreveld","year":"1999","unstructured":"van Kreveld, M.J., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. 13(1), 21\u201347 (1999)","journal-title":"Comput. Geom."},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"4_CR13","unstructured":"Marks, J., Shieber, S.: The computational complexity of cartographic label placement. Technical Report 05-91, Harvard University (1991)"},{"key":"4_CR14","unstructured":"North graphs. \n                      http:\/\/www.graphdrawing.org\/data.html"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1023\/A:1015202410664","volume":"6","author":"T Strijk","year":"2002","unstructured":"Strijk, T., van Kreveld, M.J.: Practical extensions of point labeling in the slider model. GeoInformatica 6(2), 181\u2013197 (2002)","journal-title":"GeoInformatica"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1142\/S0218195901000444","volume":"11","author":"T Strijk","year":"2001","unstructured":"Strijk, T., Wolff, A.: Labeling points with circles. Int. J. Comput. Geom. Appl. 11(2), 181\u2013195 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s00453-001-0009-7","volume":"30","author":"F Wagner","year":"2001","unstructured":"Wagner, F., Wolff, A., Kapoor, V., Strijk, T.: Three rules suffice for good label placement. Algorithmica 30(2), 334\u2013349 (2001)","journal-title":"Algorithmica"},{"key":"4_CR18","unstructured":"Wolff, A.: A simple proof for the NP-hardness of edge labeling. Technical Report 11\/2000, Institute of Mathematics and Computer Science, Ernst Moritz Arndt University Greifswald (2000)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:39:42Z","timestamp":1600475982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}