{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T05:29:46Z","timestamp":1737955786464,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_3","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"3-12","source":"Crossref","is-referenced-by-count":3,"title":["Crossing Number of Graphs with Rotation Systems"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Pelsmajer","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Archdeacon, D.: Problems in topological graph theory (accessed Septmeber 15, 2006), http:\/\/www.emba.uvm.edu\/~archdeac\/problems\/npcubic.htm"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bokal, D., Fijav\u017e, G., Mohar, B.: Minor-monotone crossing number. In: Felsner, S. (ed.) EuroComb 2005. Discrete Mathematics and Theoretical Computer Science, vol.\u00a0AE, pp. 123\u2013128 (2005)","DOI":"10.46298\/dmtcs.3433"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Buchheim, C., J\u00fcnger, M., Menze, A., Percan, M.: Directed crossing minimization. Technical report, Zentrum f\u00fcr Angewandte Informatik K\u00f6ln, Lehrstuhl J\u00fcnger (August 2005)","DOI":"10.1007\/11809678_52"},{"issue":"2","key":"3_CR4","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. J. Roy. Statist. Soc. Ser. B\u00a039(2), 262\u2013268 (1977)","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. Garey","year":"1983","unstructured":"Garey, M., Johnson, D.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04, 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P. Hlin\u011bn\u00fd","year":"2006","unstructured":"Hlin\u011bn\u00fd, P.: Crossing number is hard for cubic graphs. J. Combin. Theory Ser. B\u00a096(4), 455\u2013471 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3_CR7","unstructured":"Kedem, Z.M., Fuchs, H.: On finding several shortest paths in certain graphs. In: 18th Allerton Conference, pp. 677\u2013686 (1980)"},{"key":"3_CR8","volume-title":"Sorting and searching, Addison-Wesley Series in Computer Science and Information Processing","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming. In: Sorting and searching, Addison-Wesley Series in Computer Science and Information Processing, vol.\u00a03, Addison-Wesley Publishing Co., Reading (1973)"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","volume":"22","author":"R. Lowrance","year":"1975","unstructured":"Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. Assoc. Comput. Mach.\u00a022, 177\u2013183 (1975)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90109-B","volume":"35","author":"M. Maes","year":"1990","unstructured":"Maes, M.: On a cyclic string-to-string correction problem. Inform. Process. Lett.\u00a035(2), 73\u201378 (1990)","journal-title":"Inform. Process. Lett."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: International Conference on Pattern Recognition, pp. 891\u2013894 (2000)","DOI":"10.1109\/ICPR.2000.906217"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"\u0160tefankovi\u010d, D., Pelsmajer, M.J., Schaefer, M.: Removing even crossings. In: Felsner, S. (ed.) EuroComb 2005, DMTCS Proceedings. Discrete Mathematics and Theoretical Computer Science, vol.\u00a0AE, pp. 105\u2013110 (2005)","DOI":"10.46298\/dmtcs.3430"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/11618058_35","volume-title":"Graph Drawing","author":"M.J. Pelsmajer","year":"2006","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Odd crossing number is not crossing number. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 386\u2013396. Springer, Heidelberg (2006)"},{"key":"3_CR14","unstructured":"Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Removing even crossings. J. Combin. Theory Ser. B (to appear)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Wagner, R.A.: On the complexity of the extended string-to-string correction problem. In: Robert, A. (ed.) Seventh Annual ACM Symposium on Theory of Computing, Albuquerque, N.M., Assoc. Comput. Mach., New York, pp. 218\u2013223 (1975)","DOI":"10.1145\/800116.803771"}],"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_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,26]],"date-time":"2025-01-26T12:28:06Z","timestamp":1737894486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_3","relation":{},"subject":[]}}