Parameterized geometric graph modification with disk scaling
From MaRDI portal
Cites work
- (Re)packing equal disks into rectangle
- A 4k^2 kernel for feedback vertex set
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
- A subexponential bound for linear programming
- A survey of parameterized algorithms and the complexity of edge modification
- Algorithms – ESA 2005
- Analysis of two-variable recurrence relations with application to parameterized approximations
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation and kernelization for chordal vertex deletion
- Approximation schemes for covering and packing problems in image processing and VLSI
- Bridge-depth characterizes which structural parameterizations of vertex cover admit a polynomial kernel
- Connecting a set of circles with minimum sum of radii
- Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity
- Decomposition of Map Graphs with Applications.
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- Energy-efficient wireless network design
- Establishing strong connectivity using optimal radius half-disk antennas
- ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
- Feedback vertex set inspired kernel for chordal vertex deletion
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- Fundamentals of parameterized complexity
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- Improved deterministic algorithms for linear programming in low dimensions
- Interval vertex deletion admits a polynomial kernel
- Kernelization for spreading points
- Kernelization. Theory of parameterized preprocessing
- Linear recognition of almost interval graphs
- Lower bounds for the parameterized complexity of minimum fill-in and other completion problems
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
- Minimum-energy broadcasting in static ad hoc wireless networks
- Optimality program in segment and string graphs
- Parameterized algorithms
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Polynomial kernels for hard problems on disk graphs
- Power assignment in radio networks with two power levels
- Range assignment of base-stations maximizing coverage area without interference
- Subexponential parameterized algorithm for {\textsc{Interval Completion}}
- Subexponential Parameterized algorithms on disk graphs (extended abstract)
- Subquadratic kernels for implicit 3-{\textsc{Hitting Set}} and 3-{\textsc{Set Packing}} problems
- The complexity of dominating set in geometric intersection graphs
This page was built for publication: Parameterized geometric graph modification with disk scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296690)
