{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T10:16:36Z","timestamp":1751019396495,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00453-017-0350-0","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T10:34:54Z","timestamp":1516617294000},"page":"1493-1533","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Algorithmic Framework for Labeling Network Maps"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6638-7250","authenticated-orcid":false,"given":"Benjamin","family":"Niedermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Henrik","family":"Haunert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,22]]},"reference":[{"issue":"3\u20134","key":"350_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl. 11(3\u20134), 209\u2013218 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"350_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"350_CR3","first-page":"203","volume":"14","author":"J Christensen","year":"1995","unstructured":"Christensen, J., Marks, J., Shieber, S.: An empirical study of algorithms for point-feature label placement. Am. Cartogr. 14(3), 203\u2013232 (1995)","journal-title":"Am. Cartogr."},{"key":"350_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"350_CR5","doi-asserted-by":"crossref","unstructured":"Fink, M., Haverkort, H., N\u00f6llenburg, M., Roberts, M., Schuhmann, J., Wolff, A.: Drawing metro maps using b\u00e9zier curves. In: Graph Drawing (GD\u201913), Volume 7704 of Lecture Notes in Computer Science, pp. 463\u2013474. Springer (2013)","DOI":"10.1007\/978-3-642-36763-2_41"},{"key":"350_CR6","doi-asserted-by":"crossref","unstructured":"Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Computational Geometry (SoCG\u201991), pp. 281\u2013288. ACM Press (1991)","DOI":"10.1145\/109648.109680"},{"issue":"3","key":"350_CR7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"350_CR8","doi-asserted-by":"crossref","unstructured":"Garrido, M., Iturriaga, C., M\u00e1rquez, A., Portillo, J., Reyes, P., Wolff, A.: Labeling subway lines. In: Algorithms and Computation (ISAAC\u201901), Volume 2223 of Lecture Notes in Computer Science, pp. 649\u2013659. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45678-3_55"},{"issue":"2","key":"350_CR9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1559\/152304075784313304","volume":"2","author":"E Imhof","year":"1975","unstructured":"Imhof, E.: Positioning names on maps. Am. Cartogr. 2(2), 128\u2013144 (1975)","journal-title":"Am. Cartogr."},{"key":"350_CR10","doi-asserted-by":"crossref","unstructured":"Kakoulis, K.G., Tollis, I.G.: A unified approach to labeling graphical features. In: Computational Geometry (SoCG\u201998), pp. 347\u2013356. ACM Press (1998)","DOI":"10.1145\/276884.276923"},{"issue":"2","key":"350_CR11","doi-asserted-by":"crossref","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":"350_CR12","doi-asserted-by":"crossref","unstructured":"N\u00f6llenburg, M.: An improved algorithm for the metro-line crossing minimization problem. In: Graph Drawing (GD\u201909), Volume 5849 of Lecture Notes in Computer Science, pp. 381\u2013392. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11805-0_36"},{"issue":"5","key":"350_CR13","doi-asserted-by":"crossref","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. Gr. 17(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"key":"350_CR14","doi-asserted-by":"crossref","unstructured":"Poon, C.K., Zhu, B., Chin, F.: A polynomial time solution for labeling a rectilinear map. In: Computational Geometry (SoCG\u201997), pp. 451\u2013453. ACM (1997)","DOI":"10.1145\/262839.263079"},{"key":"350_CR15","doi-asserted-by":"crossref","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)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"350_CR16","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TVCG.2010.24","volume":"17","author":"J Stott","year":"2011","unstructured":"Stott, J., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout using multicriteria optimization. IEEE Trans. Vis. Comput. Gr. 17(1), 101\u2013114 (2011)","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"issue":"3","key":"350_CR17","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1179\/1743277413Y.0000000066","volume":"50","author":"A Goethem van","year":"2013","unstructured":"van Goethem, A., Meulemans, W., Reimer, A., Haverkort, H., Speckmann, B.: Topologically safe curved schematisation. Cartogr. J. 50(3), 276\u2013285 (2013)","journal-title":"Cartogr. J."},{"issue":"12","key":"350_CR18","doi-asserted-by":"crossref","first-page":"2528","DOI":"10.1109\/TVCG.2011.205","volume":"17","author":"Y-S Wang","year":"2011","unstructured":"Wang, Y.-S., Chi, M.-T.: Focus+context metro maps. IEEE Trans. Vis. Comput. Gr. 17(12), 2528\u20132535 (2011)","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"key":"350_CR19","unstructured":"Wolff, A. Graph drawing and cartography. In: Handbook of Graph Drawing and Visualization, chapter\u00a023, pp. 697\u2013736. Chapman and Hall (2013)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0350-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0350-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0350-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T13:20:53Z","timestamp":1570627253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0350-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,22]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0350-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2018,1,22]]}}}