{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T20:27:18Z","timestamp":1782419238491,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540439967","type":"print"},{"value":"9783540456551","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45655-4_40","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:37:01Z","timestamp":1179747421000},"page":"370-380","source":"Crossref","is-referenced-by-count":10,"title":["Algorithms for Normal Curves and Surfaces"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Schaefer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Sedgwick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"I. Agol, J. Hass, and W. Thurston. 3-manifold knot genus is NP-complete. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing (STOC-2002), 2002.","DOI":"10.1145\/509907.510016"},{"key":"40_CR2","unstructured":"BE+99._M. Bern, D. Eppstein, et al. Emerging challenges in computational topology. ACM Computing Research Repository, September 1999."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"T. Dey, H. Edelsbrunner, and S. Guha. Computational topology. In B. Chazelle, J.E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics. American Mathematical Society, 1999.","DOI":"10.1090\/conm\/223\/03135"},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1006\/jcss.1998.1619","volume":"58","author":"T. Dey","year":"1999","unstructured":"T. Dey and S. Guha. Transforming curves on surfaces. JCSS: Journal of Computer and System Sciences, 58(2):297\u2013325, 1999.","journal-title":"JCSS: Journal of Computer and System Sciences"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. In IC ALP 2001, pages 543\u2013554, 2001.","DOI":"10.1007\/3-540-48224-5_45"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"A. Fomenko and S. Matveev. Algorithmic and computer methods for three-manifolds. Kluwer, 1997.","DOI":"10.1007\/978-94-017-0699-5"},{"key":"40_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-61422-2_148","volume-title":"Proceedings of SWAT\u201996","author":"L. G\u00e7sieniec","year":"1996","unstructured":"L. G\u00e7sieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. in Proceedings of SWAT\u201996, LNCS 1097, pages 392\u2013403, 1996."},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02559591","volume":"105","author":"W. Haken","year":"1961","unstructured":"W. Haken. Theorie der Normalfl\u00e4chen. Acta Mathematica, 105:245\u2013375, 1961.","journal-title":"Acta Mathematica"},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/301970.301971","volume":"46","author":"J. Hass","year":"1999","unstructured":"J. Hass, J. Lagarias, and N. Pippenger. The computational complexity of knot and link problems. Journal of ACM, 46(2):185\u2013211, 1999.","journal-title":"Journal of ACM"},{"key":"40_CR10","unstructured":"H. Kneser. Geschlossene Fl\u00e4chen in dreidimensionalen Mannigfaltigkeiten. Jahresbericht der Deutschen Mathematikver-Vereinigung, pages 248\u2013260, 1930."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"W. Plandowski and W. Rytter. Application of Lempel-Ziv encodings to the solution of words equations. In Automata, Languages and Programming, pages 731\u2013742, 1998.","DOI":"10.1007\/BFb0055097"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"W. Rytter. Algorithms on compressed strings and arrays. In Proceedings of 26th Annual Conference on Current Trends in Theory and Practice of Infomatics., 1999.","DOI":"10.1007\/3-540-47849-3_3"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"M. Schaefer, E. Sedgwick, and D. \u0160tefankovi\u010d. Recognizing string graphs in np. In Proceedings of the 33th Annual ACM Symposium on Theory of Computing (STOC-2002), 2002.","DOI":"10.1145\/509907.509910"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45655-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:27:04Z","timestamp":1556432824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45655-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439967","9783540456551"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45655-4_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}