{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:26:06Z","timestamp":1774333566523,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_4","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:06:54Z","timestamp":1770977214000},"page":"49-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Compaction and\u00a0Realizability of\u00a0Almost Convex Octilinear Representations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1441-4189","authenticated-orcid":false,"given":"Henry","family":"Foerster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4481-698X","authenticated-orcid":false,"given":"Giacomo","family":"Ortali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7043-1867","authenticated-orcid":false,"given":"Lena","family":"Schlipf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"4_CR1","volume-title":"Tube Map","author":"H Beck","year":"1933","unstructured":"Beck, H.: Tube Map. Waterlow & Sons Ltd., London (1933)"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"285","DOI":"10.7155\/jgaa.00595","volume":"26","author":"MA Bekos","year":"2022","unstructured":"Bekos, M.A., et al.: On turn-regular orthogonal representations. J. Graph Algorithms Appl. 26(3), 285\u2013306 (2022)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"2046","DOI":"10.1007\/s00453-018-0523-5","volume":"81","author":"MA Bekos","year":"2019","unstructured":"Bekos, M.A., F\u00f6rster, H., Kaufmann, M.: On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings. Algorithmica 81(5), 2046\u20132071 (2019)","journal-title":"Algorithmica"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"657","DOI":"10.7155\/jgaa.00369","volume":"19","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Gronemann, M., Kaufmann, M., Krug, R.: Planar octilinear drawings with one bend per edge. J. Graph Algorithms Appl. 19(2), 657\u2013680 (2015)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"709","DOI":"10.7155\/jgaa.00436","volume":"21","author":"MA Bekos","year":"2017","unstructured":"Bekos, M.A., Kaufmann, M., Krug, R.: On the total number of bends for planar octilinear drawings. J. Graph Algorithms Appl. 21(4), 709\u2013730 (2017)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"SS Bridgeman","year":"2000","unstructured":"Bridgeman, S.S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L.: Turn-regularity and optimal area drawings of orthogonal representations. Comput. Geom. 16(1), 53\u201393 (2000)","journal-title":"Comput. Geom."},{"key":"4_CR7","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Hoboken (1999)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Didimo, W., Gupta, S., Kindermann, P., Liotta, G., Wolff, A., Zehavi, M.: Parameterized approaches to orthogonal compaction. In: Gasieniec, L. (ed.) SOFSEM 2023. Lecture Notes in Computer Science, vol. 13878, pp. 111\u2013125. Springer (2023)","DOI":"10.1007\/978-3-031-23101-8_8"},{"key":"4_CR9","unstructured":"Didimo, W., Kaufmann, M., Liotta, G., Ortali, G., Patrignani, M.: Rectilinear-upward planarity testing of digraphs. In: Iwata, S., Kakimura, N. (eds.) ISAAC 2023. LIPIcs, vol.\u00a0283, pp. 26:1\u201326:20. Schloss Dagstuhl (2023)"},{"key":"4_CR10","unstructured":"Esser, A.M.: Orthogonal compaction: Turn-regularity, complete extensions, and their common concept. In: Cl\u00e1udio, A.P., Bouatouch, K., Chessa, M., Paljic, A., Kerren, A., Hurter, C., Tr\u00e9meau, A., Farinella, G.M. (eds.) VISIGRAPP 2019. Communications in Computer and Information Science, vol.\u00a01182, pp. 179\u2013202. Springer (2019)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"101820","DOI":"10.1016\/j.comgeo.2021.101820","volume":"100","author":"WS Evans","year":"2022","unstructured":"Evans, W.S., Fleszar, K., Kindermann, P., Saeedi, N., Shin, C., Wolff, A.: Minimum rectilinear polygons for given angle sequences. Comput. Geom. 100, 101820 (2022)","journal-title":"Comput. Geom."},{"issue":"10","key":"4_CR12","doi-asserted-by":"publisher","first-page":"3231","DOI":"10.1007\/s00453-024-01260-1","volume":"86","author":"ED Giacomo","year":"2024","unstructured":"Giacomo, E.D., Didimo, W., Liotta, G., Montecchiani, F., Ortali, G.: On the parameterized complexity of bend-minimum orthogonal planarity. Algorithmica 86(10), 3231\u20133251 (2024)","journal-title":"Algorithmica"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Hong, S., Merrick, D., do\u00a0Nascimento, H.A.D.: Automatic visualisation of metro maps. J. Vis. Lang. Comput. 17(3), 203\u2013224 (2006)","DOI":"10.1016\/j.jvlc.2005.09.001"},{"issue":"4","key":"4_CR14","first-page":"373","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Comb. 4(4), 373\u2013396 (1984)","journal-title":"Comb."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Klau, G.W., Mutzel, P.: Optimal compaction of orthogonal grid drawings. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. Lecture Notes in Computer Science, vol.\u00a01610, pp. 304\u2013319. Springer (1999)","DOI":"10.1007\/3-540-48777-8_23"},{"issue":"5","key":"4_CR16","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comput. Graph. 17(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"4_CR17","unstructured":"N\u00f6llenburg, M.: Automated drawings of metro maps, Institut fur Theoretische Informatik, Universit\u00e4t Karlsruhe (TH) (Master\u2019s thesis, 2005). https:\/\/i11www.iti.kit.edu\/extra\/publications\/n-admm-05da.pdf"},{"key":"4_CR18","unstructured":"Object management group: business process model and notation (2014). https:\/\/www.omg.org\/spec\/BPMN\/"},{"key":"4_CR19","unstructured":"Object management group: unified modeling language (2017). https:\/\/www.omg.org\/spec\/UML\/"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M Patrignani","year":"2001","unstructured":"Patrignani, M.: On the complexity of orthogonal compaction. Comput. Geom. 19(1), 47\u201367 (2001)","journal-title":"Comput. Geom."},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TVCG.2010.24","volume":"17","author":"JM Stott","year":"2011","unstructured":"Stott, J.M., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Trans. Vis. Comput. Graph. 17(1), 101\u2013114 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"3","key":"4_CR22","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)","journal-title":"SIAM J. Comput."},{"key":"4_CR23","unstructured":"Transport for London: Harry Beck\u2019s Tube map. https:\/\/tfl.gov.uk\/corporate\/about-tfl\/culture-and-heritage\/art-and-design\/harry-becks-tube-map. Accessed 26 July 2025"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:06:07Z","timestamp":1774325167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}