{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:20:38Z","timestamp":1740097238290,"version":"3.37.3"},"publisher-location":"New York, NY","reference-count":8,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_513","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:48:01Z","timestamp":1553100481000},"page":"664-667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exact Algorithms for Bandwidth"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"122_CR5248","doi-asserted-by":"crossref","unstructured":"Bodlaender HL, Fellows MR, Hallett MT (1994) Beyond np-completeness for problems of bounded width: hardness for the W hierarchy. In: Leighton FT, Goodrich MT (eds) Proceedings of the twenty-sixth annual ACM symposium on theory of computing, Montr\u00e9al, 23\u201325 May 1994. ACM, pp\u00a0449\u2013458, doi:10.1145\/195058.195229. \n                  http:\/\/doi.acm.org\/10.1145\/195058.195229","DOI":"10.1145\/195058.195229"},{"key":"122_CR5249","doi-asserted-by":"crossref","unstructured":"Cygan M, Pilipczuk M (2008) Faster exact bandwidth. In: Broersma H, Erlebach T, Friedetzky T, Paulusma D (eds) Graph-theoretic concepts in computer science, 34th international workshop, WG 2008, Durham, June 30\u2013July 2, 2008. Revised papers, Lecture notes in computer science, vol\u00a05344, pp\u00a0101\u2013109. doi:10.1007\/978-3-540-92248-3_10. \n                  http:\/\/dx.doi.org\/10.1007\/978-3-540-92248-3_10","DOI":"10.1007\/978-3-540-92248-3_10"},{"key":"122_CR5250","doi-asserted-by":"crossref","unstructured":"Cygan M, Pilipczuk M (2010) Exact and approximate bandwidth. Theor Comput Sci 411(40\u201342):3701\u20133713. doi:10.1016\/j.tcs.2010.06.018. \n                  http:\/\/dx.doi.org\/10.1016\/j.tcs.2010.06.018","DOI":"10.1016\/j.tcs.2010.06.018"},{"key":"122_CR5251","doi-asserted-by":"crossref","unstructured":"Cygan M, Pilipczuk M (2012) Bandwidth and distortion revisited. Discret Appl Math 160(4\u20135):494\u2013504. doi:10.1016\/j.dam.2011.10.032. \n                  http:\/\/dx.doi.org\/10.1016\/j.dam.2011.10.032","DOI":"10.1016\/j.dam.2011.10.032"},{"key":"122_CR5252","doi-asserted-by":"crossref","unstructured":"Cygan M, Pilipczuk M (2012) Even faster exact bandwidth. ACM Trans Algorithms\u00a08(1):8. doi:10.1145\/2071379.2071387. \n                  http:\/\/doi.acm.org\/10.1145\/2071379.2071387","DOI":"10.1145\/2071379.2071387"},{"key":"122_CR5253","doi-asserted-by":"crossref","unstructured":"Feige U (2000) Coping with the np-hardness of the graph bandwidth problem. In: Halld\u00f3rsson MM (ed) Proceedings of the 7th Scandinavian workshop on algorithm theory (SWAT), Bergen. Lecture notes in computer science, vol\u00a01851. Springer, pp\u00a010\u201319","DOI":"10.1007\/3-540-44985-X_2"},{"key":"122_CR5254","doi-asserted-by":"crossref","unstructured":"Fomin FV, Lokshtanov D, Saurabh S (2011) An exact algorithm for minimum distortion embedding. Theor Comput Sci 412(29):3530\u20133536. doi:10.1016\/j.tcs.2011.02.043. \n                  http:\/\/dx.doi.org\/10.1016\/j.tcs.2011.02.043","DOI":"10.1016\/j.tcs.2011.02.043"},{"key":"122_CR5255","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J Saxe","year":"1980","unstructured":"Saxe J (1980) Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J Algebr Methods 1:363\u2013369","journal-title":"SIAM J Algebr Methods"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T17:26:22Z","timestamp":1553102782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_513","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}