{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:10:02Z","timestamp":1774415402235,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577850","type":"print"},{"value":"9783540483328","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_188","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:21:11Z","timestamp":1330262471000},"page":"759-768","source":"Crossref","is-referenced-by-count":8,"title":["Finding all minimal separators of a graph"],"prefix":"10.1007","author":[{"given":"T.","family":"Kloks","sequence":"first","affiliation":[]},{"given":"D.","family":"Kratsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"62_CR1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","volume":"25","author":"S. Arnborg","year":"1985","unstructured":"Arnborg, S., Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 A survey, BIT\n25, (1985), pp. 2\u201323.","journal-title":"BIT"},{"key":"62_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms\n12, (1991), pp. 308\u2013340.","journal-title":"J. Algorithms"},{"key":"62_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S. and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial k-trees, Disc. Appl. Math.\n23, (1989), pp. 305\u2013314.","journal-title":"Disc. Appl. Math."},{"key":"62_CR4","volume-title":"Technical report RUU-CS-92-12","author":"H. Bodlaender","year":"1992","unstructured":"Bodlaender, H., A tourist guide through treewidth, Technical report RUU-CS-92-12, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, (1992)."},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., A linear time algorithm for finding tree-decompositions of small treewidth, Proceedings of the 25th Annual ACM Symposium on Theory of Computing, (1993), pp. 226\u2013234.","DOI":"10.1145\/167088.167161"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., T. Kloks and D. Kratsch, Treewidth and pathwidth of permutation graphs, Proceedings of the 20th International Colloquium on Automata, Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science 700, (1993), pp. 114\u2013125.","DOI":"10.1007\/3-540-56939-1_66"},{"key":"62_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(77)90030-9","volume":"19","author":"F. Gavril","year":"1977","unstructured":"Gavril, F., Algorithms on clique separable graphs, Discrete Math.\n19 (1977), pp. 159\u2013165.","journal-title":"Discrete Math."},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, L. A., Efficient algorithms for listing combinatorial structures, Cambridge University press, 1993.","DOI":"10.1017\/CBO9780511569913"},{"key":"62_CR9","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":"62_CR10","unstructured":"Kanevsky, A., On the number of minimum size separating vertex sets in a graph and how to find all of them, Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 411\u2013421, (1990)."},{"key":"62_CR11","volume-title":"Ph.D. Thesis","author":"T. Kloks","year":"1993","unstructured":"Kloks, T., Treewidth, Ph.D. Thesis, Utrecht University, The Netherlands, 1993."},{"key":"62_CR12","unstructured":"Kloks, T., Treewidth of circle graphs, To appear in: proceedings ISAAC'94."},{"key":"62_CR13","unstructured":"Kloks, T. and D. Kratsch, Treewidth of chordal bipartite graphs, 10th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, Lecture Notes in Computer Science 665, (1993), pp. 80\u201389."},{"key":"62_CR14","volume-title":"Technical report RUU-CS-93-11","author":"T. Kloks","year":"1993","unstructured":"Kloks, T., Minimum fill-in for chordal bipatite graphs, Technical report RUU-CS-93-11, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, (1993)."},{"key":"62_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R. E. Tarjan","year":"1985","unstructured":"Tarjan, R. E., Decomposition by clique separators, Discrete Mathematics\n55 (1985), pp. 221\u2013232.","journal-title":"Discrete Mathematics"},{"key":"62_CR16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(81)90072-7","volume":"12","author":"S. H. Whitesides","year":"1981","unstructured":"Whitesides, S. H., An Algorithm for finding clique cut-sets, Information Processing Letters\n12 (1981), pp. 31\u201332.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_188.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:10Z","timestamp":1619572090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_188","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}