Computational geometry: an introduction
Computational geometry: an introduction
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Kinetic connectivity for unit disks
Proceedings of the sixteenth annual symposium on Computational geometry
Simplified kinetic connectivity for rectangles and hypercubes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Dynamic subgraph connectivity with geometric applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Kinetic sorting and kinetic convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Kinetic sorting and kinetic convex hulls
Computational Geometry: Theory and Applications
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
| Hi-index | 0.01 |