{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T06:25:20Z","timestamp":1769581520352,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030044138","type":"print"},{"value":"9783030044145","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04414-5_20","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T18:20:45Z","timestamp":1545070845000},"page":"286-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Greedy Heuristic for Crossing-Angle Maximization"],"prefix":"10.1007","author":[{"given":"Almut","family":"Demel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"D\u00fcrrschnabel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Radermacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lasse","family":"Wulf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"569","DOI":"10.7155\/jgaa.00274","volume":"16","author":"EN Argyriou","year":"2012","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. J. Graph Algorithms Appl. 16(2), 569\u2013597 (2012). https:\/\/doi.org\/10.7155\/jgaa.00274","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"20_CR2","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1093\/comjnl\/bxs088","volume":"56","author":"EN Argyriou","year":"2013","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. Comput. J. 56(7), 887\u2013900 (2013). https:\/\/doi.org\/10.1093\/comjnl\/bxs088","journal-title":"Comput. J."},{"issue":"4","key":"20_CR3","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., Mori\u0107, F., T\u00f3th, C.D.: Graphs that admit right angle crossing drawings. Comput. Geom. Theory Appl. 45(4), 169\u2013177 (2012). https:\/\/doi.org\/10.1016\/j.comgeo.2011.11.008","journal-title":"Comput. Geom. Theory Appl."},{"issue":"9","key":"20_CR4","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TC.1979.1675432","volume":"C\u201328","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput. C\u201328(9), 643\u2013647 (1979)","journal-title":"IEEE Trans. Comput."},{"key":"20_CR5","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The Open Graph Drawing Framework (OGDF). In: Handbook of Graph Drawing and Visualization, pp. 543\u2013569. Chapman and Hall\/CRC, Boca Raton (2013)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-319-73915-1_44","volume-title":"Graph Drawing and Network Visualization","author":"W Devanny","year":"2018","unstructured":"Devanny, W., Kindermann, P., L\u00f6ffler, M., Rutter, I.: Graph drawing contest report. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 575\u2013582. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_44"},{"issue":"39","key":"20_CR7","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. Theor. Comput. Sci. 412(39), 5156\u20135166 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.025","journal-title":"Theor. Comput. Sci."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-1-4614-0110-0_10","volume-title":"Thirty Essays on Geometric Graph Theory","author":"W Didimo","year":"2013","unstructured":"Didimo, W., Liotta, G.: The crossing-angle resolution in graph drawing. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 167\u2013184. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_10"},{"key":"20_CR9","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Viglas, T., Potanin, A. (eds.) Proceedings of the 16th Symposium on Computing: The Australasian Theory (CATS 2010), pp. 19\u201324. Australian Computer Society (2010)"},{"key":"20_CR10","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"issue":"11","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw.: Pract. Exp. 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","journal-title":"Softw.: Pract. Exp."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.dam.2011.09.016","volume":"160","author":"ED Giacomo","year":"2012","unstructured":"Giacomo, E.D., Didimo, W., Eades, P., Hong, S.H., Liotta, G.: Bounds on the crossing resolution of complete geometric graphs. Discret. Appl. Math. 160(1), 132\u2013139 (2012). https:\/\/doi.org\/10.1016\/j.dam.2011.09.016","journal-title":"Discret. Appl. Math."},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Huang, W., Eades, P., Hong, S.H., Lin, C.C.: Improving force-directed graph drawings by making compromises between aesthetics. In: Hundhausen, C.D., Pietriga, E., D\u00edaz, P., Rosson, M.B. (eds.) Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (VL\/HCC2010), pp. 176\u2013183. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/VLHCC.2010.32","DOI":"10.1109\/VLHCC.2010.32"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Huang, W., Huang, M.: Exploring the relative importance of crossing number and crossing angle. In: Wang, H., Yuan, X., Tao, L., Chen, W. (eds.) Proceedings of the 3rd International Symposium on Visual Information Communication (VINCI 2010), pp. 10:1\u201310:8. ACM (2010). https:\/\/doi.org\/10.1145\/1865841.1865854","DOI":"10.1145\/1865841.1865854"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-73915-1_19","volume-title":"Graph Drawing and Network Visualization","author":"J Klawitter","year":"2018","unstructured":"Klawitter, J., Mchedlidze, T., N\u00f6llenburg, M.: Experimental evaluation of book drawing algorithms. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 224\u2013238. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_19"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78, 046110 (2008). https:\/\/doi.org\/10.1103\/PhysRevE.78.046110","journal-title":"Phys. Rev. E"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/1.9781611975055.12","volume-title":"2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Marcel Radermacher","year":"2018","unstructured":"Radermacher, M., Reichard, K., Rutter, I., Wagner, D.: A geometric heuristic for rectilinear crossing minimization. In: Pagh, R., Venkatasubramanian, S. (eds.) Proceedings of the 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), pp. 129\u2013138 (2018). https:\/\/doi.org\/10.1137\/1.9781611975055.12"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"CL Staudt","year":"2016","unstructured":"Staudt, C.L., Sazonovs, A., Meyerhenke, H.: NetworKit: a tool suite for large-scale complex network analysis. Netw. Sci. 4(4), 508\u2013530 (2016). https:\/\/doi.org\/10.1017\/nws.2016.20","journal-title":"Netw. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04414-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:19:42Z","timestamp":1710249582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04414-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030044138","9783030044145"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04414-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 December 2018","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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dccg.upc.edu\/gd2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.92","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The book also contains 1 full invited paper and 1 contest report","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}