Computational geometry
- All geometry papers
- Traveling salesman and hamiltonian cycle problems
- Minimum spanning trees
- Folding and unfolding
- Hyperbolic geometry
- Paths and distances in geometric graphs
- Halving lines and k-sets
- Deep points in arrangements
- Dynamic computational geometry
- Mesh generation and optimal triangulation
- Quadtrees and related hierarchical decompositions
- Geometric clustering
- Nearest neighbors
- Circles, spheres, and sphere packing
- Low-dimensional linear programming and LP-type problems
- Straight skeletons
- Zonotopes
- Geometric approximation
- Graph drawing
- Ramsey theory
- Generating multiple near-optimal solutions
- Geometric methods for non-geometric problems
- Miscellaneous geometry