{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:29Z","timestamp":1725467909062},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649526"},{"type":"electronic","value":"9783540499206"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/bfb0057945","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T15:01:27Z","timestamp":1154444487000},"page":"892-896","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Parameterized parallel complexity"],"prefix":"10.1007","author":[{"given":"Marco","family":"Cesati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,30]]},"reference":[{"key":"111_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12, 308\u2013340, 1991.","journal-title":"Journal of Algorithms"},{"key":"111_CR2","unstructured":"Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical Report, Department of Computer Science, Utrecht University, 1995."},{"key":"111_CR3","unstructured":"Hans L. Bodlaender, Rodney G. Downey, and Michael R. Fellows. Applications of parameterized complexity to problems of parallel and distributed computation, 1994. Unpublished extended abstract."},{"key":"111_CR4","doi-asserted-by":"crossref","unstructured":"Hans L. Bodlaender and Torben Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. Technical Report UU-CS-1995-25, Department of Computer Science, Utrecht University, 1995.","DOI":"10.1007\/3-540-60084-1_80"},{"key":"111_CR5","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. J. of the ACM, 28, 114\u2013133, 1981.","journal-title":"J. of the ACM"},{"key":"111_CR6","first-page":"219","volume-title":"Feasible Mathematics II","author":"R. G. Downey","year":"1994","unstructured":"Rodney G. Downey and Michael R. Fellows. Parameterized computational feasibility. Feasible Mathematics II, 219\u2013244. Birkh\u00e4user, Boston, 1994."},{"key":"111_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R. G. Downey","year":"1995","unstructured":"Rodney G. Downey and Michael R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. TCS, 141, 109\u2013131, 1995.","journal-title":"TCS"},{"key":"111_CR8","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Michael R. Garey and Davis S. Johnson. Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, 1979."},{"key":"111_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Neil Robertson and Paul D. Seymour. Graph Minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7, 309\u2013322, 1986.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"111_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L. Stockmeyer","year":"1984","unstructured":"Larry Stockmeyer and Uzi Vishkin. Simulation of parallel random access machines by circuits. SIAM J. Comput., 13(2), 409\u2013422, 1984.","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201998 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0057945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:08:28Z","timestamp":1587341308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0057945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649526","9783540499206"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0057945","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"30 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}