{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:11Z","timestamp":1725745391178},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_36","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"397-408","source":"Crossref","is-referenced-by-count":2,"title":["Ordering Metro Lines by Block Crossings"],"prefix":"10.1007","author":[{"given":"Martin","family":"Fink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.7155\/jgaa.00199","volume":"14","author":"E.N. Argyriou","year":"2010","unstructured":"Argyriou, E.N., Bekos, M.A., Kaufmann, M., Symvonis, A.: On metro-line crossing minimization. J. Graph Algorithms Appl.\u00a014(1), 75\u201396 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V. Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math.\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"36_CR3","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":"36_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 transportation maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 270\u2013281. Springer, Heidelberg (2007)"},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L. Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discr. Math.\u00a026(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discr. Math."},{"issue":"2","key":"36_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/S0895480197331995","volume":"14","author":"D.A. Christie","year":"2001","unstructured":"Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. Discr. Math.\u00a014(2), 193\u2013206 (2001)","journal-title":"SIAM J. Discr. Math."},{"issue":"4","key":"36_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"36_CR9","unstructured":"Fink, M., Pupyrev, S.: Ordering metro lines by block crossings. ArXiv report (2013), \n                  \n                    http:\/\/arxiv.org\/abs\/1305.0069"},{"issue":"6","key":"36_CR10","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/54.41670","volume":"6","author":"P. Groeneveld","year":"1989","unstructured":"Groeneveld, P.: Wire ordering for detailed routing. IEEE Des. Test\u00a06(6), 6\u201317 (1989)","journal-title":"IEEE Des. Test"},{"issue":"1-3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(98)00072-9","volume":"88","author":"L.S. Heath","year":"1998","unstructured":"Heath, L.S., Vergara, J.P.C.: Sorting by bounded block-moves. Discrete Applied Mathematics\u00a088(1-3), 181\u2013206 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"36_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1109\/43.372368","volume":"14","author":"M. Marek-Sadowska","year":"1995","unstructured":"Marek-Sadowska, M., Sarrafzadeh, M.: The crossing distribution problem. IEEE Trans. CAD Integrated Circuits Syst.\u00a014(4), 423\u2013433 (1995)","journal-title":"IEEE Trans. CAD Integrated Circuits Syst."},{"key":"36_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.\u00a05849, pp. 381\u2013392. Springer, Heidelberg (2010)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-642-25878-7_14","volume-title":"GD 2011","author":"S. Pupyrev","year":"2012","unstructured":"Pupyrev, S., Nachmanson, L., Bereg, S., Holroyd, A.E.: Edge routing with ordered bundles. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 136\u2013147. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:05:41Z","timestamp":1558015541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}