{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:24:24Z","timestamp":1774279464921,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031304477","type":"print"},{"value":"9783031304484","type":"electronic"}],"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-30448-4_21","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"293-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partitioning Subclasses of\u00a0Chordal Graphs with\u00a0Few Deletions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7046-0091","authenticated-orcid":false,"given":"Satyabrata","family":"Jana","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8322-0639","authenticated-orcid":false,"given":"Souvik","family":"Saha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abhishek","family":"Sahu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaily","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"21_CR1","unstructured":"Augeri, C.J., Ali, H.H.: New graph-based algorithms for partitioning VLSI circuits. In: 2004 IEEE International Symposium on Circuits and Systems (IEEE Cat. No. 04CH37512), vol. 4, pp. IV-IV. IEEE (2004)"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1137\/19M1299359","volume":"34","author":"C Chekuri","year":"2020","unstructured":"Chekuri, C., Quanrud, K., Chao, X.: LP relaxation and tree packing for minimum $$ k $$-cut. SIAM J. Discret. Math. 34(2), 1334\u20131353 (2020)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(85)90027-7","volume":"12","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G.: The complexity of generalized clique packing. Discrete Appl. Math. 12(3), 233\u2013239 (1985)","journal-title":"Discrete Appl. Math."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Randomized contractions meet lean decompositions. ACM Trans. Algorithms, 17(1), 6:1\u20136:30 (2021)","DOI":"10.1145\/3426738"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S1571-0661(04)81014-4","volume":"78","author":"RG Downey","year":"2003","unstructured":"Downey, R.G., Estivill-Castro, V., Fellows, M., Prieto, E., Rosamund, F.A.: Cutting up is hard to do: the parameterised complexity of $$ k $$-cut and related problems. Electron. Notes Theor. Comput. Sci. 78, 209\u2013222 (2003)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Hochbaum, D.S.: A polynomial algorithm for the $$ k $$-cut problem for fixed $$ k $$. Math. Oper. Res. 19(1), 24\u201337 (1994)","journal-title":"Math. Oper. Res."},{"key":"21_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, Amsterdam (2004)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A., Lee, E., Li, J.: An FPT algorithm beating 2-approximation for $$ k $$-cut. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2821\u20132837. SIAM (2018)","DOI":"10.1137\/1.9781611975031.179"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., Lee, E., Li, J.: Faster exact and approximate algorithms for $$ k $$-cut. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 113\u2013123. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00020"},{"issue":"4","key":"21_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM (JACM) 43(4), 601\u2013640 (1996)","journal-title":"J. ACM (JACM)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.I., Lin, B.: A nearly 5\/3-approximation FPT algorithm for min-$$ k $$-cut. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 990\u2013999. SIAM (2020)","DOI":"10.1137\/1.9781611975994.59"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K.I., Thorup, M.: The minimum $$ k $$-way cut of bounded size is fixed-parameter tractable. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 160\u2013169. IEEE (2011)","DOI":"10.1109\/FOCS.2011.53"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Li, J.: Faster minimum $$ k $$-cut of a simple graph. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1056\u20131077. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00068"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Saurabh, S., Surianarayanan, V.: A parameterized approximation scheme for min $$ k $$-cut. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 798\u2013809. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00079"},{"key":"21_CR15","unstructured":"Manurangsi, P.: Inapproximability of maximum edge biclique, maximum balanced biclique and minimum $$ k $$-cut from the small set expansion hypothesis. In: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2005.10.007","volume":"351","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized graph separation problems. Theor. Comput. Sci. 351(3), 394\u2013406 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0097539792251730","volume":"24","author":"H Saran","year":"1995","unstructured":"Saran, H., Vazirani, V.V.: Finding $$k$$ cuts within twice the optimal. SIAM J. Comput. 24(1), 101\u2013108 (1995)","journal-title":"SIAM J. Comput."},{"key":"21_CR18","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:04:53Z","timestamp":1684191893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"25","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":"51% - 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":"6","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)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}