We consider the parameterized problem, whether for a given set D of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. We expose an algorithm running in time n O(
|
291
|
A separator theorem for planar graphs
– Lipton, Tarjan
- 1979
|
|
232
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
123
|
Applications of a planar separator theorem
– Lipton, Tarjan
- 1980
|
|
116
|
Approximation schemes for covering and packing problems in image processing and VLSI
– Hochbaum, Maass
- 1985
|
|
85
|
A unified geometric approach to graph separators
– MILLER, TENG, et al.
- 1991
|
|
72
|
Kontaktprobleme der konformen Abbildung, Berichte uber die Verhandlungen d
– Koebe
- 1936
|
|
72
|
Algorithms for maximum independent sets
– Robson
|
|
71
|
Parameterized complexity: Exponential speed-up for planar graph problems
– Alber, Fernau, et al.
- 2001
|
|
64
|
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
– Hunt, Marathe, et al.
- 1998
|
|
61
|
Parameterized Complexity: A Framework for Systematically Confronting
– Downey, Fellows, et al.
- 1999
|
|
53
|
Label placement by maximum independent set in rectangles
– Agarwal, Kreveld, et al.
- 1997
|
|
48
|
Polynomial-time approximation schemes for geometric graphs
– Erlebach, Jansen, et al.
|
|
43
|
Separators for sphere-packings and nearest neighbor graphs
– Miller, Teng, et al.
- 1997
|
|
39
|
Which problems have strongly exponential complexity
– Impagliazzo, Paturi, et al.
- 2001
|
|
31
|
Graph separators: a parameterized view
– Alber, Fernau, et al.
- 2003
|
|
29
|
On the existence of subexponential parameterized algorithms
– Cai, Juedes
|
|
21
|
A deterministic linear time algorithm for geometric separators and its applications
– Eppstein, Miller, et al.
- 1993
|
|
19
|
Fixed Parameter Tractability and Completeness II: Completeness for W [1]," Theoretical Computer Science A 141
– Downey, Fellows
- 1995
|
|
18
|
Unit disk graphs. Discrete Mathematics
– Clark, Colbourn, et al.
- 1990
|
|
14
|
On the problem of partitioning planar graphs
– Djidjev
- 1982
|
|
12
|
Reduced constants for simple cycle graph separation
– Djidjev, Venkatesan
|
|
10
|
Graph-Theoretical Models for Frequency Assignment Problems
– Malesinska
- 1997
|
|
2
|
Pushing disks together --- The continuous-motion case
– Bern, Sahai
- 1998
|
|
2
|
A separator theorem for graphs of genus
– Djidjev
- 1985
|
|
