{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:01:47Z","timestamp":1769925707075,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031492747","type":"print"},{"value":"9783031492754","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_12","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"170-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Pipeline for\u00a0Orthogonal Graph Drawing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4770-3391","authenticated-orcid":false,"given":"Tim","family":"Hegemann","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0218195900000310","volume":"10","author":"TC Biedl","year":"2000","unstructured":"Biedl, T.C., Madden, B., Tollis, I.G.: The three-phase method: a unified approach to orthogonal graph drawing. Int. J. Comput. Geom. Appl. 10(6), 553\u2013580 (2000). https:\/\/doi.org\/10.1142\/S0218195900000310","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.comgeo.2005.02.001","volume":"32","author":"C Binucci","year":"2005","unstructured":"Binucci, C., Didimo, W., Liotta, G., Nonato, M.: Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. Theory Appl. 32(2), 71\u2013114 (2005). https:\/\/doi.org\/10.1016\/j.comgeo.2005.02.001","journal-title":"Comput. Geom. Theory Appl."},{"issue":"5","key":"12_CR3","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TVCG.2006.156","volume":"12","author":"T Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: an incremental procedure for separation constraint layout of graphs. IEEE Trans. Visual Comput. Gr. 12(5), 821\u2013828 (2006). https:\/\/doi.org\/10.1109\/TVCG.2006.156","journal-title":"IEEE Trans. Visual Comput. Gr."},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TVCG.2009.109","volume":"15","author":"T Dwyer","year":"2009","unstructured":"Dwyer, T., et al.: A comparison of user-generated and automatic graph layouts. IEEE Trans. Visual Comput. Gr. 15(6), 961\u2013968 (2009). https:\/\/doi.org\/10.1109\/TVCG.2009.109","journal-title":"IEEE Trans. Visual Comput. Gr."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11618058_15","volume-title":"Graph Drawing","author":"T Dwyer","year":"2006","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153\u2013164. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_15"},{"issue":"11","key":"12_CR6","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. Exper. 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","journal-title":"Softw. Pract. Exper."},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/54.41670","volume":"6","author":"P Groeneveld","year":"1989","unstructured":"Groeneveld, P.: Wire ordering for detailed routing. IEEE Design Test Comput. 6(6), 6\u201317 (1989). https:\/\/doi.org\/10.1109\/54.41670","journal-title":"IEEE Design Test Comput."},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TVCG.2015.2467451","volume":"22","author":"S Kieffer","year":"2016","unstructured":"Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: HOLA: human-like orthogonal network layout. IEEE Trans. Visual Comput. Gr. 22(1), 349\u2013358 (2016). https:\/\/doi.org\/10.1109\/TVCG.2015.2467451","journal-title":"IEEE Trans. Visual Comput. Gr."},{"issue":"9","key":"12_CR9","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology zoo. IEEE J. Sel. Areas Comm. 29(9), 1765\u20131775 (2011). https:\/\/doi.org\/10.1109\/JSAC.2011.111002","journal-title":"IEEE J. Sel. Areas Comm."},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Vieweg+Teubner, Wiesbaden (1990). https:\/\/doi.org\/10.1007\/978-3-322-92106-2","DOI":"10.1007\/978-3-322-92106-2"},{"issue":"5","key":"12_CR11","doi-asserted-by":"publisher","first-page":"857","DOI":"10.7155\/jgaa.00442","volume":"21","author":"L Nachmanson","year":"2017","unstructured":"Nachmanson, L., Nocaj, A., Bereg, S., Zhang, L., Holroyd, A.: Node overlap removal by growing a tree. J. Graph Alg. Appl. 21(5), 857\u2013872 (2017). https:\/\/doi.org\/10.7155\/jgaa.00442","journal-title":"J. Graph Alg. Appl."},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-642-11805-0_36","volume-title":"Graph Drawing","author":"M N\u00f6llenburg","year":"2010","unstructured":"N\u00f6llenburg, M.: An improved algorithm for the metro-line crossing minimization problem. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 381\u2013392. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_36"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.comgeo.2015.10.005","volume":"52","author":"S Pupyrev","year":"2016","unstructured":"Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edge routing with ordered bundles. Comput. Geom. Theory Appl. 52, 18\u201333 (2016). https:\/\/doi.org\/10.1016\/j.comgeo.2015.10.005","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0953-5438(00)00032-1","volume":"13","author":"H Purchase","year":"2000","unstructured":"Purchase, H.: Effective information visualisation: a study of graph drawing aesthetics and algorithms. Interact. Comput. 13(2), 147\u2013162 (2000). https:\/\/doi.org\/10.1016\/S0953-5438(00)00032-1","journal-title":"Interact. Comput."},{"key":"12_CR15","unstructured":"Real-Time and Embedded Systems group. Kiel Integrated Environment for Layout Eclipse Rich Client (KIELER) (2020). https:\/\/rtsys.informatik.uni-kiel.de\/confluence\/display\/KIELER\/Overview"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-662-45803-7_27","volume-title":"Graph Drawing","author":"U R\u00fcegg","year":"2014","unstructured":"R\u00fcegg, U., Kieffer, S., Dwyer, T., Marriott, K., Wybrow, M.: Stress-minimizing orthogonal layout of data flow diagrams with ports. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 319\u2013330. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_27"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jvlc.2013.11.005","volume":"25","author":"CD Schulze","year":"2014","unstructured":"Schulze, C.D., Sp\u00f6nemann, M., von Hanxleden, R.: Drawing layered graphs with port constraints. J. Vis. Lang. Comput. 25(2), 89\u2013106 (2014). https:\/\/doi.org\/10.1016\/j.jvlc.2013.11.005","journal-title":"J. Vis. Lang. Comput."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109\u2013125 (1981). https:\/\/doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987). https:\/\/doi.org\/10.1137\/0216030","journal-title":"SIAM J. Comput."},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-11805-0_22","volume-title":"Graph Drawing","author":"M Wybrow","year":"2010","unstructured":"Wybrow, M., Marriott, K., Stuckey, P.J.: Orthogonal connector routing. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 219\u2013231. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_22"},{"issue":"101886","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2022.101886","volume":"105\u2013106","author":"J Zink","year":"2022","unstructured":"Zink, J., Walter, J., Baumeister, J., Wolff, A.: Layered drawing of undirected graphs with generalized port constraints. Comput. Geom. Theory Appl. 105\u2013106(101886), 1\u201329 (2022). https:\/\/doi.org\/10.1016\/j.comgeo.2022.101886","journal-title":"Comput. Geom. Theory Appl."}],"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-031-49275-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:50Z","timestamp":1704715430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","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":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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","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":"13","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":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","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)"}}]}}