{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T17:28:20Z","timestamp":1768411700049,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7137,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0166-218x(92)00122-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"129-145","source":"Crossref","is-referenced-by-count":12,"title":["On some optimization problems on k-trees and partial k-trees"],"prefix":"10.1016","volume":"48","author":[{"given":"Daniel","family":"Granot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darko","family":"Skorin-Kapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)00122-3_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability - A survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0166-218X(92)00122-3_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00122-3_BIB3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0607033","article-title":"Characterization and recognition of partial 3-trees","volume":"7","author":"Arnborg","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00122-3_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","article-title":"Linear time algorithms for NP-hard problems restricted to partial k-trees","volume":"23","author":"Arnborg","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00122-3_BIB5","series-title":"RUU-CS-86-22","article-title":"Classes of graphs with bounded tree-width","author":"Bodlaender","year":"1986"},{"key":"10.1016\/0166-218X(92)00122-3_BIB6","series-title":"Proceedings 15th International Workshop on Graph Theoretic Concepts in Computer Science WG'89","first-page":"232","article-title":"Improved self-reduction algorithms for graphs with bounded treewidth","volume":"411","author":"Bodlaender","year":"1990"},{"key":"10.1016\/0166-218X(92)00122-3_BIB7","series-title":"Proceedings International Conference Automata, Languages, Programming","first-page":"128","article-title":"Concurrent transmission in broadcast networks","volume":"172","author":"Colbourn","year":"1984"},{"key":"10.1016\/0166-218X(92)00122-3_BIB8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.3230110304","article-title":"Networks immune to isolated failures","volume":"11","author":"Farley","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)00122-3_BIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF00978378","article-title":"Partitioning trees: matching, domination, and maximum diameter","volume":"10","author":"Farley","year":"1981","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0166-218X(92)00122-3_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(80)90039-6","article-title":"Computation of the center and diameter of outerplanar graphs","volume":"2","author":"Farley","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)00122-3_BIB11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230120404","article-title":"Networks immune to isolated line failures","volume":"12","author":"Farley","year":"1982","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)00122-3_BIB12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum coloring by cliques and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)00122-3_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(92)00122-3_BIB14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/trsc.7.3.287","article-title":"Minimax location of a facility in an undirected tree graph","volume":"7","author":"Handler","year":"1973","journal-title":"Transportation Sci."},{"key":"10.1016\/0166-218X(92)00122-3_BIB15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/0607043","article-title":"Efficient algorithms for optimization and selection on series-parallel graphs","volume":"7","author":"Hassin","year":"1986","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)00122-3_BIB16","series-title":"Discrete Location Theory","article-title":"Covering problems","author":"Kolen","year":"1990"},{"key":"10.1016\/0166-218X(92)00122-3_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(91)90020-Y","article-title":"Algorithms finding tree-decompositions of graphs","volume":"12","author":"Matousek","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)00122-3_BIB18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1002\/net.3230150104","article-title":"The most reliable series-parallel networks","volume":"15","author":"Neufeldt","year":"1985","journal-title":"Networks"},{"key":"10.1016\/0166-218X(92)00122-3_BIB19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(84)90164-X","article-title":"Separating subgraphs in k-trees: cables and caterpillars","volume":"49","author":"Proskurowski","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)00122-3_BIB20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Algorithmic aspects of tree width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)00122-3_BIB21","first-page":"275","article-title":"On simple characterizations of k-trees","volume":"49","author":"Rose","year":"1984","journal-title":"Discrete. Math."},{"key":"10.1016\/0166-218X(92)00122-3_BIB22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","article-title":"Steiner trees, partial 2-trees, and minimum IFI networks","volume":"13","author":"Wald","year":"1983","journal-title":"Networks"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92001223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92001223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:26:42Z","timestamp":1555122402000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92001223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0166218X92001223"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)00122-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}