Mathematical Reviews
- Triangulating polygons without large angles, Mathematical Reviews 96e:68124
- Asymptotic speed-ups in constructive solid geometry, Mathematical Reviews 96b:68177
- Dihedral bounds for mesh generation in high dimensions, Mathematical Reviews 95m:52031
- Subgraph isomorphism in planar graphs and related problems, Mathematical Reviews 95m:05178
- Arboricity and bipartite subgraph listing algorithms, Mathematical Reviews 95j:05157
- Dynamic Euclidean minimum spanning trees and extrema of binary functions, Mathematical Reviews 95g:68122
- Tree-weighted neighbors and geometric $k$ smallest spanning trees, Mathematical Reviews 95f:05028
- Approximating the minimum weight Steiner triangulation, Mathematical Reviews 95e:68218
- Offline algorithms for dynamic minimum spanning tree problems, Mathematical Reviews 95e:68168
- Provably good mesh generation, Mathematical Reviews 95c:65235
- On the number of minimal 1-Steiner trees, Mathematical Reviews 95c:05043
- Average case analysis of dynamic geometric optimization, Mathematical Reviews 95b:90143
- Clustering for faster network simplex pivots, Mathematical Reviews 95b:90142
- Iterated nearest neighbors and finding minimal polytopes, Mathematical Reviews 95a:68100
- Visibility with a moving point of view, Mathematical Reviews 94j:68307
- Parallel construction of quadtrees and quality triangulations, Mathematical Reviews 94j:68291
- Edge insertion for optimal triangulation, Mathematical Reviews 94i:68279
- Connectivity, graph minors, and subgraph multiplicity, Mathematical Reviews 94i:05075
- Improved bounds for intersecting triangles and halving planes, Mathematical Reviews 94f:52006
- Polynomial-size non-obtuse triangulation of polygons, Mathematical Reviews 94e:52016a
- Polynomial-size non-obtuse triangulation of polygons, Mathematical Reviews 94e:52016b
- Finding the $k$ smallest spanning trees, Mathematical Reviews 94e:05082
- Iterated nearest neighbors and finding minimal polytopes, Mathematical Reviews 94c:68197
- Maintenance of a minimum spanning forest in a dynamic planar graph, Mathematical Reviews 94b:68039
- Sparse dynamic programming II: convex and concave cost functions, Mathematical Reviews 93i:90107b
- Sparse dynamic programming I: linear cost functions, Mathematical Reviews 93i:90107a
- Approximating the minimum weight Steiner triangulation, Mathematical Reviews 93e:68099
- Planar orientations with low out-degree and compaction of adjacency matrices, Mathematical Reviews 93a:68114
- Maintenance of a minimum spanning forest in a dynamic planar graph, Mathematical Reviews 93a:68027
- Parallel recognition of series parallel graphs, Mathematical Reviews 92m:05180
- Provably good mesh generation, Mathematical Reviews 92k:65132
- Finding minimum area $k$-gons, Mathematical Reviews 92k:52026
- Equipartitions of graphs, Mathematical Reviews 92k:05125
- The farthest point Delaunay triangulation minimizes angles, Mathematical Reviews 92j:68119
- Simultaneous strong separations of probabilistic and unambiguous complexity classes, Mathematical Reviews 92j:68031
- Horizon theorems for lines and polygons, Mathematical Reviews 92j:52023
- The expected extremes in a Delaunay triangulation, Mathematical Reviews 92e:68189
- Sequence comparison with mixed convex and concave costs, Mathematical Reviews 91h:68031
- Parallel algorithmic techniques for combinatorial computation, Mathematical Reviews 91g:68042
- Reset sequences for monotonic automata, Mathematical Reviews 91f:68070
- Efficient algorithms with applications to molecular biology, Mathematical Reviews 91a:68125
- Algorithms for proximity problems in higher dimensions, Mathematical Reviews 96m:68180
- A deterministic linear time algorithm for geometric separators and its applications, Mathematical Reviews 96m:68162
- Average case analysis of dynamic geometric optimization, Mathematical Reviews 97a:90104
- Separator based sparsification I: planarity testing and minimum spanning trees, Mathematical Reviews 97c:05052
- Approximating center points with iterated Radon points, Mathematical Reviews 97h:65010
- On nearest neighbor graphs, Mathematical Reviews 98d:05121
- Faster geometric $k$-point MST approximation, Mathematical Reviews 98d:68199
- Minimum range balanced cuts via dynamic subset sums, Mathematical Reviews 98k:05129
- Sparsification — A technique for speeding up dynamic graph algorithms, Mathematical Reviews 98k:68039
- On triangulating three-dimensional polygons, Mathematical Reviews 99a:68168
- Faster circle packing with application to nonobtuse triangulation, Mathematical Reviews 99d:52018
- Separator based sparsification II: edge and vertex connectivity, Mathematical Reviews 99g:05058
- Finding the $k$ shortest paths, Mathematical Reviews 99h:05073
- Geometric lower bounds for parametric matroid optimization, Mathematical Reviews 99h:90082
- Optimal point placement for mesh smoothing, Mathematical Reviews 99m:65028
- Linear complexity hexahedral mesh generation, Mathematical Reviews 2000a:68153
- Geometric thickness of complete graphs, Mathematical Reviews 2000g:68118
- Raising roofs, crashing cycles, and playing pool: applications of a data structure for finding pairwise interactions, Mathematical Reviews 2000i:68185
- Subgraph isomorphism in planar graphs and related problems, Mathematical Reviews 2001b:05154
- Diameter and treewidth in minor-closed graph families, Mathematical Reviews 2001c:05132
- Clustering for faster network simplex pivots, Mathematical Reviews 2001c:90088
- Regression depth and center points, Mathematical Reviews 2001e:52024
- Quadrilateral meshing by circle packing, Mathematical Reviews 2001f:52031
- Incremental and decremental maintenance of planar width, Mathematical Reviews 2001g:68095
- Tiling space and slabs with acute tetrahedra, Mathematical Reviews 2039173
- Fat 4-polytopes and fatter 3-spheres, Mathematical Reviews 2034720
- Vertex-unfoldings of simplicial manifolds, Mathematical Reviews 2034718
- Setting parameters by example, Mathematical Reviews 2004g:90114
- Ununfoldable polyhedra with convex faces, Mathematical Reviews 2003m:52017
- Searching for spaceships, Mathematical Reviews 2004b:91044
- Phutball endgames are hard, Mathematical Reviews 2004b:91042
- A disk-packing algorithm for an origami magic trick, Mathematical Reviews 2004b:52030
- The minimum expectation selection problem, Mathematical Reviews 2003m:68054
- Multivariate regression depth, Mathematical Reviews 2003c:52035
- Beta-skeletons have unbounded dilation, Mathematical Reviews 2004a:05045
- Algorithms for coloring quadtrees, Mathematical Reviews 2002h:68036
- Small maximal independent sets and faster exact graph coloring, Mathematical Reviews 2003j:05117
- The distribution of loop lengths in graphical models for turbo decoding, Mathematical Reviews 2002i:94087
- Geometric thickness of complete graphs, Mathematical Reviews 2004f:05044
