{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:49:49Z","timestamp":1762177789612,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_14","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"161-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Vertex Deletion on Split Graphs: Beyond 4-Hitting Set"],"prefix":"10.1007","author":[{"given":"Pratibha","family":"Choudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Krithika","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vibha","family":"Sahlot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49529-2_1","volume-title":"LATIN 2016: Theoretical Informatics","author":"A Agrawal","year":"2016","unstructured":"Agrawal, A., Kolay, S., Lokshtanov, D., Saurabh, S.: A faster FPT algorithm and a smaller kernel for Block Graph Vertex Deletion. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 1\u201313. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49529-2_1"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H Bandelt","year":"1986","unstructured":"Bandelt, H., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2015.07.001","volume":"600","author":"F Bonomo","year":"2015","unstructured":"Bonomo, F., Dur\u00e1n, G., Valencia-Pabon, M.: Complexity of the cluster deletion problem on subclasses of chordal graphs. Theor. Comput. Sci 600, 59\u201369 (2015)","journal-title":"Theor. Comput. Sci"},{"key":"14_CR4","unstructured":"Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. In: Proceedings of FSTTCS, pp. 22:1\u201322:14 (2017)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.dam.2015.05.021","volume":"216","author":"LS Chandran","year":"2017","unstructured":"Chandran, L.S., Rajendraprasad, D., Tesar, M.: Rainbow colouring of split graphs. Discrete Appl. Math. 216, 98\u2013113 (2017)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ipl.2013.01.001","volume":"113","author":"M Cygan","year":"2013","unstructured":"Cygan, M., Pilipczuk, M.: Split vertex deletion meets vertex cover: new fixed-parameter and exact exponential-time algorithms. Inf. Process. Lett. 113(5), 179\u2013182 (2013)","journal-title":"Inf. Process. Lett."},{"key":"14_CR7","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Berlin (2005)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48350-3_35","volume-title":"Algorithms - ESA 2015","author":"PG Drange","year":"2015","unstructured":"Drange, P.G., Dregi, M.S., Lokshtanov, D., Sullivan, B.D.: On the threshold of intractability. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 411\u2013423. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_35"},{"issue":"7","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.tcs.2009.11.012","volume":"411","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Gaspers, S., Kratsch, D., Liedloff, M., Saurabh, S.: Iterative compression and exact algorithms. Theor. Comput. Sci. 411(7), 1045\u20131053 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. In: Proceedings of STOC, pp. 764\u2013775. ACM (2016)","DOI":"10.1145\/2897518.2897551"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00453-013-9837-5","volume":"71","author":"E Ghosh","year":"2015","unstructured":"Ghosh, E., et al.: Faster parameterized algorithms for deletion to split graphs. Algorithmica 71(4), 989\u20131006 (2015)","journal-title":"Algorithmica"},{"key":"14_CR12","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Elsevier Science B.V., Amsterdam (2004)","edition":"2"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1137\/080741197","volume":"25","author":"P Heggernes","year":"2011","unstructured":"Heggernes, P., Lokshtanov, D., Mihai, R., Papadopoulos, C.: Cutwidth of split graphs and threshold graphs. SIAM J. Discrete Math. 25(3), 1418\u20131437 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"14_CR14","volume-title":"Approximation Algorithms for NP-hard Problems","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston (1997)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-29221-2_27","volume-title":"Algorithms and Discrete Applied Mathematics","author":"M Illuri","year":"2016","unstructured":"Illuri, M., Renjith, P., Sadagopan, N.: Complexity of steiner tree in split graphs - dichotomy results. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 308\u2013325. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_27"},{"issue":"1","key":"14_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00453-017-0316-2","volume":"79","author":"EJ Kim","year":"2017","unstructured":"Kim, E.J., Kwon, O.: A polynomial kernel for block graph deletion. Algorithmica 79(1), 251\u2013270 (2017)","journal-title":"Algorithmica"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Le, T., Lokshtanov, D., Saurabh, S., Thomass\u00e9, S., Zehavi, M.: Subquadratic kernels for implicit 3-hitting set and 3-set packing problems. In: Proceedings of SODA, pp. 331\u2013342 (2018)","DOI":"10.1137\/1.9781611975031.23"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR19","unstructured":"Moser, H.: Finding optimal solutions for covering and matching problems. Ph.D. thesis, Institut f\u00fcr Informatik, Friedrich-Schiller Universit\u00fct Jena (2009)"},{"key":"14_CR20","unstructured":"Saurabh, S.: Personal Communication (2018)"}],"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-030-17402-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:55:59Z","timestamp":1710334559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","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":"32% - 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":"14","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)"}}]}}