Subexponential Parameterized algorithms on disk graphs (extended abstract)

DOI10.1137/1.9781611977073.80MaRDI QIDQ6575154zbMATH OpenFDO

Authors Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.80

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(14)

• Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
• Computing tree decompositions with small independence number
• Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
• Recognition and proper coloring of unit segment intersection graphs
• ETH-tight algorithm for cycle packing on unit disk graphs
• Bipartizing (pseudo-)disk graphs: approximation with a ratio better than 3
• True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
• Feedback vertex set for pseudo-disk graphs in subexponential FPT time
• Sparse outerstring graphs have logarithmic treewidth
• Kick the cliques
• Dynamic parameterized problems on unit disk graphs
• The maximum clique problem in a disk graph made easy
• An optimal algorithm for shortest paths in unweighted disk graphs
• Pushing the frontiers of subexponential FPT time for feedback vertex set

This page was built for publication: Subexponential Parameterized algorithms on disk graphs (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575154)