{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:17Z","timestamp":1771036337477,"version":"3.50.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,4,13]],"date-time":"2024-04-13T00:00:00Z","timestamp":1712966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Swarnajayanti Fellowship","award":["DST\/SJF\/ MSA-01\/2017-18"],"award-info":[{"award-number":["DST\/SJF\/ MSA-01\/2017-18"]}]},{"name":"European Research Council (ERC) under the European Union\u2019s Horizon 2020 research and innovation programme","award":["No. 819416 (LOPRE), No. 101039913 (PARAPATH)"],"award-info":[{"award-number":["No. 819416 (LOPRE), No. 101039913 (PARAPATH)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2024,4,30]]},"abstract":"<jats:p>\n            We give a new decomposition theorem in unit disk graphs (UDGs) and demonstrate its applicability in the fields of Structural Graph Theory and Parameterized Complexity. First, our new decomposition theorem shows that the class of UDGs admits an \u201calmost\u201d Contraction Decomposition Theorem. Prior studies on this topic exhibited that the classes of planar graphs\u00a0[Klein, SICOMP, 2008], graphs of bounded genus\u00a0[Demaine, Hajiaghayi and Mohar, Combinatorica 2010], and\n            <jats:italic>H<\/jats:italic>\n            -minor free graphs\u00a0[Demaine, Hajiaghayi and Kawarabayashi, STOC 2011] admit a Contraction Decomposition Theorem. Even\n            <jats:italic>bounded-degree<\/jats:italic>\n            UDGs can contain arbitrarily large cliques as minors, and therefore our result is a significant advance in the study of contraction decompositions. Additionally, this result answers an open question posed by Hajiaghayi (\n            <jats:monospace>www.youtube.com\/watch?v=2Bq2gy1N01w<\/jats:monospace>\n            ) regarding the existence of contraction decompositions for classes of graphs beyond\n            <jats:italic>H<\/jats:italic>\n            -minor free graphs though under a relaxation of the original formulation.\n          <\/jats:p>\n          <jats:p>\n            Second, we present a \u201cparameteric version\u201d of our new decomposition theorem. We prove that there is an algorithm that, given a UDG\n            <jats:italic>G<\/jats:italic>\n            and a positive integer\n            <jats:italic>k<\/jats:italic>\n            , runs in polynomial time and outputs a collection of\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\mathcal {O}(k)\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            tree decompositions of\n            <jats:italic>G<\/jats:italic>\n            with the following properties. Each bag in any of these tree decompositions can be partitioned into\n            <jats:inline-formula content-type=\"math\/tex\">\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\mathcal {O}(k)\\)<\/jats:tex-math>\n            <\/jats:inline-formula>\n            connected pieces (we call this measure the chunkiness of the tree decomposition). Moreover, for any subset\n            <jats:italic>S<\/jats:italic>\n            of at most\n            <jats:italic>k<\/jats:italic>\n            edges in\n            <jats:italic>G<\/jats:italic>\n            , there is a tree decomposition in the collection such that\n            <jats:italic>S<\/jats:italic>\n            is\n            <jats:italic>well preserved<\/jats:italic>\n            in the decomposition in the following sense. For any bag in the tree decomposition and any edge in\n            <jats:italic>S<\/jats:italic>\n            with both endpoints in the bag, either its endpoints lie in different pieces or they lie in a piece that is a clique. Having this decomposition at hand, we show that the design of parameterized algorithms for some cut problems becomes elementary. In particular, our algorithmic applications include single-exponential (or slightly super-exponential) algorithms for well-studied problems such as\n            <jats:sc>Min Bisection<\/jats:sc>\n            ,\n            <jats:sc>Steiner Cut<\/jats:sc>\n            ,\n            <jats:sc>\n              <jats:italic>s<\/jats:italic>\n              -Way Cut\n            <\/jats:sc>\n            , and\n            <jats:sc>Edge Multiway Cut-Uncut<\/jats:sc>\n            on UDGs; these algorithms are substantially faster than the best-known algorithms for these problems on general graphs.\n          <\/jats:p>","DOI":"10.1145\/3648594","type":"journal-article","created":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T11:53:14Z","timestamp":1707997994000},"page":"1-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity"],"prefix":"10.1145","volume":"20","author":[{"given":"Fahad","family":"Panolan","sequence":"first","affiliation":[{"name":"IIT Hyderabad, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[{"name":"The Institute for Mathematical Sciences, HBNI, Chennai, India and University of Bergen, Bergen, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beersheba, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"e_1_3_4_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-35608-2_3"},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2017.18"},{"key":"e_1_3_4_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/74382.74527"},{"key":"e_1_3_4_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0221016"},{"key":"e_1_3_4_7_2","first-page":"43","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201902)","author":"Bui Thang Nguyen","year":"2002","unstructured":"Thang Nguyen Bui and Lisa C. Strite. 2002. An ant system algorithm for graph bisection. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201902). 43\u201351."},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00294-8"},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032077"},{"key":"e_1_3_4_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"e_1_3_4_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591852"},{"key":"e_1_3_4_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972924.3"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993696"},{"key":"e_1_3_4_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-010-2341-5"},{"key":"e_1_3_4_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.14"},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2003.09.001"},{"key":"e_1_3_4_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.04.010"},{"key":"e_1_3_4_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"e_1_3_4_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-011-1026-1"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.110"},{"key":"e_1_3_4_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010020"},{"key":"e_1_3_4_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701387660"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335370"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45078-8_44"},{"key":"e_1_3_4_26_2","first-page":"65:1\u201365:15","volume-title":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP\u201917)","author":"Fomin Fedor V.","year":"2017","unstructured":"Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. 2017. Finding, hitting and packing cycles in subexponential time on unit disk graphs. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP\u201917). 65:1\u201365:15."},{"key":"e_1_3_4_27_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.124"},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746564"},{"key":"e_1_3_4_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21960"},{"key":"e_1_3_4_30_2","first-page":"852","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Grigni Michelangelo","year":"2002","unstructured":"Michelangelo Grigni and Papa Sissokho. 2002. Light spanners and approximate TSP in weighted graphs with forbidden minors. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms852\u2013857. http:\/\/dl.acm.org\/citation.cfm?id=545381.545492"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00020"},{"key":"e_1_3_4_32_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.179"},{"key":"e_1_3_4_33_2","unstructured":"MohammadTaghi Hajiaghayi. 2016. Contraction and Minor Graph Decomposition and Their Algorithmic Applications. Retrieved from https:\/\/www.youtube.com\/watch?v=2Bq2gy1N01w"},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11899"},{"key":"e_1_3_4_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"e_1_3_4_36_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0903"},{"key":"e_1_3_4_37_2","first-page":"120","volume-title":"Proceedings of the 9th International Symposium on Operations Research and Its Applications (ISORA\u201910)","author":"Ito Hiro","year":"2010","unstructured":"Hiro Ito and Masakazu Kadoshita. 2010. Tractability and intractability of problems on unit disk graphs parameterized by domain area. In Proceedings of the 9th International Symposium on Operations Research and Its Applications (ISORA\u201910). 120\u2013127."},{"key":"e_1_3_4_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_30"},{"key":"e_1_3_4_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1984.1146097"},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.53"},{"key":"e_1_3_4_41_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_4_42_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"key":"e_1_3_4_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132620"},{"key":"e_1_3_4_44_2","doi-asserted-by":"publisher","DOI":"10.1137\/060649562"},{"key":"e_1_3_4_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2500119"},{"key":"e_1_3_4_46_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.17"},{"key":"e_1_3_4_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743449"},{"key":"e_1_3_4_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90174-3"},{"key":"e_1_3_4_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1984.1146082"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3648594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3648594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:20Z","timestamp":1750287020000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3648594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,13]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4,30]]}},"alternative-id":["10.1145\/3648594"],"URL":"https:\/\/doi.org\/10.1145\/3648594","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,13]]},"assertion":[{"value":"2019-12-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}