{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:26:41Z","timestamp":1742927201258,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031435867"},{"type":"electronic","value":"9783031435874"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43587-4_27","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T01:02:10Z","timestamp":1695258130000},"page":"378-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exact and\u00a0Parameterized Algorithms for\u00a0the\u00a0Independent Cutset Problem"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Rauch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121\u2013123 (1979). https:\/\/doi.org\/10.1016\/0020-0190(79)90002-4","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.: Dominating cliques in $$P_5$$-free graphs. Period. Math. Hung. 21(4), 303\u2013308 (1990)","journal-title":"Period. Math. Hung."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: Graph Theory and Sparse Matrix Computation, pp. 1\u201329. Springer (1993)","DOI":"10.1007\/978-1-4613-8369-7_1"},{"issue":"1\u20133","key":"27_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(00)00197-9","volume":"105","author":"A Brandst\u00e4dt","year":"2000","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, V.B., Szymczak, T.: On stable cutsets in graphs. Discret. Appl. Math. 105(1\u20133), 39\u201350 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(00)00197-9","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00453-015-9989-6","volume":"75","author":"E Camby","year":"2016","unstructured":"Camby, E., Schaudt, O.: A new characterization of $$P_k$$-free graphs. Algorithmica 75(1), 205\u2013217 (2016)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"27_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0012-365X(01)00226-6","volume":"249","author":"G Chen","year":"2002","unstructured":"Chen, G., Yu, X.: A note on fragile graphs. Discret. Math. 249(1\u20133), 41\u201343 (2002). https:\/\/doi.org\/10.1016\/S0012-365X(01)00226-6","journal-title":"Discret. Math."},{"issue":"1","key":"27_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. J. Graph Theory 8(1), 51\u201353 (1984)","journal-title":"J. Graph Theory"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1993.1049","volume":"59","author":"DG Corneil","year":"1993","unstructured":"Corneil, D.G., Fonlupt, J.: Stable set bonding in perfect graphs and parity graphs. J. Combinatorial Theory, Series B 59(1), 1\u201314 (1993)","journal-title":"J. Combinatorial Theory, Series B"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"27_CR10","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 193\u2013242. Elsevier and MIT Press (1990). https:\/\/doi.org\/10.1016\/b978-0-444-88074-1.50010-x","DOI":"10.1016\/b978-0-444-88074-1.50010-x"},{"issue":"1\u20133","key":"27_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(90)90353-J","volume":"86","author":"MB Cozzens","year":"1990","unstructured":"Cozzens, M.B., Kelleher, L.L.: Dominating cliques in graphs. Discret. Math. 86(1\u20133), 101\u2013116 (1990). https:\/\/doi.org\/10.1016\/0012-365X(90)90353-J","journal-title":"Discret. Math."},{"key":"27_CR12","volume-title":"Treewidth versus clique number","author":"C Dallard","year":"2022","unstructured":"Dallard, C., Milani\u010d, M., \u0160torgel, K.: Treewidth versus clique number. II, Tree-independence number (2022)"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0012-365X(89)90268-9","volume":"73","author":"M Farber","year":"1989","unstructured":"Farber, M.: On diameters and radii of bridged graphs. Discret. Math. 73(3), 249\u2013260 (1989). https:\/\/doi.org\/10.1016\/0012-365X(89)90268-9","journal-title":"Discret. Math."},{"key":"27_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990)"},{"issue":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27(3), 119\u2013123 (1988)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.jda.2007.04.001","volume":"6","author":"VB Le","year":"2008","unstructured":"Le, V.B., Mosca, R., M\u00fcller, H.: On stable cutsets in claw-free graphs and planar graphs. J. Discrete Algorithms 6(2), 256\u2013276 (2008). https:\/\/doi.org\/10.1016\/j.jda.2007.04.001","journal-title":"J. Discrete Algorithms"},{"key":"27_CR17","doi-asserted-by":"publisher","unstructured":"Le, V.B., Pfender, F.: Extremal graphs having no stable cutset. Electron. J. Combinatorics 20(1), 35 (2013). https:\/\/doi.org\/10.37236\/2513","DOI":"10.37236\/2513"},{"issue":"1\u20133","key":"27_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0304-3975(03)00048-3","volume":"301","author":"VB Le","year":"2003","unstructured":"Le, V.B., Randerath, B.: On stable cutsets in line graphs. Theoret. Comput. Sci. 301(1\u20133), 463\u2013475 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(03)00048-3","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR19","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. ACM Trans. Algorithms 11(2), 15:1\u201315:31 (2014). https:\/\/doi.org\/10.1145\/2566616","DOI":"10.1145\/2566616"},{"issue":"4","key":"27_CR20","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747\u2013768 (2010). https:\/\/doi.org\/10.1007\/s00453-008-9233-8","journal-title":"Algorithmica"},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"Marx, D., O\u2019Sullivan, B., Razgon, I.: Finding small separators in linear time via treewidth reduction. ACM Trans. Algorithms 9(4), 30:1\u201330:35 (2013). https:\/\/doi.org\/10.1145\/2500119","DOI":"10.1145\/2500119"},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Oum, S.I., Seymour, P.: Approximating clique-width and branch-width. Journal of Comb. Theory Ser. B 96(4), 514\u2013528 (2006)","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"27_CR24","unstructured":"Penrice, S.G.: Clique-like dominating sets (1995)"},{"key":"27_CR25","first-page":"2","volume":"1","author":"E Prisner","year":"1995","unstructured":"Prisner, E.: Graphs with few cliques. Graph Theory, Combinatorics, and Algorithms 1, 2 (1995)","journal-title":"Graph Theory, Combinatorics, and Algorithms"},{"key":"27_CR26","unstructured":"Queyranne, M.: A combinatorial algorithm for minimizing symmetric submodular functions. In: Clarkson, K.L. (ed.) Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22\u201324 January 1995. San Francisco, California, USA, pp. 98\u2013101. ACM\/SIAM (1995)"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Rauch, J., Rautenbach, D., Souza, U.S.: Exact and parameterized algorithms for the independent cutset problem (2023)","DOI":"10.1007\/978-3-031-43587-4_27"},{"issue":"4","key":"27_CR28","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"BA Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299\u2013301 (2004). https:\/\/doi.org\/10.1016\/j.orl.2003.10.009","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"27_CR29","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0095-8956(83)90039-4","volume":"34","author":"A Tucker","year":"1983","unstructured":"Tucker, A.: Coloring graphs with stable cutsets. J. Comb. Theory Ser. B 34(3), 258\u2013267 (1983)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43587-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T21:37:29Z","timestamp":1699911449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43587-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031435867","9783031435874"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43587-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"21 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=71937&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}