A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Some new bounds for Epsilon-nets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Decomposition of multiple coverings into many parts
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Decomposition of multiple coverings into many parts
Computational Geometry: Theory and Applications
Coloring Axis-Parallel Rectangles
Computational Geometry and Graph Theory
Decomposition of multiple coverings into more parts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Notes: Coloring axis-parallel rectangles
Journal of Combinatorial Theory Series A
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Maximizing network lifetime on the line with adjustable sensing ranges
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Changing of the guards: strip cover with duty cycling
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Brief announcement: set it and forget it - approximating the set once strip cover problem
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
ACM Transactions on Sensor Networks (TOSN)
Octants are cover-decomposable into many coverings
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |