{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:53:17Z","timestamp":1756000397505},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_42","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"503-515","source":"Crossref","is-referenced-by-count":5,"title":["Listing All Potential Maximal Cliques of a Graph"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Bouchitt\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioan","family":"Todinca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. on Algebraic and Discrete Methods, 8:277\u2013284, 1987.","journal-title":"SIAM J. on Algebraic and Discrete Methods"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/174147.169807","volume":"40","author":"S. Arnborg","year":"1993","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. J. of ACM, 40:1134\u20131164, 1993.","journal-title":"J. of ACM"},{"key":"42_CR3","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 restricted to partial k-trees. Discrete Applied Mathematics, 23:11\u201324, 1989.","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Workshop on Graphs WG\u201999","author":"A. Berry","year":"1999","unstructured":"A. Berry, J.P. Bordat, and O. Cogis. Generating all the minimal separators of a graph. In Workshop on Graphs WG\u201999, Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"42_CR5","first-page":"1","volume":"11","author":"H. Bodlaender","year":"1993","unstructured":"H. Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11:1\u201323, 1993.","journal-title":"Acta Cybernetica"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"H. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. Siam J. Computing, 25:1305\u20131317, 1996.","journal-title":"Siam J. Computing"},{"key":"42_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Proceedings of MFCS\u201997","author":"H. Bodlaender","year":"1997","unstructured":"H. Bodlaender. Treewidth: Algorithmic techniques and results. In Proceedings of MFCS\u201997, volume 1295 of Lecture Notes in Computer Science, pages 19\u201336. Springer-Verlag, 1997."},{"key":"42_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-61332-3_153","volume-title":"Proceedings of COCOON\u201996","author":"H. Bodlaender","year":"1996","unstructured":"H. Bodlaender and B. de Fluiter. Reduction algorithms for constructing solutions of graphs with small treewidth. In Proceedings of COCOON\u201996, volume 1090 of Lecture Notes in Computer Science, pages 199\u2013208. Springer-Verlag, 1996."},{"key":"42_CR9","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"H. Bodlaender","year":"1995","unstructured":"H. Bodlaender, J.R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, and minimum elimination tree height. J. of Algorithms, 18:238\u2013255, 1995.","journal-title":"J. of Algorithms"},{"key":"42_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-68530-8_29","volume-title":"Proceedings 6th Annual European Symposium on Algorithms (ESA\u201998)","author":"V. Bouchitt\u00e9","year":"1998","unstructured":"V. Bouchitt\u00e9 and I. Todinca. Minimal triangulations for graphs with \u201cfew\u201d minimal separators. In Proceedings 6th Annual European Symposium on Algorithms (ESA\u201998), volume 1461 of Lecture Notes in Computer Science, pages 344\u2013355. Springer-Verlag, 1998."},{"key":"42_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-49116-3_18","volume-title":"Proceedings 16th Symposium of Theoretical Aspects in Computer Science (STACS\u201999)","author":"V. Bouchitt\u00e9","year":"1999","unstructured":"V. Bouchitt\u00e9 and I. Todinca. Treewidth and minimum fill-in of weakly triangulated graphs. In Proceedings 16th Symposium of Theoretical Aspects in Computer Science (STACS\u201999), volume 1563 of Lecture Notes in Computer Science, pages 197\u2013206. Springer-Verlag, 1999."},{"key":"42_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BFb0009490","volume-title":"ISAAC\u201996","author":"M. S. Chang","year":"1996","unstructured":"M. S. Chang. Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs. In ISAAC\u201996, volume 1178 of Lecture Notes in Computer Science, pages 146\u2013155. Springer-Verlag, 1996."},{"key":"42_CR13","first-page":"257","volume":"26","author":"B. Courcelle","year":"1992","unstructured":"B. Courcelle. The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues. Informatique Th\u00e9orique, 26:257\u2013286, 1992.","journal-title":"Informatique Th\u00e9orique"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"B. Courcelle and M. Moshbah. Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science, 109:49\u201382, 1993.","journal-title":"Theoretical Computer Science"},{"key":"42_CR15","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"42_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-63165-8_186","volume-title":"Proceedings 24th International Colloquium on Automata, Languages, and Programming (ICALP\u201997)","author":"T. Hagerup","year":"1997","unstructured":"T. Hagerup. Dynamic algorithms for graphs of bounded treewidth. In Proceedings 24th International Colloquium on Automata, Languages, and Programming (ICALP\u201997), Lecture Notes in Computer Science, pages 292\u2013302. Springer-Verlag, 1997."},{"key":"42_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-57273-2_61","volume-title":"Proceedings First Annual European Symposium on Algorithms (ESA\u201993)","author":"T. Kloks","year":"1993","unstructured":"T. Kloks, H.L. Bodlaender, H. M\u00fcller, and D. Kratsch. Computing treewidth and minimum fill-in: all you need are the minimal separators. In Proceedings First Annual European Symposium on Algorithms (ESA\u201993), volume 726 of Lecture Notes in Computer Science, pages 260\u2013271. Springer-Verlag, 1993."},{"key":"42_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/BFb0049435","volume-title":"Proceedings Second Annual European Symposium on Algorithms (ESA\u201994)","author":"T. Kloks","year":"1994","unstructured":"T. Kloks, H.L. Bodlaender, H. M\u00fcller, and D. Kratsch. Erratum to the ESA\u201993 proceedings. In Proceedings Second Annual European Symposium on Algorithms (ESA\u201994), volume 855 of Lecture Notes in Computer Science, page 508. Springer-Verlag, 1994."},{"issue":"2","key":"42_CR19","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1006\/jagm.1995.1037","volume":"19","author":"T. Kloks","year":"1995","unstructured":"T. Kloks and D. Kratsch. Treewidth of chordal bipartite graphs. J. Algorithms, 19(2):266\u2013281, 1995.","journal-title":"J. Algorithms"},{"issue":"3","key":"42_CR20","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T. Kloks","year":"1998","unstructured":"T. Kloks and D. Kratsch. Listing all minimal separators of a graph. SIAM J. Comput., 27(3):605\u2013613, 1998.","journal-title":"SIAM J. Comput."},{"key":"42_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/3-540-60313-1_161","volume-title":"Proceedings Third Annual European Symposium on Algorithms (ESA\u201995)","author":"T. Kloks","year":"1995","unstructured":"T. Kloks, D. Kratsch, and H. M\u00fcller. Approximating the bandwidth for asteroidal triple-free graphs. In Proceedings Third Annual European Symposium on Algorithms (ESA\u201995), volume 979 of Lecture Notes in Computer Science, pages 434\u2013447. Springer-Verlag, 1995."},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0304-3975(96)00206-X","volume":"175","author":"T. Kloks","year":"1997","unstructured":"T. Kloks, D. Kratsch, and J. Spinrad. On treewidth and minimum fill-in of asteroidal triple-free graphs. Theoretical Computer Science, 175:309\u2013335, 1997.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"42_CR23","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jagm.1998.0936","volume":"28","author":"T. Kloks","year":"1998","unstructured":"T. Kloks, D. Kratsch, and C.K. Wong. Minimum fill-in of circle and circular-arc graphs. J. Algorithms, 28(2):272\u2013289, 1998.","journal-title":"J. Algorithms"},{"issue":"1\u20133","key":"42_CR24","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(97)00041-3","volume":"79","author":"A. Parra","year":"1997","unstructured":"A. Parra and P. Scheffler. Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math., 79(1\u20133):171\u2013188, 1997.","journal-title":"Discrete Appl. Math."},{"key":"42_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"N. Robertson and P. Seymour. Graphs minors. III. Planar tree-width. J. of Combinatorial Theory Series B, 36:49\u201364, 1984.","journal-title":"J. of Combinatorial Theory Series B"},{"key":"42_CR26","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P. Seymour. Graphs minors. II. Algorithmic aspects of tree-width. J. of Algorithms, 7:309\u2013322, 1986.","journal-title":"J. of Algorithms"},{"key":"42_CR27","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D.J. Rose","year":"1970","unstructured":"D.J. Rose. Triangulating graphs and the elimination process. J. Math Anal Appl., 32:597\u2013609, 1970.","journal-title":"J. Math Anal Appl."},{"key":"42_CR28","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0895480191193789","volume":"7","author":"R. Sundaram","year":"1994","unstructured":"R. Sundaram, K. Sher Singh, and C. Pandu Rangan. Treewidth of circular-arc graphs. SIAM J. Discrete Math., 7:647\u2013655, 1994.","journal-title":"SIAM J. Discrete Math."},{"key":"42_CR29","unstructured":"I. Todinca. Aspects algorithmiques des triangulations minimales des graphes. PhD thesis, \u00c9cole Normale Sup\u00e9rieure de Lyon, 1999."},{"key":"42_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"M. Yannakakis. Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 2:77\u201379, 1981.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T17:26:31Z","timestamp":1550424391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}