Long non-crossing configurations in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Ramsey-type results for geometric graphs. II
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for line and curve segment intersection using restricted predicates
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Dynamic planar convex hull operations in near-logarithmic amortized time
Journal of the ACM (JACM)
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic algorithm for planar
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On the Reflexivity of Point Sets
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Partitioning Colored Point Sets into Monochromatic Parts
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Dynamic Planar Convex Hull with Optimal Query Time
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On embedding an outer-planar graph in a point set
Computational Geometry: Theory and Applications
Tight degree bounds for pseudo-triangulations of points
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Addendum to Etude on theme of Dijkstra
ACM SIGACT News
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
On bounded leg shortest paths problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Covering point sets with two disjoint disks or squares
Computational Geometry: Theory and Applications
Relative Convex Hulls in Semi-dynamic Subdivisions
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Algorithms for optimal outlier removal
Journal of Discrete Algorithms
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
Fitting a two-joint orthogonal chain to a point set
Computational Geometry: Theory and Applications
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
Connectivity guarantees for wireless networks with directional antennas
Computational Geometry: Theory and Applications
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
Minimum convex partitions and maximum empty polytopes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Long Non-Crossing Configurations In The Plane
Fundamenta Informaticae
| Hi-index | 0.00 |