Computational Geometry: Theory and Applications
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Exact and approximation algorithms for computing optimal fat decompositions
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting and computing depth orders for fat objects
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms for spreading points
Journal of Algorithms
Computational Geometry: Theory and Applications
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
A note about weak ε-nets for axis-parallel boxes in d-space
Information Processing Letters
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
| Hi-index | 0.00 |