{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:24:00Z","timestamp":1725524640900},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_33","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"336-347","source":"Crossref","is-referenced-by-count":4,"title":["Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem"],"prefix":"10.1007","author":[{"given":"Evmorfia","family":"Argyriou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Asquith, M., Gudmundsson, J., Merrick, D.: An ILP for the metro-line crossing problem. In: 14th Computing: The Australian Theory Symposium, pp. 49\u201356 (2008)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-77537-9_24","volume-title":"Graph Drawing","author":"M.A. Bekos","year":"2008","unstructured":"Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 231\u2013242. Springer, Heidelberg (2008)"},{"key":"33_CR3","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":"33_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"33_CR5","unstructured":"Hong, S.H., Merrick, D., Nascimento, H.: The metro map layout problem. In: Churcher, N., Churcher, C. (eds.) Invis.au 2004. CRPIT, vol.\u00a035, pp. 91\u2013100 (2004)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-70904-6_26","volume-title":"Graph Drawing","author":"D. Merrick","year":"2007","unstructured":"Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 258\u2013269. Springer, Heidelberg (2007)"},{"key":"33_CR7","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":"33_CR8","first-page":"355","volume-title":"8th International Conference on Information Visualisation (IV 2004)","author":"J.M. Stott","year":"2004","unstructured":"Stott, J.M., Rodgers, P.: Metro Map Layout Using Multicriteria Optimization. In: 8th International Conference on Information Visualisation (IV 2004), pp. 355\u2013362. IEEE, Los Alamitos (2004)"},{"key":"33_CR9","unstructured":"Wolff, A., Strijk, T.: The Map-Labeling Bibliography, maintained since (1996), \n                    \n                      http:\/\/i11www.ira.uka.de\/map-labeling\/bibliography"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T06:12:35Z","timestamp":1548396755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}