Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Dynamic computational geometry on parallel computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Visibility problems for polyhedral terrains
Journal of Symbolic Computation
The complexity of many faces in arrangements of lines of segments
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
New methods for computing visibility graphs
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the general motion planning problem with two degrees of freedom
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Coordinated motion planning for two independent robots
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Skewed projections with an application to line stabbing in R3
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Arrangements of lines in 3-space: a data structure with applications
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Triangles in space or building (and analyzing) castles in the Air
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Sweeping arrangements of curves
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Minimum-link paths among obstacles in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Stabbing and ray shooting in 3 dimensional space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On the two-dimensional davenport-schinzel problem
Journal of Symbolic Computation
Hidden surface removal with respect to a moving view point
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Extremal polygon containment problems
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Matching points into noise regions: combinatorial bounds and algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Tail estimates for the space complexity of randomized incremental algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Combinatorial complexity of translating a box in polyhedral 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Almost tight upper bounds for the single cell and zone problems in three dimensions
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An efficient algorithm for hidden surface removal, II
Proceedings of the 30th IEEE symposium on Foundations of computer science
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM SIGACT News
On the shortest paths between two convex polyhedra
Journal of the ACM (JACM)
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
The overlay of lower envelopes in three dimensions and its applications
Proceedings of the eleventh annual symposium on Computational geometry
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
Geometric lower bounds for parametric matroid optimization
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the twelfth annual symposium on Computational geometry
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Visibility with a moving point of view
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On Computing the Upper Envelope of Segments in Parallel
IEEE Transactions on Parallel and Distributed Systems
Partitioning Colored Point Sets into Monochromatic Parts
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
The Conditional Location of a Median Path
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
European Journal of Combinatorics
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the lower envelope of bivariate functions and its applications
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Finding the conditional location of a median path on a tree
Information and Computation
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Precise global collision detection in multi-axis NC-machining
Computer-Aided Design
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
Journal of the ACM (JACM)
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
On nonlinear forbidden 0-1 matrices: a refutation of a Füredi-Hajnal conjecture
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
Journal of Combinatorial Theory Series A
On the structure and composition of forbidden sequences, with geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Origins of Nonlinearity in Davenport-Schinzel Sequences
SIAM Journal on Discrete Mathematics
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A
Range searching on uncertain data
ACM Transactions on Algorithms (TALG)
Sharp bounds on Davenport-Schinzel sequences of every order
Proceedings of the twenty-ninth annual symposium on Computational geometry
On IO-efficient viewshed algorithms and their accuracy
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |