{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:32Z","timestamp":1770994172458,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030677305","type":"print"},{"value":"9783030677312","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-67731-2_26","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:05:07Z","timestamp":1611137107000},"page":"361-372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Using the Metro-Map Metaphor for Drawing Hypergraphs"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9186-3538","authenticated-orcid":false,"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1545-5580","authenticated-orcid":false,"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4089-673X","authenticated-orcid":false,"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0645-9715","authenticated-orcid":false,"given":"Torsten","family":"Ueckerdt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.7155\/jgaa.00199","volume":"14","author":"E Argyriou","year":"2010","unstructured":"Argyriou, E., Bekos, M.A., Kaufmann, M., Symvonis, A.: On metro-line crossing minimization. J. Graph Algorithms Appl. 14(1), 75\u201396 (2010). https:\/\/doi.org\/10.7155\/jgaa.00199","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR2","unstructured":"Asquith, M., Gudmundsson, J., Merrick, D.: An ILP for the metro-line crossing problem. In: Proceedings 14th Computing Australasian Theory Symposium (CATS 2008), vol. 77, pp. 49\u201356. CRPIT (2008). https:\/\/crpit.scem.westernsydney.edu.au\/confpapers\/CRPITV77Asquith.pdf"},{"key":"26_CR3","doi-asserted-by":"publisher","unstructured":"Bast, H., Brosi, P., Storandt., S.: Efficient generation of geographically accurate transit maps. In: Proceedings 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (SIGSPATIAL 2018), pp. 13\u201322 (2018). https:\/\/doi.org\/10.1145\/3274895.3274955","DOI":"10.1145\/3274895.3274955"},{"key":"26_CR4","unstructured":"Bl\u00e4sius, T., Fink, S.D., Rutter, I.: Synchronized planarity with applications to constrained planarity problems. arXiv (2020). https:\/\/arxiv.org\/abs\/2007.15362"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.jda.2011.12.009","volume":"14","author":"U Brandes","year":"2012","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Path-based supports for hypergraphs. J. Discrete Algorithms 14, 248\u2013261 (2012). https:\/\/doi.org\/10.1016\/j.jda.2011.12.009","journal-title":"J. Discrete Algorithms"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms \u2014 ESA 1995","author":"Q-W Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P. (ed.) ESA 1995. LNCS, vol. 979, pp. 213\u2013226. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60313-1_145"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.7155\/jgaa.00351","volume":"19","author":"M Fink","year":"2015","unstructured":"Fink, M., Pupyrev, S., Wolff, A.: Ordering metro lines by block crossings. J. Graph Algorithms Appl. 19(1), 111\u2013153 (2015). https:\/\/doi.org\/10.7155\/jgaa.00351","journal-title":"J. Graph Algorithms Appl."},{"key":"26_CR8","unstructured":"Foo, B.: The memory underground. http:\/\/memoryunderground.com"},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Fulek, R., T\u00f3th, C.D.: Atomic embeddability, clustered planarity, and thickenability. In: Proceedings ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 2876\u20132895 (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.175","DOI":"10.1137\/1.9781611975994.175"},{"key":"26_CR10","unstructured":"Honnorat, D.: The best movies of all time map (2009). http:\/\/www.dyblog.fr\/index.php?2009\/07\/20\/928-une-carte-des-250-meilleurs-films-de-tous-les-temps+www.dyblog.fr\/index.php?2009\/07\/20\/928-une-carte-des-250-meilleurs-films-de-tous-les-temps+, Accessed 8 Jun 2020"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Lengauer, T.: Hierarchical planarity testing algorithms. J. ACM 36(3), 474\u2013509 (1989). https:\/\/doi.org\/10.1145\/65950.65952","DOI":"10.1145\/65950.65952"},{"key":"26_CR12","doi-asserted-by":"publisher","unstructured":"Nesbitt, K.V.: Getting to more abstract places using the metro map metaphor. In: Proceedings 8th International Conference Information Vision (IV 2004), pp. 488\u2013493. IEEE (2004). https:\/\/doi.org\/10.1109\/IV.2004.1320189","DOI":"10.1109\/IV.2004.1320189"},{"key":"26_CR13","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"},{"issue":"5","key":"26_CR14","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). https:\/\/doi.org\/10.1109\/TVCG.2010.81","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"26_CR15","doi-asserted-by":"publisher","unstructured":"Sandvad, E., Gr\u00f8nb\u00e6k, K., Sloth, L., Knudsen, J.L.: A metro map metaphor for guided tours on the Web: the Webvise guided tour system. In: Shen, V.Y., Saito, N., Lyu, M.R., Zurko, M.E. (eds.) Proceedings 10th International World Wide Web Conference (WWW 2001), pp. 326\u2013333. ACM (2001). https:\/\/doi.org\/10.1145\/371920.372079","DOI":"10.1145\/371920.372079"},{"key":"26_CR16","doi-asserted-by":"publisher","unstructured":"Shahaf, D., Yang, J., Suen, C., Jacobs, J., Wang, H., Leskovec, J.: Information cartography: Creating zoomable, large-scale maps of information. In: Proceedings 19th ACM SIGKDD Conference. Knowledge Discovery and Data Mining (KDD), pp. 1097\u20131105 (2013). https:\/\/doi.org\/10.1145\/2487575.2487690","DOI":"10.1145\/2487575.2487690"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Stott, J.M., Rodgers, P., Burkhard, R.A., Meier, M., Smis, M.T.J.: Automatic layout of project plans using a metro map metaphor. In: Proceedings 9th International Conference Information Vision (IV 2005), pp. 203\u2013206. IEEE (2005). https:\/\/doi.org\/10.1109\/IV.2005.26","DOI":"10.1109\/IV.2005.26"},{"key":"26_CR18","unstructured":"Verkehrsunternehmensverbund Mainfranken. Liniennetz W\u00fcrzburger Straenbahn (2019). https:\/\/www.wvv.de\/de\/media\/downloads\/downloadcenter\/hauptnavigation\/mobilitaet\/liniennetz\/2019-11-01-liniennetzplan-busse-und-strabas_a3.pdf, Accessed 8 Jun 2020"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T22:02:47Z","timestamp":1619301767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","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":"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":"33","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":"33% - 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,1","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":"4,5","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 conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}