Faster algorithms for cycle hitting problems on disk graphs
From MaRDI portal
(Redirected from Publication:6138985)
Cites work
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- A kernelization algorithm for \(d\)-hitting set
- Clique-based separators for geometric intersection graphs
- Decomposition of Map Graphs with Applications.
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
- Faster parameterized algorithms using linear programming
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- Order-k Voronoi diagrams of sites with additive weights in the plane
- Parameterized algorithms
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Subexponential parameterized odd cycle transversal on planar graphs
- Unit disk graph recognition is NP-hard
Cited in
(8)- Subexponential algorithms in geometric graphs via the subquadratic grid minor property: the role of local radius
- 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
- Single-source shortest path problem in weighted disk graphs
- 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: Faster algorithms for cycle hitting problems on disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138985)
