{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:43Z","timestamp":1759638343547},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57273-2_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:36:49Z","timestamp":1330241809000},"page":"157-168","source":"Crossref","is-referenced-by-count":22,"title":["DNA physical mapping: Three ways difficult"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael T.","family":"Hallett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. Todd","family":"Wareham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"14_CR1","unstructured":"K. Abrahamson and M. Fellows. Finite automata, bounded treewidth and well-quasiordering. Proceedings of the AMS Summer Workshop on Graph Minors (Seattle, 1991), A.M.S. Contemporary Mathematics Series, to appear."},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12 (1991), 308\u2013340.","journal-title":"J. Algorithms"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993), 226\u2013234.","DOI":"10.1145\/167088.167161"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"H. L. Bodlaender, M. R. Fellows and T. Warnow. Two Strikes Against Perfect Phylogeny. In: W. Kuich (editor), Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92). Springer-Verlag, Berlin, Lecture Notes in Computer Science, volume 623, pp. 273\u2013283.","DOI":"10.1007\/3-540-55719-9_80"},{"key":"14_CR5","unstructured":"L. Cai, J. Chen, R. Downey and M. Fellows. The Parameterized Complexity of Short Computation and Factorization. Technical Report, Department of Computer Science, University of Victoria, June 1993."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990), 12\u201375.","journal-title":"Information and Computation"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Fixed parameter intractability. Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory (1992), 36\u201349.","DOI":"10.1109\/SCT.1992.215379"},{"key":"14_CR8","unstructured":"R. G. Downey and M. R. Fellows. Fixed parameter tractability and completeness II: on completeness for W[1]. To appear."},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1002\/bies.950130108","volume":"13","author":"G. A. Evans","year":"1991","unstructured":"G. A. Evans. Combinatoric strategies for genome mapping. Bioassays 13 (1991), 39\u201344.","journal-title":"Bioassays"},{"key":"14_CR10","unstructured":"M. R. Fellows, M. T. Hallett and H. T. Wareham. The parameterized complexity of DNA physical mapping. Technical Report, Computer Science Department, University of Victoria, 1993."},{"key":"14_CR11","unstructured":"M. R. Fellows and M. T. Hallett. Bandwidth is hard for W[1]. Manuscript, July, 1993."},{"key":"14_CR12","unstructured":"M. Golumbic, H. Kaplan and R. Shamir. On the complexity of DNA physical mapping. Technical Report 271\/93, Tel Aviv University, January 1993."},{"key":"14_CR13","unstructured":"S. Kannan and T. Warnow. Triangulating three-colored graphs. Proceedings Second Annual ACM-SIAM Symposium on Discrete Algorithms (1991), 337\u2013343. To appear, SIAM J. Discr. Math."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"F. R. McMorris, T. Warnow, and T. Wimer. Triangulating vertex colored graphs. To appear, SIAM J. Discr. Math.","DOI":"10.1137\/S0895480192229273"}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:02:26Z","timestamp":1619557346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}