{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:45:49Z","timestamp":1761129949428,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"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_12","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"156-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Crespelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Gras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Perez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1137\/16M1055797","volume":"31","author":"N Aravind","year":"2017","unstructured":"Aravind, N., Sandeep, R., Sivadasan, N.: Dichotomy results on the hardness of H-free edge modification problems. SIAM J. Discrete Math. 31(1), 542\u2013561 (2017)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"HJ Bandelt","year":"1986","unstructured":"Bandelt, H.J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.3390\/a3020197","volume":"3","author":"A Berry","year":"2010","unstructured":"Berry, A., Pogorelcnik, R., Simonet, G.: An introduction to clique minimal separator decomposition. Algorithms 3(2), 197\u2013215 (2010)","journal-title":"Algorithms"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bessy, S., Paul, C., Perez, A.: Polynomial kernels for 3-leaf power graph modification problems. Discrete Appl. Math. 158(16), 1732\u20131744 (2010). https:\/\/doi.org\/10.1016\/j.dam.2010.07.002","DOI":"10.1016\/j.dam.2010.07.002"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ic.2013.08.006","volume":"231","author":"S Bessy","year":"2013","unstructured":"Bessy, S., Perez, A.: Polynomial kernels for proper interval completion and related problems. Inf. Comput. 231, 89\u2013108 (2013)","journal-title":"Inf. Comput."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3381426","volume":"16","author":"I Bliznets","year":"2020","unstructured":"Bliznets, I., Cygan, M., Komosa, P., Pilipczuk, M., Mach, L.: Lower bounds for the parameterized complexity of minimum fill-in and other completion problems. ACM Trans. Algorithm (TALG) 16(2), 1\u201331 (2020)","journal-title":"ACM Trans. Algorithm (TALG)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-78773-0_42","volume-title":"LATIN 2008: Theoretical Informatics","author":"A Brandst\u00e4dt","year":"2008","unstructured":"Brandst\u00e4dt, A., Hundt, C.: Ptolemaic graphs and interval graphs are leaf powers. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 479\u2013491. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78773-0_42"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s11083-008-9097-1","volume":"25","author":"B Bre\u0161ar","year":"2008","unstructured":"Bre\u0161ar, B., Changat, M., Klav\u017ear, S., Kov\u0161e, M., Mathews, J., Mathews, A.: Cover-incomparability graphs of posets. Order 25(4), 335\u2013347 (2008)","journal-title":"Order"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s00453-014-9937-x","volume":"71","author":"L Cai","year":"2015","unstructured":"Cai, L., Cai, Y.: Incompressibility of $$H$$-free edge modification problems. Algorithmica 71(3), 731\u2013757 (2015)","journal-title":"Algorithmica"},{"key":"12_CR12","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification. CoRR abs\/2001.06867 (2020). https:\/\/arxiv.org\/abs\/2001.06867"},{"key":"12_CR13","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":"12","key":"12_CR14","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1007\/s00453-017-0401-6","volume":"80","author":"PG Drange","year":"2018","unstructured":"Drange, P.G., Pilipczuk, M.: A polynomial kernel for trivially perfect editing. Algorithmica 80(12), 3481\u20133524 (2018)","journal-title":"Algorithmica"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1109\/31.1748","volume":"35","author":"ES El-Mallah","year":"1988","unstructured":"El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circ. Syst. 35(3), 354\u2013362 (1988)","journal-title":"IEEE Trans. Circ. Syst."},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R Fagin","year":"1983","unstructured":"Fagin, R.: Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM (JACM) 30(3), 514\u2013550 (1983)","journal-title":"J. ACM (JACM)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, New York (2019)","DOI":"10.1017\/9781107415157"},{"key":"12_CR18","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. WH freeman, New York (2002)"},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/aama.1994.1009","volume":"15","author":"MC Golumbic","year":"1994","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: On the complexity of DNA physical mapping. Adv. Appl. Math. 15(3), 251\u2013261 (1994)","journal-title":"Adv. Appl. Math."},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Guillemot, S., Havet, F., Paul, C., Perez, A.: On the (non-)existence of polynomial kernels for P$$_l$$-free edge modification problems. Algorithmica 65(4), 900\u2013926 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9619-5","DOI":"10.1007\/s00453-012-9619-5"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/978-3-540-77120-3_79","volume-title":"Algorithms and Computation","author":"J Guo","year":"2007","unstructured":"Guo, J.: Problem Kernels for NP-complete edge deletion problems: split and related graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 915\u2013926. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77120-3_79"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","volume":"27","author":"E Howorka","year":"1979","unstructured":"Howorka, E.: On metric properties of certain clique graphs. J. Comb. Theory Ser. B 27(1), 67\u201374 (1979)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/jgt.3190050314","volume":"5","author":"E Howorka","year":"1981","unstructured":"Howorka, E.: A characterization of ptolemaic graphs. J. Graph Theory 5(3), 323\u2013331 (1981)","journal-title":"J. Graph Theory"},{"issue":"5","key":"12_CR24","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1137\/S0097539796303044","volume":"28","author":"H Kaplan","year":"1999","unstructured":"Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5), 1906\u20131922 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"342","DOI":"10.4153\/CJM-1965-034-0","volume":"17","author":"DC Kay","year":"1965","unstructured":"Kay, D.C., Chartrand, G.: A characterization of certain ptolemaic graphs. Can. J. Math. 17, 342\u2013346 (1965)","journal-title":"Can. J. Math."},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.disopt.2013.02.001","volume":"10","author":"S Kratsch","year":"2013","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. Discrete Optim. 10(3), 193\u2013199 (2013)","journal-title":"Discrete Optim."},{"issue":"4","key":"12_CR27","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TST.2014.6867517","volume":"19","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Wang, J., Guo, J.: An overview of kernelization algorithms for graph modification problems. Tsinghua Sci. Tech. 19(4), 346\u2013357 (2014)","journal-title":"Tsinghua Sci. Tech."},{"key":"12_CR28","unstructured":"Mancini, F.: Graph modification problems related to graph classes. Ph.D. degree dissertation, University of Bergen Norway 2 (2008)"},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.dam.2014.03.024","volume":"196","author":"L Markenzon","year":"2015","unstructured":"Markenzon, L., Waga, C.F.E.M.: New results on ptolemaic graphs. Discrete Appl. Math. 196, 135\u2013140 (2015)","journal-title":"Discrete Appl. Math."},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Marx, D., Sandeep, R.B.: Incompressibility of $$H$$-free edge modification problems: Towards a dichotomy. In: Grandoni, F., Herman, G., Sanders, P. (eds.) 28th Annual European Symposium on Algorithms, ESA 2020, September 7\u20139, 2020, Pisa, Italy (Virtual Conference). 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"},{"issue":"1","key":"12_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109\u2013128 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"12_CR32","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0167-6377(88)90072-7","volume":"7","author":"J Nieminen","year":"1988","unstructured":"Nieminen, J.: The center and the distance center of a ptolemaic graph. Oper. Res. Lett. 7(2), 91\u201394 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"12_CR33","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1093\/ietisy\/e91-d.2.170","volume":"91","author":"Y Takahara","year":"2008","unstructured":"Takahara, Y., Teramoto, S., Uehara, R.: Longest path problems on ptolemaic graphs. IEICE Trans. Inf. Syst. 91(2), 170\u2013177 (2008)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"12_CR34","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"RE Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Math. 55, 221\u2013232 (1985)","journal-title":"Discrete Math."},{"issue":"7","key":"12_CR35","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/j.dam.2008.09.006","volume":"157","author":"R Uehara","year":"2009","unstructured":"Uehara, R., Uno, Y.: Laminar structure of ptolemaic graphs with applications. Discrete Appl. Math. 157(7), 1533\u20131543 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR36","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebraic Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:02:14Z","timestamp":1702065734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_12","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)"}}]}}