{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T21:35:08Z","timestamp":1753738508712},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_284","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:07:09Z","timestamp":1330258029000},"page":"610-621","source":"Crossref","is-referenced-by-count":24,"title":["Practical algorithms on partial k-trees with an application to domination-like problems"],"prefix":"10.1007","author":[{"given":"Jan Arne","family":"Telle","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"K.Abrahamson and M.Fellows, Finite automata, bounded treewidth and wellquasiordering, to appear in Contemporary Mathematics (1992).","DOI":"10.1090\/conm\/147\/01199"},{"key":"56_CR2","unstructured":"S.Arnborg, S.Hedetniemi and A.Proskurowski (editors) Algorithms on graphs with bounded treewidth, Special issue of Discrete Applied Mathematics."},{"key":"56_CR3","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. of Algorithms 12(1991) 308\u2013340.","journal-title":"J. of Algorithms"},{"key":"56_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","volume":"7","author":"S. Arnborg","year":"1986","unstructured":"S. Arnborg and A. Proskurowski, Characterization and recognition of partial 3-trees, SIAM J. Alg. and Discr. Methods 7 (1986) 305\u2013314.","journal-title":"SIAM J. Alg. and Discr. Methods"},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"S.Arnborg and A.Proskurowski, Linear time algorithms for NP-hard problems on graphs embedded in k-trees, Discr. Appl. Math. 23 (1989) 11\u201324.","journal-title":"Discr. Appl. Math."},{"key":"56_CR6","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"M.W.Bern, E.L.Lawler and A.L.Wong, Linear-time computation of optimal subgraphs of decomposable graphs, J. of Algorithms 8(1987) 216\u2013235.","journal-title":"J. of Algorithms"},{"key":"56_CR7","first-page":"105","volume":"317","author":"H.L. Bodlaender","year":"1988","unstructured":"H.L.Bodlaender, Dynamic programming on graphs with bounded treewidth, Proceedings ICALP 88, LNCS vol.317 (1988) 105\u2013119.","journal-title":"LNCS"},{"key":"56_CR8","unstructured":"H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, to appear in Proceedings STOC'93."},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"J.A.Bondy and U.S.R.Murty, Graph theory with applications, 1976.","DOI":"10.1007\/978-1-349-03521-2"},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R.B. Borie","year":"1992","unstructured":"R.B.Borie, R.G.Parker and C.A.Tovey, Automatic generation of linear algorithms from predicate calculus descriptions of problems on recursive constructed graph families, Algorithmica, 7:555\u2013582, 1992.","journal-title":"Algorithmica"},{"key":"56_CR11","unstructured":"E.J.Cockayne, B.L.Hartnell, S.T.Hedetniemi and R.Laskar, Perfect domination in graphs, manuscript (1992), to appear in Special issue of JCISS."},{"key":"56_CR12","doi-asserted-by":"publisher","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":"56_CR13","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"M.Garey and D.Johnson, Computers and Intractability, Freeman, San Fransisco, 1979."},{"key":"56_CR14","unstructured":"D.Grinstead and P.Slater, A recurrence template for several parameters in seriesparallel graphs, manuscript (1992)."},{"key":"56_CR15","first-page":"550","volume-title":"Handbook of Theoretical Computer Science vol. A","author":"J. Leeuwen van","year":"1990","unstructured":"J. van Leeuwen, Graph Algorithms, in Handbook of Theoretical Computer Science vol. A, Elsevier, Amsterdam, (1990) pg. 550."},{"key":"56_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","volume":"12","author":"J. Matou\u0161ek","year":"1991","unstructured":"J.Matou\u0161ek and R.Thomas, Algorithms finding tree-decompositions of graphs, J. of Algorithms, 12 (1991) 1\u201322.","journal-title":"J. of Algorithms"},{"key":"56_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-7091-9076-0_1","volume":"7","author":"A. Proskurowski","year":"1990","unstructured":"A.Proskurowski and M.Syslo, Efficient computations in tree-like graphs, in Computing Suppl 7, (1990) 1\u201315.","journal-title":"Computing Suppl"},{"key":"56_CR18","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P.D. Seymour, Graph minors II: algorithmic aspects of tree-width, J. of Algorithms 7 (1986) 309\u2013322.","journal-title":"J. of Algorithms"},{"key":"56_CR19","unstructured":"D.Sanders, On linear recognition of tree-width at most four, manuscript (1992)."},{"key":"56_CR20","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"K.Takamizawa, T.Nishizeki and N.Saito, Linear-time computability of combinatorial problems on series-parallel graphs, J. ACM 29(1982) 623\u2013641.","journal-title":"J. ACM"},{"key":"56_CR21","unstructured":"J.A.Teile, Characterization of domination-type parameters in graphs, to appear in Proceedings of 24th SouthEastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium."},{"key":"56_CR22","unstructured":"J.A.Telle, Complexity of domination-type problems in graphs, submitted BIT."},{"key":"56_CR23","unstructured":"J.A.Telle and A.Proskurowski, Efficient sets in partial k-trees, to appear in Domination in graphs, Special volume of Discrete Applied Mathematics."},{"key":"56_CR24","volume-title":"Ph.D. thesis","author":"T. Wimer","year":"1988","unstructured":"T.Wimer, Linear time algorithms on k-terminal graphs. Ph.D. thesis, Clemson University, South Carolina, (1988)."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_284.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:25Z","timestamp":1605647305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_284","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}