{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:04Z","timestamp":1750695004669,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718192","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T23:34:42Z","timestamp":1750030482000},"page":"1975-1984","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Subexponential Parameterized Algorithms for Hitting Subgraphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3166-9212","authenticated-orcid":false,"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-8687","authenticated-orcid":false,"given":"Fahad","family":"Panolan","sequence":"additional","affiliation":[{"name":"University of Leeds, Leeds, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7847-6402","authenticated-orcid":false,"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[{"name":"IMSc, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7015-1988","authenticated-orcid":false,"given":"Jie","family":"Xue","sequence":"additional","affiliation":[{"name":"New York University Shanghai, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3636-5322","authenticated-orcid":false,"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beersheba, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Kick the Cliques. In 19th International Symposium on Parameterized and Exact Computation (IPEC","author":"Berthe Ga\u00e9tan","year":"2024","unstructured":"Ga\u00e9tan Berthe, Marin Bougeret, Daniel Gon\u00e7alves, and Jean-Florent Raymond. 2024. Kick the Cliques. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). 13\u20131."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.08.013"},{"key":"e_1_3_2_1_3_1","volume-title":"51st International Colloquium on Automata, Languages and Programming.","author":"Bougeret Marin","year":"2024","unstructured":"Marin Bougeret, Bart MP Jansen, and Ignasi Sau. 2024. Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations. In 51st International Colloquium on Automata, Languages and Programming."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0468-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.02.024"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00050-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.04.009"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077468"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101823"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0127-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499483"},{"key":"e_1_3_2_1_13_1","unstructured":"Zden\u011bk Dvo\u0159\u00e1k Daniel Lokshtanov Fahad Panolan Saket Saurabh Jie Xue and Meirav Zehavi. 2023. Efficient Approximation for Subgraph-Hitting Problems in Sparse Graphs and Geometric Intersection Graphs. arXiv preprint arXiv:2304.13695."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1017569"},{"key":"e_1_3_2_1_15_1","volume-title":"On the Lossy Kernelization for Connected Treedepth Deletion Set. In International Workshop on Graph-Theoretic Concepts in Computer Science. 201\u2013214","author":"Eiben Eduard","year":"2022","unstructured":"Eduard Eiben, Diptapriyo Majumdar, and MS Ramanujan. 2022. On the Lossy Kernelization for Connected Treedepth Deletion Set. In International Workshop on Graph-Theoretic Concepts in Computer Science. 201\u2013214."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-017-0315-3"},{"key":"e_1_3_2_1_17_1","volume-title":"46th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Fomin Fedor V","year":"2019","unstructured":"Fedor V Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. 2019. Decomposition of Map Graphs with Applications. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-018-00054-x"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154833"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.09.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00758-8"},{"volume-title":"Parameterized Complexity of Modifying Graphs to be Biclique-free. Ph. D. Dissertation","author":"Goldmann Lito Julius","key":"e_1_3_2_1_22_1","unstructured":"Lito Julius Goldmann. 2021. Parameterized Complexity of Modifying Graphs to be Biclique-free. Ph. D. Dissertation. Institute of Software."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2009.11.032"},{"key":"e_1_3_2_1_24_1","first-page":"895","article-title":"A survey of component order connectivity models of graph theoretic networks","volume":"12","author":"Gross Daniel","year":"2013","unstructured":"Daniel Gross, Monika Heinig, Lakshmi Iswara, L William Kazmierczak, Kristi Luttrell, John T Saccoman, and Charles Suffel. 2013. A survey of component order connectivity models of graph theoretic networks. WSEAS Transactions on Mathematics, 12 (2013), 895\u2013910.","journal-title":"WSEAS Transactions on Mathematics"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.104"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1079336"},{"key":"e_1_3_2_1_27_1","volume-title":"11th International Symposium on Parameterized and Exact Computation (IPEC","author":"Kumar Mithilesh","year":"2017","unstructured":"Mithilesh Kumar and Daniel Lokshtanov. 2017. A 2lk Kernel for l-Component Order Connectivity. In 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.130"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.101"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90060-4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.80"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch84"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/256292.256294"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.07.013"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.07.014"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22993-0_47"},{"volume-title":"The design of approximation algorithms","author":"Williamson David P","key":"e_1_3_2_1_37_1","unstructured":"David P Williamson and David B Shmoys. 2011. The design of approximation algorithms. Cambridge university press."}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:42:59Z","timestamp":1750693379000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":37,"alternative-id":["10.1145\/3717823.3718192","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718192","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}