Separator based parallel divide and conquer in computational geometry
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Automatic partitioning of unstructured grids into connected components
Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Compiling nested data-parallel programs for shared-memory multiprocessors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear-size nonobtuse triangulation of polygons
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Disk packings and planar separators
Proceedings of the twelfth annual symposium on Computational geometry
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Moments of inertia and graph separators
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Information and Computation
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry
Testing bipartiteness of geometric intersection graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for center and Tverberg points
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for center and Tverberg points
ACM Transactions on Algorithms (TALG)
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Approximate center points with proofs
Proceedings of the twenty-fifth annual symposium on Computational geometry
Local polyhedra and geometric graphs
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Approximate centerpoints with proofs
Computational Geometry: Theory and Applications
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
Approximating Tverberg points in linear time for any fixed dimension
Proceedings of the twenty-eighth annual symposium on Computational geometry
A Deterministic Linear Time Algorithm For Geometric Separators And Its Applications
Fundamenta Informaticae
| Hi-index | 0.00 |