{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T05:17:29Z","timestamp":1770527849937,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540314257","type":"print"},{"value":"9783540316671","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_29","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"321-333","source":"Crossref","is-referenced-by-count":33,"title":["A Mixed-Integer Program for Drawing High-Quality Metro Maps"],"prefix":"10.1007","author":[{"given":"Martin","family":"N\u00f6llenburg","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-45460-8_4","volume-title":"Spatial Cognition II","author":"T. Barkowsky","year":"2000","unstructured":"Barkowsky, T., Latecki, L.J., Richter, K.-F.: Schematizing maps: Simplification of geographic shape by discrete curve evolution. In: Habel, C., Brauer, W., Freksa, C., Wender, K.F. (eds.) Spatial Cognition 2000. LNCS (LNAI), vol.\u00a01849, p. 41. Springer, Heidelberg (2000)"},{"issue":"2","key":"29_CR2","doi-asserted-by":"crossref","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. Comp. Geometry: Theory & Appl.\u00a032(2), 71\u2013114 (2005)","journal-title":"Comp. Geometry: Theory & Appl."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36151-0_1","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Kaufmann, M., Wagner, D.: Sketch-driven orthogonal graph drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 1\u201311. Springer, Heidelberg (2002)"},{"key":"29_CR4","first-page":"33","volume-title":"Proc. 17th Annual Symp. on Computational Geometry (SoCG 2001)","author":"S. Cabello","year":"2001","unstructured":"Cabello, S., Berg, M.d., Dijk, S.v., Kreveld, M.v., Strijk, T.: Schematization of road networks. In: Proc. 17th Annual Symp. on Computational Geometry (SoCG 2001), pp. 33\u201339. ACM Press, New York (2001)"},{"key":"29_CR5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista di","year":"1999","unstructured":"di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs (1999)"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-31843-9_50","volume-title":"Graph Drawing","author":"S.-H. Hong","year":"2005","unstructured":"Hong, S.-H., Merrick, D., do Nascimento, H.A.D.: The metro map layout problem. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 482\u2013491. Springer, Heidelberg (2005)"},{"key":"29_CR7","unstructured":"N\u00f6llenburg, M.: Automated drawings of metro maps. Technical Report 2005-25, Universit\u00e4t Karlsruhe (2005), Available at: \n                    \n                      http:\/\/www.ubka.uni-karlsruhe.de\/cgi-bin\/psview?document=\/ira\/2005\/25"},{"key":"29_CR8","unstructured":"Ovenden, M.: Metro Maps of the World. Capital Transport Publishing (2003)"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/371920.372079","volume-title":"Proc. 10th Int. World Wide Web Conf. (WWW 2001)","author":"E.S. Sandvad","year":"2001","unstructured":"Sandvad, E.S., 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: Proc. 10th Int. World Wide Web Conf (WWW 2001), Hong Kong, pp. 326\u2013333. ACM Press, New York (2001)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/IV.2004.1320168","volume-title":"Proc. 8th Int. Conf. on Information Visualisation (IV 2004)","author":"J.M. Stott","year":"2004","unstructured":"Stott, J.M., Rodgers, P.: Metro map layout using multicriteria optimization. In: Proc. 8th Int. Conf. on Information Visualisation (IV 2004), London, pp. 355\u2013362. IEEE, Los Alamitos (2004)"},{"key":"29_CR11","unstructured":"Sydney CityRail, \n                    \n                      www.cityrail.nsw.gov.au\/networkmaps\/network_map.pdf"},{"issue":"3","key":"29_CR12","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.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:12:15Z","timestamp":1619493135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11618058_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}