{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:17Z","timestamp":1759063697368},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0012-365x(03)00230-9","type":"journal-article","created":{"date-parts":[[2003,9,12]],"date-time":"2003-09-12T14:49:36Z","timestamp":1063378176000},"page":"85-102","source":"Crossref","is-referenced-by-count":19,"title":["Chordal embeddings of planar graphs"],"prefix":"10.1016","volume":"273","author":[{"given":"V.","family":"Bouchitt\u00e9","sequence":"first","affiliation":[]},{"given":"F.","family":"Mazoit","sequence":"additional","affiliation":[]},{"given":"I.","family":"Todinca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00230-9_BIB1","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\/S0012-365X(03)00230-9_BIB2","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/S089548019223992X","article-title":"Treewidth and pathwidth of permutation graphs","volume":"8","author":"Bodlaender","year":"1995","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/S0012-365X(03)00230-9_BIB3","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539799359683","article-title":"Treewidth and minimum fill-in","volume":"31","author":"Bouchitt\u00e9","year":"2001","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"10.1016\/S0012-365X(03)00230-9_BIB4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(01)00007-X","article-title":"Listing all potential maximal cliques of a graph","volume":"276","author":"Bouchitt\u00e9","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(03)00230-9_BIB5","series-title":"Graph Theory","author":"Diestel","year":"1997"},{"issue":"3","key":"10.1016\/S0012-365X(03)00230-9_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","article-title":"Subgraph isomorphism in planar graphs and related problems","volume":"3","author":"Eppstein","year":"1999","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/S0012-365X(03)00230-9_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(03)00230-9_BIB8","doi-asserted-by":"crossref","unstructured":"T. Kloks, Treewidth of circle graphs, in: Proceedings of the Fourth Annual International Symposium on Algorithms and Computation (ISAAC\u201993), Lecture Notes in Computer Science, Vol. 762, Springer, Berlin, 1993, pp. 108\u2013117.","DOI":"10.1007\/3-540-57568-5_240"},{"issue":"2","key":"10.1016\/S0012-365X(03)00230-9_BIB9","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jagm.1995.1037","article-title":"Treewidth of chordal bipartite graphs","volume":"19","author":"Kloks","year":"1995","journal-title":"J. Algorithms"},{"key":"10.1016\/S0012-365X(03)00230-9_BIB10","doi-asserted-by":"crossref","unstructured":"T. Kloks, D. Kratsch, H. M\u00fcller, Approximating the bandwidth for asteroidal triple-free graphs, in: Proceedings of the Third Annual European Symposium on Algorithms (ESA\u201995), Lecture Notes in Computer Science, Vol. 979, Springer, Berlin, 1995, pp. 434\u2013447.","DOI":"10.1007\/3-540-60313-1_161"},{"key":"10.1016\/S0012-365X(03)00230-9_BIB11","unstructured":"D. Lapoire, Treewidth and duality in planar hypergraphs. http:\/\/dept-info.labri.u-bordeaux.fr\/~lapoire\/papers\/dual_planar_treewidth.ps."},{"issue":"1\u20133","key":"10.1016\/S0012-365X(03)00230-9_BIB12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0166-218X(97)00041-3","article-title":"Characterizations and algorithmic applications of chordal graph embeddings","volume":"79","author":"Parra","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(03)00230-9_BIB13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graphs minors. III. Planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(03)00230-9_BIB14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graphs minors. II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"issue":"2","key":"10.1016\/S0012-365X(03)00230-9_BIB15","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01215352","article-title":"Call routing and the ratcatcher","volume":"14","author":"Seymour","year":"1994","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(03)00230-9_BIB16","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0895480191193789","article-title":"Treewidth of circular-arc graphs","volume":"7","author":"Sundaram","year":"1994","journal-title":"SIAM J. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:21:26Z","timestamp":1551014486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0012365X03002309"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00230-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}