Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs

Download PDF
Open Webpage

Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Published: 2019, Last Modified: 13 Jul 2025Discret. Comput. Geom. 2019EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We give algorithms with running time \(2^{\mathcal {O}({\sqrt{k}\log {k}})} \cdot n^{\mathcal {O}(1)}\) for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains