{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:54Z","timestamp":1725455574957},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024492","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"109-117","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms for the treewidth and minimum fill-in of HHD-free graphs"],"prefix":"10.1007","author":[{"given":"H. J.","family":"Broersma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Dahlhaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., D. G. Corneil and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth. 8, (1987), pp. 277\u2013284.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"11_CR2","series-title":"Technical report RUU-CS-1995-34","volume-title":"Treewidth and minimum fill-in on d-trapezoid graphs","author":"H. Bodlaender","year":"1995","unstructured":"Bodlaender, H., T. Kloks, D. Kratsch and H. M\u00fcller, Treewidth and minimum fill-in on d-trapezoid graphs, Technical report RUU-CS-1995-34, Utrecht University, The Netherlands, 1995."},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","volume":"7","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H. and R. M\u00f6hring, The pathwidth and treewidth of cographs, SIAM Journal on Discrete Mathematics 7 (1993), pp. 181\u2013188.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR4","unstructured":"Brandst\u00e4dt, A., Special graph classes \u2014 A survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199 (1991), Universit\u00e4t Duisburg Gesamthochschule."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Maw-Shang Chang, Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs. ISAAC'96 (T. Asano et al. ed.), LLNCS 1178, pp. 146\u2013155.","DOI":"10.1007\/BFb0009490"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G. A. Dirac","year":"1961","unstructured":"Dirac, G. A., On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25, (1961), pp. 71\u201376.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"11_CR7","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic M. C., Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980."},{"key":"11_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P. L. Hammer","year":"1990","unstructured":"Hammer, P. L. and F. Maffray, Completely separable graphs, Discrete Applied Mathematics 27, (1990), pp. 85\u201399.","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01788689","volume":"5","author":"R. Hayward","year":"1989","unstructured":"Hayward, R., C. T. Hoang and F. Maffray, Optimizing weakly triangulated graphs, Graphs and combinatorics 5, (1989), pp. 339\u2013349.","journal-title":"Graphs and combinatorics"},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","volume":"9","author":"B. Jamison","year":"1988","unstructured":"Jamison, B. and S. Olariu, On the semi-perfect elimination, Advances in Applied Mathematics 9, (1988), pp. 364\u2013376.","journal-title":"Advances in Applied Mathematics"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kloks, T., Treewidth \u2014 Computations and Approximations, Springer Verlag, Lecture Notes in Computer Science 842, (1994).","DOI":"10.1007\/BFb0045375"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1142\/S0129054196000099","volume":"7","author":"T. Kloks","year":"1996","unstructured":"Kloks, T., Treewidth of circle graphs, International Journal of Foundations of Computer Science 7, (1996), pp. 111\u2013120.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jagm.1995.1037","volume":"19","author":"T. Kloks","year":"1995","unstructured":"Kloks, T. and D. Kratsch, Treewidth of chordal bipartite graphs, J. of Algorithms 19, (1995), pp. 266\u2013281.","journal-title":"J. of Algorithms"},{"key":"11_CR14","unstructured":"Kloks, T., D. Kratsch and H. M\u00fcller, Approximating the bandwidth for AT-free graphs, Proceedings of the Third Annual European Symposium on Algorithms (ESA'95), Springer-Verlag, Lecture Notes in Computer Science 979, (1995), pp. 434\u2013447."},{"key":"11_CR15","series-title":"Computing Science Notes","volume-title":"Treewidth and pathwidth of cocomparability graphs of bounded dimension","author":"T. Kloks","year":"1993","unstructured":"Kloks, T., D. Kratsch and J. Spinrad, Treewidth and pathwidth of cocomparability graphs of bounded dimension, Computing Science Notes, 93\/46, Eindhoven University of Technology, Eindhoven, The Netherlands, (1993), to appear in Order."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Kloks, T., D. Kratsch and C. K. Wong, Minimum fill-in of circle and circular arc graphs, Proceedings of the 21 th International Symposium on Automata, Languages and Programming (ICALP'96), Springer-Verlag Lecture Notes in Computer Science 1113, (1996), pp. 256\u2013267.","DOI":"10.1007\/3-540-61440-0_133"},{"key":"11_CR17","volume-title":"Results on perfect graphs","author":"S. Olariu","year":"1986","unstructured":"Olariu, S., Results on perfect graphs, PhD thesis, Scool of Computer Science, McGill University, Montreal, 1986."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Parra, A., Scheffler, P., How to use minimal separators for its chordal triangulation, ICALP'95, LLNCS 944, pp. 123\u2013134.","DOI":"10.1007\/3-540-60084-1_68"},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J. Spinrad","year":"1987","unstructured":"Spinrad, J., A. Brandst\u00e4dt and L. Stewart, Bipartite permutation graphs, Discrete Applied mathematics 18, (1987), pp. 279\u2013292.","journal-title":"Discrete Applied mathematics"},{"key":"11_CR20","unstructured":"Sundaram, R., K. Sher Singh and C. Pandu Rangan, Treewidth of circular arc graphs. To appear in SIAM J. Disc. Math."},{"key":"11_CR21","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M., Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth. 2, (1981), pp. 77\u201379.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:20Z","timestamp":1586568920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0024492","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}