{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:44Z","timestamp":1725663104024},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515173"},{"type":"electronic","value":"9783540482079"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51517-8_142","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:05:01Z","timestamp":1330185901000},"page":"379-380","source":"Crossref","is-referenced-by-count":3,"title":["A combinatorial and logical approach to linear-time computability (extended abstract)"],"prefix":"10.1007","author":[{"given":"P.","family":"Scheffler","sequence":"first","affiliation":[]},{"given":"D.","family":"Seese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"Arnborg S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 a survey: BIT 25(1985), 2\u201323","journal-title":"BIT"},{"key":"63_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg S., Corneil D.G., Proskurowski A.: Complexity of finding embeddings in a k-tree: SIAM J. Alg. Disc. Meth. 8 (1987), 277\u2013284","journal-title":"SIAM J. Alg. Disc. Meth."},{"unstructured":"Arnborg S., Lagergren J., Seese D.: What problems are easy for tree-decomposable graphs: to appear","key":"63_CR3"},{"key":"63_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"Bern M.W., Lawler E.L., Wong A.L.: Linear-time computations of subgraphs of decomposable graphs: J. Alg. 8 (1987), 216\u2013235","journal-title":"J. Alg."},{"key":"63_CR5","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1137\/0608044","volume":"8","author":"D.G. Corneil","year":"1987","unstructured":"Corneil D.G., Keil J.M.: A dynamic programming approach to the dominating set problem on k-trees: SIAM J. Alg. Disc. Meth. 8 (1987), 535\u2013543","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson D.S.: The NP-completeness column: an ongoing guide: J. Algorithms 6 (1985), 434\u2013451","journal-title":"J. Algorithms"},{"key":"63_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson N., Seymour P.D.: Graph minors. II. Algorithmic aspects of tree-width: J. Algorithms 7 (1986), 309\u2013322","journal-title":"J. Algorithms"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson N., Seymour P.D.: Graph minors. V. Excluding a planar graph: J. Comb. Th. B 41 (1986), 92\u2013114","journal-title":"J. Comb. Th. B"},{"key":"63_CR9","volume-title":"Dynamic programming algorithms for tree-decomposition problems: AdW der DDR","author":"P. Scheffler","year":"1986","unstructured":"Scheffler P.: Dynamic programming algorithms for tree-decomposition problems: AdW der DDR, K.-Weierstra\u00df-Inst. f\u00fcr Mathematik, Berlin 1986 (P-MATH-28\/86)"},{"key":"63_CR10","volume-title":"Linear-time algorithms for NP-complete problems restricted to partial k-trees: AdW der DDR","author":"P. Scheffler","year":"1987","unstructured":"Scheffler P.: Linear-time algorithms for NP-complete problems restricted to partial k-trees: AdW der DDR, K.-Weierstra\u00df-Inst. f\u00fcr Mathematik, Berlin 1987 (R-MATH-03\/87)"},{"key":"63_CR11","volume-title":"Tree-partite graphs and the complexity of algorithms: AdW der DDR","author":"D. Seese","year":"1986","unstructured":"Seese D.: Tree-partite graphs and the complexity of algorithms: AdW der DDR, Karl-Weierstra\u00df-Institut f\u00fcr Mathematik, Berlin 1986 (P-MATH-8\/86)"},{"key":"63_CR12","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa K., Nishizeki T., Saito N.: Linear-time computability of combinatorial problems on series-parallel graphs: J. ACM 29 (1982), 623\u2013641","journal-title":"J. ACM"},{"unstructured":"Wimer T.V., Hedetniemi S.T.: K-teminal recursive families of graphs: Technical Report 86-May-6","key":"63_CR13"},{"key":"63_CR14","first-page":"43","volume":"50","author":"T.V. Wimer","year":"1985","unstructured":"Wimer T.V., Hedetniemi S.T., Laskar R.: A methodology for constructing linear graph algorithms: Congr. Numer. 50 (1985), 43\u201360","journal-title":"Congr. Numer."}],"container-title":["Lecture Notes in Computer Science","Eurocal '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51517-8_142.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:04:02Z","timestamp":1619557442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51517-8_142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515173","9783540482079"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-51517-8_142","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}