{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:44:37Z","timestamp":1743086677923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_9","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"118-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Subgraph Complementation to H-free Graphs"],"prefix":"10.1007","author":[{"given":"Dhanyamol","family":"Antony","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jay","family":"Garchar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagartanu","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. B.","family":"Sandeep","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagnik","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Subashini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Aravind, N.R., Sandeep, R.B., Sivadasan, N.: Dichotomy results on the hardness of H-free edge modification problems. SIAM J. Discre. Math. 31(1), 542\u2013561 (2017)","DOI":"10.1137\/16M1055797"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Cai, L., Cai, Y.: Incompressibility of $$H$$-free edge modification problems. Algorithmica 71(3), 731\u2013757 (2014). https:\/\/doi.org\/10.1007\/s00453-014-9937-x","DOI":"10.1007\/s00453-014-9937-x"},{"key":"9_CR3","unstructured":"Cai, Y.: Polynomial kernelisation of H-free edge modification problems. M .Phil. thesis, Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China (2012)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Y., Chen, J.: Cluster editing: Kernelization based on edge cuts. Algorithmica 64(1), 152\u2013169 (2012)","DOI":"10.1007\/s00453-011-9595-1"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-59267-7_4","volume-title":"Theory and Applications of Models of Computation","author":"Y Cao","year":"2020","unstructured":"Cao, Y., Ke, Y., Yuan, H.: Polynomial Kernels for paw-free edge modification problems. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS, vol. 12337, pp. 37\u201349. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59267-7_4"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Eiben, E., Lochet, W., Saurabh, S.: A polynomial kernel for paw-free editing. In: Cao, Y., Pilipczuk, M. (eds.) 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), December 14\u201318, 2020, Hong Kong, China (Virtual Conference). LIPIcs, vol. 180, pp. 10:1\u201310:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2020.10","DOI":"10.4230\/LIPIcs.IPEC.2020.10"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Str\u00f8mme, T.J.F., Thilikos, D.M.: Subgraph complementation. Algorithmica 82(7), 1859\u20131880 (2020)","DOI":"10.1007\/s00453-020-00677-8"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Guillemot, S., Havet, F., Paul, C., Perez, A.: On the (non-)existence of polynomial kernels for $$P_\\ell $$-free edge modification problems. Algorithmica 65(4), 900\u2013926 (2013)","DOI":"10.1007\/s00453-012-9619-5"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8\u201310), 718\u2013726 (2009)","DOI":"10.1016\/j.tcs.2008.10.021"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Gy\u00e1rf\u00e1s, A.: Generalized split graphs and ramsey numbers. J. Comb. Theory, Ser. A 81(2), 255\u2013261 (1998). https:\/\/doi.org\/10.1006\/jcta.1997.2833","DOI":"10.1006\/jcta.1997.2833"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J.: On switching to $$h$$-free graphs. J. Graph. Theory 75(4), 387\u2013405 (2014)","DOI":"10.1002\/jgt.21745"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Lozin, V.V., Milanic, M.: Recent developments on graphs of bounded clique-width. Discret. Appl. Math. 157(12), 2747\u20132761 (2009)","DOI":"10.1016\/j.dam.2008.08.022"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Kolay, S., Panolan, F.: Parameterized algorithms for deletion to $$(r, \\ell )$$-graphs. In: Harsha, P., Ramalingam, G. (eds.) 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2015). LIPIcs, vol. 45, pp. 420\u2013433. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2015.420","DOI":"10.4230\/LIPIcs.FSTTCS.2015.420"},{"key":"9_CR15","unstructured":"Kolay, S., Panolan, F.: Parameterized algorithms for deletion to (r, l)-graphs. arXiv preprint arXiv:1504.08120 (2015)"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Marx, D., Sandeep, R.B.: Incompressibility of H-free edge modification problems: towards a dichotomy. In: 28th Annual European Symposium on Algorithms (ESA 2020), LIPIcs, vol. 173, pp. 72:1\u201372:25. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.72","DOI":"10.4230\/LIPIcs.ESA.2020.72"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10(2), 297\u2013309 (1981)","DOI":"10.1137\/0210021"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86838-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:01:57Z","timestamp":1702065717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","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 and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","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":"41% - 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":"11","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":"The conference was held online due to the COVID-19 pandemic.","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)"}}]}}