Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams
IEEE Transactions on Knowledge and Data Engineering
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Discrete Applied Mathematics
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Coloring and maximum independent set of rectangles
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Towards faster linear-sized nets for axis-aligned boxes in the plane
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
An improved algorithm for online unit clustering
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve
Computational Geometry: Theory and Applications
| Hi-index | 5.23 |