{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:14Z","timestamp":1725551894424},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_16","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T11:37:18Z","timestamp":1136461038000},"page":"187-196","source":"Crossref","is-referenced-by-count":0,"title":["Searching Paths of Constant Bandwidth"],"prefix":"10.1007","author":[{"given":"Bernd","family":"Borchert","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Reinhardt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-Coding. J. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1995.1156","volume":"123","author":"L. Cai","year":"1995","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: On the Structure of Parameterized Problems in NP. Inf. Comput.\u00a0123(1), 38\u201349 (1995)","journal-title":"Inf. Comput."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-Parameter Intractability. In: Structure in Complexity Theory Conference, pp. 36\u201349 (1992)","DOI":"10.1109\/SCT.1992.215379"},{"key":"16_CR4","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)"},{"key":"16_CR5","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to Find Long Paths Efficiently. Annals of Discrete Mathematics\u00a025, 239\u2013254 (1985)","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"16_CR6","first-page":"167","volume":"3","author":"A. Proskurowski","year":"1999","unstructured":"Proskurowski, A., Telle, J.A.: Classes of Graphs with Restricted Interval Models. Discrete Mathematics & Theoretical Computer Science\u00a03(4), 167\u2013176 (1999)","journal-title":"Discrete Mathematics & Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:09:23Z","timestamp":1619492963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11611257_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}