{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:33:04Z","timestamp":1743067984553,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"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-75242-2_11","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"158-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["FPT and Kernelization Algorithms for the Induced Tree Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5164-1460","authenticated-orcid":false,"given":"Guilherme Castro Mendes","family":"Gomes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4608-4559","authenticated-orcid":false,"given":"Vinicius F.","family":"dos Santos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3392-714X","authenticated-orcid":false,"given":"Murilo V. G.","family":"da Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7538-7305","authenticated-orcid":false,"given":"Jayme L.","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"key":"11_CR1","unstructured":"Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90(1), 85\u201392 (1991). https:\/\/doi.org\/10.1016\/0012-365X(91)90098-M. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X9190098M"},{"key":"11_CR2","unstructured":"Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Math. 90, 85\u201392 (1991). Discrete Math. 102(1), 109 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90357-L. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0012365X9290357L"},{"key":"11_CR3","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86\u2013111 (2015). 40th International Colloquium on Automata, Languages and Programming (ICALP 2013). https:\/\/doi.org\/10.1016\/j.ic.2014.12.008. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540114001606"},{"key":"11_CR4","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009). https:\/\/doi.org\/10.1016\/j.jcss.2009.04.001. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000009000282"},{"key":"11_CR5","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), Volume 9 of LIPIcs, pp. 165\u2013176 (2011)"},{"key":"11_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, 1st edn. Springer, Heidelberg (2008)","edition":"1"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2015","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357\u2013376 (2015). https:\/\/doi.org\/10.1007\/s00224-015-9631-7","journal-title":"Theory Comput. Syst."},{"key":"11_CR8","unstructured":"Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math. 127(3), 415\u2013429 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00242-1. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X02002421"},{"key":"11_CR9","unstructured":"Chang, H.-C., Lu, H.-I.: A faster algorithm to recognize even-hole-free graphs. J. Comb. Theory Ser. B 113, 141\u2013161 (2015). https:\/\/doi.org\/10.1016\/j.jctb.2015.02.001. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895615000155"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Kapadia, R.: Detecting a theta or a prism. SIAM J. Discrete Math. 22(3), 1164\u20131186 (2008). arXiv:https:\/\/doi.org\/10.1137\/060672613. https:\/\/doi.org\/10.1137\/060672613","DOI":"10.1137\/060672613"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164(1), 51\u2013229 (2006). http:\/\/www.jstor.org\/stable\/20159988","journal-title":"Ann. Math."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Scott, A., Seymour, P., Spirkl, S.: Detecting an odd hole. J. ACM 67(1) (2020). https:\/\/doi.org\/10.1145\/3375720","DOI":"10.1145\/3375720"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00493-010-2334-4","volume":"30","author":"M Chudnovsky","year":"2010","unstructured":"Chudnovsky, M., Seymour, P.: The three-in-a-tree problem. Combinatorica 30(4), 387\u2013417 (2010). https:\/\/doi.org\/10.1007\/s00493-010-2334-4","journal-title":"Combinatorica"},{"key":"11_CR14","unstructured":"Chudnovsky, M., Seymour, P., Trotignon, N.: Detecting an induced net subdivision. J. Comb. Theory Ser. B 103(5), 630\u2013641 (2013). https:\/\/doi.org\/10.1016\/j.jctb.2013.07.005. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895613000531"},{"key":"11_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications. Cambridge University Press, Cambridge (2012). https:\/\/doi.org\/10.1017\/CBO9780511977619"},{"key":"11_CR16","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1), 77\u2013114 (2000). https:\/\/doi.org\/10.1016\/S0166-218X(99)00184-5. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X99001845"},{"key":"11_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 3. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"11_CR18","unstructured":"Derhy, N., Picouleau, C.: Finding induced trees. Discrete Appl. Math. 157(17), 3552\u20133557 (2009). Sixth International Conference on Graphs and Optimization (2007). https:\/\/doi.org\/10.1016\/j.dam.2009.02.009. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X09000663"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00373-009-0867-3","volume":"25","author":"N Derhy","year":"2009","unstructured":"Derhy, N., Picouleau, C., Trotignon, N.: The four-in-a-tree problem in triangle-free graphs. Graphs Comb. 25(4), 489 (2009). https:\/\/doi.org\/10.1007\/s00373-009-0867-3","journal-title":"Graphs Comb."},{"key":"11_CR20","first-page":"1","volume":"44","author":"VF dos Santos","year":"2015","unstructured":"dos Santos, V.F., da Silva, M.V.G., Szwarcfiter, J.L.: The k-in-a-tree problem for chordal graphs. Matem\u00e1tica Contempor\u00e2nea 44, 1\u201310 (2015)","journal-title":"Matem\u00e1tica Contempor\u00e2nea"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_32"},{"key":"11_CR22","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971). http:\/\/dx.doi.org\/10.1002\/net.3230010302. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/net.3230010302"},{"key":"11_CR23","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965). https:\/\/doi.org\/10.4153\/CJM-1965-045-4","journal-title":"Can. J. Math."},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s00453-010-9468-z","volume":"62","author":"J Fiala","year":"2012","unstructured":"Fiala, J., Kami\u0144ski, M., Lidick\u00fd, B., Paulusma, D.: The k-in-a-path problem for claw-free graphs. Algorithmica 62(1), 499\u2013519 (2012). https:\/\/doi.org\/10.1007\/s00453-010-9468-z","journal-title":"Algorithmica"},{"key":"11_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/9781107415157","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781107415157"},{"key":"11_CR26","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011). Celebrating Karp\u2019s Kyoto Prize. https:\/\/doi.org\/10.1016\/j.jcss.2010.06.007. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000010000917"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-30786-8_15","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R Ganian","year":"2019","unstructured":"Ganian, R., Ordyniak, S.: The power of cut-based parameters for computing edge disjoint paths. In: Sau, I., Thilikos, D.M. (eds.) WG 2019. LNCS, vol. 11789, pp. 190\u2013204. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30786-8_15"},{"key":"11_CR28","unstructured":"Gomes, G.C.M., Guedes, M.R., dos Santos, V.F.: Structural parameterizations for equitable coloring (2019). arXiv:1911.03297"},{"issue":"4","key":"11_CR29","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00453-019-00617-1","volume":"82","author":"N Gr\u00fcttemeier","year":"2019","unstructured":"Gr\u00fcttemeier, N., Komusiewicz, C.: On the relation of strong triadic closure and cluster deletion. Algorithmica 82(4), 853\u2013880 (2019). https:\/\/doi.org\/10.1007\/s00453-019-00617-1","journal-title":"Algorithmica"},{"key":"11_CR30","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). https:\/\/doi.org\/10.1006\/jcss.2000.1727. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000000917276"},{"key":"11_CR31","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"11_CR32","unstructured":"Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424\u2013435 (2012). https:\/\/doi.org\/10.1016\/j.jctb.2011.07.004. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895611000712"},{"key":"11_CR33","unstructured":"Komusiewicz, C., Kratsch, D., Le, V.B.: Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms. 283, 44\u201358 (2020). https:\/\/doi.org\/10.1016\/j.dam.2019.12.010. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X19305530"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Lai, K.-Y., Lu, H.-I., Thorup, M.: Three-in-a-tree in near linear time. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, pp. 1279\u20131292. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3357713.3384235","DOI":"10.1145\/3357713.3384235"},{"key":"11_CR35","unstructured":"Liu, W., Trotignon, N.: The k-in-a-tree problem for graphs of girth at least k. Discrete Appl. Math. 158(15), 1644\u20131649 (2010). https:\/\/doi.org\/10.1016\/j.dam.2010.06.005. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X10002131"},{"key":"11_CR36","unstructured":"Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discrete Appl. Math. 157(4), 715\u2013727 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.07.011. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X08003211"},{"key":"11_CR37","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986). https:\/\/doi.org\/10.1016\/0196-6774(86)90023-4. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0196677486900234"},{"key":"11_CR38","unstructured":"Sorge, M., Weller, M.: The graph parameter hierarchy (2019, Unpublished manuscript)"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Trotignon, N., Vu\u0161kovi\u0107, K.: A structure theorem for graphs with no cycle with a unique chord and its consequences. J. Graph Theory 63(1), 31\u201367 (2010). https:\/\/doi.org\/10.1002\/jgt.20405. https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/jgt.20405. arXiv:https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.20405","DOI":"10.1002\/jgt.20405"},{"key":"11_CR40","unstructured":"Yap, C.K.: Some consequences of non-uniform conditions on uniform classes. Theor. Comput. Sci. 26(3), 287\u2013300 (1983). https:\/\/doi.org\/10.1016\/0304-3975(83)90020-8. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397583900208"},{"key":"11_CR41","unstructured":"Bonnet, \u00c9., Sikora, F.: The graph motif problem parameterized by the structure of the input graph. Discrete Appl. Math. 231, 78\u201394 (2017). Algorithmic Graph Theory on the Adriatic Coast. https:\/\/doi.org\/10.1016\/j.dam.2016.11.016. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X1630539X"}],"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-75242-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T09:47:22Z","timestamp":1672048042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_11","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":"4 May 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","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":"78","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":"27","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":"35% - 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":"10","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":"Due to the Corona pandemic the conference was held virtually.","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)"}}]}}