{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T03:22:37Z","timestamp":1770434557942,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540775362","type":"print"},{"value":"9783540775379","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_24","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T09:50:55Z","timestamp":1201686655000},"page":"231-242","source":"Crossref","is-referenced-by-count":17,"title":["Line Crossing Minimization on Metro Maps"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Asquith, M., Gudmundsson, J., Merrick, D.: An ILP for the line ordering problem. Technical Report PA006288, National ICT Australia (2007)"},{"key":"24_CR2","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"24_CR3","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. Technical Report WSI-2007-03, University of T\u00fcbingen (2007)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-70904-6_27","volume-title":"Graph Drawing","author":"M. Benkert","year":"2007","unstructured":"Benkert, M., N\u00f6llenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in wiring diagrams and public transport maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 270\u2013281. Springer, Heidelberg (2007)"},{"key":"24_CR5","unstructured":"Hong, S.-H., Merrick, D., Nascimento, H.A.D.d.: The metro map layout problem. In: Churcher, N., Churcher, C. (eds.) invis.au 2004. Australasian Symposium on Information Visualisation, CRPIT, ACS, vol.\u00a035, pp. 91\u2013100 (2004)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/12.46286","volume":"39","author":"S. Masuda","year":"1990","unstructured":"Masuda, S., Nakajima, K., Kashiwabara, T., Fujisawa, T.: Crossing minimization in linear embeddings of graphs. IEEE Trans. Comput.\u00a039(1), 124\u2013127 (1990)","journal-title":"IEEE Trans. Comput."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11618058_29","volume-title":"Graph Drawing","author":"M. N\u00f6llenburg","year":"2006","unstructured":"N\u00f6llenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 321\u2013333. Springer, Heidelberg (2006)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/IV.2004.1320168","volume-title":"Proc. 8th International Conference on Information Visualisation","author":"J.M. Stott","year":"2004","unstructured":"Stott, J.M., Rodgers, P.: Metro map layout using multicriteria optimization. In: Proc. 8th International Conference on Information Visualisation, pp. 355\u2013362. IEEE Computer Society, Los Alamitos (2004)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:51Z","timestamp":1619507751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_24","relation":{},"subject":[]}}