{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:17:03Z","timestamp":1725862623383},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_9","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"116-121","source":"Crossref","is-referenced-by-count":2,"title":["On the Number of Minimal Separators in Graphs"],"prefix":"10.1007","author":[{"given":"Serge","family":"Gaspers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Mackenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1142\/S0129054100000211","volume":"11","author":"A Berry","year":"2000","unstructured":"Berry, A., Bordat, J.P., Cogis, O.: Generating all the minimal separators of a graph. Int. J. Found. Comput. Sci. 11(3), 397\u2013403 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31, 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"9_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(01)00007-X","volume":"276","author":"V Bouchitt\u00e9","year":"2002","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Listing all potential maximal cliques of a graph. Theor. Comput. Sci. 276(1\u20132), 17\u201332 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2010)"},{"issue":"4","key":"9_CR5","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/1198513.1198515","volume":"2","author":"D Eppstein","year":"2006","unstructured":"Eppstein, D.: Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms. ACM Trans. Algorithms 2(4), 492\u2013509 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00453-007-9152-0","volume":"52","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V., Razgon, I.: On the minimum feedback vertex set problem: exact and enumeration algorithms. Algorithmica 52(2), 293\u2013307 (2008)","journal-title":"Algorithmica"},{"issue":"5","key":"9_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1552285.1552286","volume":"56","author":"FV Fomin","year":"2009","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 1\u201332 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"9_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1435375.1435384","volume":"5","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Grandoni, F., Pyatkin, A.V., Stepanov, A.A.: Combinatorial bounds via measure and conquer: bounding minimal dominating sets and applications. ACM Trans. Algorithms 5(1), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)"},{"issue":"3","key":"9_CR10","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1137\/050643350","volume":"38","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Kratsch, D., Todinca, I., Villanger, Y.: Exact algorithms for treewidth and minimum fill-in. SIAM J. Comput. 38(3), 1058\u20131079 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9_CR11","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/140964801","volume":"44","author":"FV Fomin","year":"2015","unstructured":"Fomin, F.V., Todinca, I., Villanger, Y.: Large induced subgraphs via triangulations and CMSO. SIAM J. Comput. 44(1), 54\u201387 (2015)","journal-title":"SIAM J. Comput."},{"key":"9_CR12","unstructured":"Fomin, F.V., Villanger, Y.: Finding induced subgraphs via minimal triangulations. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010). LIPIcs, vol. 5, pp. 383\u2013394. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)"},{"issue":"3","key":"9_CR13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00493-012-2536-z","volume":"32","author":"FV Fomin","year":"2012","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth computation and extremal combinatorics. Combinatorica 32(3), 289\u2013308 (2012)","journal-title":"Combinatorica"},{"key":"9_CR14","unstructured":"Gaspers, S.: Exponential Time Algorithms: Structures, Measures, and Bounds. VDM Verlag Dr. Mueller e.K. (2010)"},{"issue":"1","key":"9_CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.jcss.2011.05.010","volume":"78","author":"S Gaspers","year":"2012","unstructured":"Gaspers, S., Sorkin, G.B.: A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. J. Comput. Syst. Sci. 78(1), 305\u2013335 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9_CR16","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.disc.2005.12.003","volume":"306","author":"P Heggernes","year":"2006","unstructured":"Heggernes, P.: Minimal triangulations of graphs: a survey. Discrete Math. 306(3), 297\u2013317 (2006)","journal-title":"Discrete Math."},{"issue":"3","key":"9_CR17","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S009753979427087X","volume":"27","author":"T Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D.: Listing all minimal separators of a graph. SIAM J. Comput. 27(3), 605\u2013613 (1998)","journal-title":"SIAM J. Comput."},{"key":"9_CR18","unstructured":"Miller, R.E., Muller, D.E.: A problem of maximum consistent subsets. IBM Research Report RC-240, J.T. Watson Research Center, Yorktown Heights, NY (1960)"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Isr. J. Math. 3, 23\u201328 (1965)","journal-title":"Isr. J. Math."},{"issue":"1\u20133","key":"9_CR20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0166-218X(97)00041-3","volume":"79","author":"A Parra","year":"1997","unstructured":"Parra, A., Scheffler, P.: Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math. 79(1\u20133), 171\u2013188 (1997)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"9_CR21","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0304-3975(97)83809-1","volume":"180","author":"H Shen","year":"1997","unstructured":"Shen, H., Liang, W.: Efficient enumeration of all minimal separators in a graph. Theor. Comput. Sci. 180(1\u20132), 169\u2013180 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1007\/11682462_73","volume-title":"LATIN 2006: Theoretical Informatics","author":"Y Villanger","year":"2006","unstructured":"Villanger, Y.: Improved exponential-time algorithms for treewidth and minimum fill-in. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 800\u2013811. Springer, Heidelberg (2006)"}],"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\/978-3-662-53174-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:57:44Z","timestamp":1498319864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}