{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:52:22Z","timestamp":1764557542806,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_2","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"14-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Linear-Time Algorithms for Eliminating Claws in Graphs"],"prefix":"10.1007","author":[{"given":"Flavia","family":"Bonomo-Braberman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julliano R.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabiano S.","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U\u00e9verton S.","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"2_CR1","first-page":"17","volume-title":"Beitr\u00e4ge zur Graphentheorie","author":"L Beineke","year":"1968","unstructured":"Beineke, L.: Derived graphs of digraphs. In: Sachs, H., Voss, H.J., Walter, H.J. (eds.) Beitr\u00e4ge zur Graphentheorie, pp. 17\u201333. Teubner, Leipzig (1968)"},{"issue":"1\u20132","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"H Bodlaender","year":"2016","unstructured":"Bodlaender, H., Drange, P., Dregi, M., Fomin, F., Lokshtanov, D., Pilipczuk, M.: A $$O(c^kn)$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2018.05.039","volume":"745","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. Theoret. Comput. Sci. 745, 75\u201386 (2018)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. In: Webb, B. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 327, pp. 153\u2013171. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511734885.008"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J., 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":"2_CR7","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)"},{"key":"2_CR8","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity, pp. 262\u2013273 (1997)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J., Wojtaszczyk, J.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, pp. 150\u2013159 (2011)","DOI":"10.1109\/FOCS.2011.23"},{"issue":"50","key":"2_CR10","doi-asserted-by":"publisher","first-page":"6982","DOI":"10.1016\/j.tcs.2011.09.010","volume":"412","author":"M Cygan","year":"2011","unstructured":"Cygan, M., Philip, G., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.: Dominating set is fixed parameter tractable in claw-free graphs. Theoret. Comput. Sci. 412(50), 6982\u20137000 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Faenza, Y., Oriolo, G., Stauffer, G.: Solving the weighted stable set problem in claw-free graphs via decomposition. J. ACM 61(4), 20:1\u201320:41 (2014)","DOI":"10.1145\/2629600"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"R Faudree","year":"1997","unstructured":"Faudree, R., Flandrin, E., Ryj\u00e1\u010dek, Z.: Claw-free graphs - a survey. Discrete Math. 164(1), 87\u2013147 (1997)","journal-title":"Discrete Math."},{"issue":"16\u201318","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1016\/j.tcs.2010.01.001","volume":"411","author":"H Fernau","year":"2010","unstructured":"Fernau, H.: Parameterized algorithms for $$d$$-hitting set: the weighted case. Theoret. Comput. Sci. 411(16\u201318), 1698\u20131713 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR14","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts Theoretical Computer Science, EATCS Series (2006)"},{"key":"2_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, San Francisco (1979)"},{"key":"2_CR16","unstructured":"Hedetniemi, S., Laskar, R.: Recent results and open problems in domination theory. In: Applications of Discrete Mathematics, pp. 205\u2013218. SIAM Philadelphia (1988)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D Hochbaum","year":"1982","unstructured":"Hochbaum, D.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11, 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Flandrin, E., Fouquet, J.L., Li, H.: On Hamiltonian claw-free graphs. Discrete Mathemat. 111(1\u20133), 221\u2013229 (1993)","DOI":"10.1016\/0012-365X(93)90157-O"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2629614","volume":"62","author":"S Khot","year":"2015","unstructured":"Khot, S., Vishnoi, N.: The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into $$\\ell _1$$. J. ACM 62(1), 8 (2015)","journal-title":"J. ACM"},{"key":"2_CR21","doi-asserted-by":"publisher","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375","DOI":"10.1007\/BFb0045375"},{"issue":"3\u20134","key":"2_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3\u20134), 115\u2013121 (2000)","journal-title":"Inf. Process. Lett."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2014.01.019","volume":"526","author":"M Kumar","year":"2014","unstructured":"Kumar, M., Mishra, S., Devi, N., Saurabh, S.: Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. Theoret. Comput. Sci. 526, 90\u201396 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303 (2014)","DOI":"10.1145\/2608628.2608664"},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J Lewis","year":"1980","unstructured":"Lewis, J., 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":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-56939-1_60","volume-title":"Automata, Languages and Programming","author":"C Lund","year":"1993","unstructured":"Lund, C., Yannakakis, M.: The approximation of maximum subgraph problems. In: Lingas, A., Karlsson, R., Carlsson, S. (eds.) ICALP 1993. LNCS, vol. 700, pp. 40\u201351. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56939-1_60"},{"key":"2_CR27","unstructured":"Roberts, F.: Indifference graphs. In: Harary, F. (ed.) Proof Techniques in Graph Theory, pp. 139\u2013146. Academic Press (1969)"},{"key":"2_CR28","unstructured":"Robertson, N., Seymour, P.: Graph minors. III. Planar tree-width. J. Comb. Theory. Ser. B 36(1), 49\u201364 (1984)"},{"issue":"1","key":"2_CR29","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","volume":"42","author":"D Sumner","year":"1974","unstructured":"Sumner, D.: Graphs with 1-factors. Proc. Am. Math. Soc. 42(1), 8\u201312 (1974)","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"2_CR31","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1997.2697","volume":"142","author":"M Thorup","year":"1998","unstructured":"Thorup, M.: All structured programs have small tree width and good register allocation. Inf. Comput. 142(2), 159\u2013181 (1998)","journal-title":"Inf. Comput."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Williams, V.V., Wang, J.R., Williams, R., Yu, H.: Finding four-node subgraphs in triangle time. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1671\u20131680. SIAM (2015)","DOI":"10.1137\/1.9781611973730.111"},{"issue":"2","key":"2_CR33","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node deletion problems on bipartite graphs. SIAM J. Comput. 10(2), 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,10]],"date-time":"2022-11-10T04:45:15Z","timestamp":1668055515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"2.7","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":"10.2","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":"No","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 virtually 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)"}}]}}