The following lists all problems sorted by number. These numbers can be used for citations and correspond to the order in which the problems were entered.
Problem 1: Minimum Weight Triangulation
Problem 2: Voronoi Diagram of Moving Points
Problem 3: Voronoi Diagram of Lines in 3D
Problem 4: Union of Fat Objects in 3D
Problem 5: Euclidean Minimum Spanning Tree
Problem 6: Minimum Euclidean Matching in 2D
Problem 7: k-sets
Problem 8: Linear Programming: Strongly Polynomial?
Problem 9: Edge-Unfolding Convex Polyhedra
Problem 10: Simple Linear-Time Polygon Triangulation
Problem 11: 3SUM Hard Problems
Problem 12: Dynamic Planar Convex Hull
Problem 13: Point Location in 3D Subdivision
Problem 14: Binary Space Partition Size
Problem 15: Output-sensitive Convex Hull in \R^d
Problem 16: Simple Polygonalizations
Problem 17: Visibility Graph Recognition
Problem 18: Pushing Disks Together
Problem 19: Vertical Decompositions in \R^d
Problem 20: Minimum Stabbing Spanning Tree
Problem 21: Shortest Paths among Obstacles in 2D
Problem 22: Minimum-Link Path in 2D
Problem 23: Vertex \pi-Floodlights
Problem 24: Polygonal Curve Simplification
Problem 25: Polyhedral Surface Approximation
Problem 26: Surface Reconstruction
Problem 27: Hexahedral Meshing
Problem 28: Flip Graph Connectivity in 3D
Problem 29: Hamiltonian Tetrahedralizations
Problem 30: Thrackles
Problem 31: Trapping Light Rays with Segment Mirrors
Problem 32: Bar-Magnet Polyhedra
Problem 33: Sum of Square Roots
Problem 34: Extending Pseudosegment Arrangements by Subdivision
Problem 35: Freeze-Tag: Optimal Strategies for Awakening a Swarm of Robots
Problem 36: Inplace Convex Hull of a Simple Polygonal Chain
Problem 37: Counting Polyominoes
Problem 38: Compatible Triangulations
Problem 39: Distances among Point Sets in \R^2 and \R^3
Problem 40: The Number of Pointed Pseudotriangulations
Problem 41: Sorting X+Y (Pairwise Sums)
Problem 42: Vertex-Unfolding Polyhedra
Problem 43: General Unfoldings of Nonconvex Polyhedra
Problem 44: 3-Colorability of Arrangements of Great Circles
Problem 45: Smallest Universal Set of Points for Planar Graphs
Problem 46: 3D Minimum-Bend Orthogonal Graph Drawings
Problem 47: Hinged Dissections
Problem 48: Bounded-Degree Minimum Euclidean Spanning Tree
Problem 49: Planar Euclidean Maximum TSP
Problem 50: Pointed Spanning Trees in Triangulations
Problem 51: Linear-Volume 3D Grid Drawings of Planar Graphs
Problem 52: Queue-Number of Planar Graphs
Problem 53: Minimum-Turn Cycle Cover in Planar Grid Graphs
Problem 54: Traveling Salesman Problem in Solid Grid Graphs
Problem 55: Pallet Loading
Problem 56: Packing Unit Squares in a Simple Polygon
Problem 57: Chromatic Number of the Plane
Problem 58: Monochromatic Triangles
Problem 59: Most Circular Partition of a Square
Problem 60: Transforming Polygons via Vertex-Centroid Moves
Problem 61: Lines Tangent to Four Unit Balls
Problem 62: Volume Maximizing Convex Shape
Problem 63: Dynamic Planar Nearest Neighbors
Problem 64: Edge-Unfolding Polycubes
Problem 65: Magic Configurations
Problem 66: Reflexivity of Point Sets
Problem 67: Fair Partitioning of Convex Polygons
Problem 68: Rolling a Die over a Labeled Board
Problem 69: Isoceles Planar Graph Drawing
Problem 70: Yao-Yao Graph a Spanner?
Problem 71: Stretch-Factor for Points in Convex Position
Problem 72: Polyhedron with Regular Pentagon Faces
Problem 73: Congruent Partitions of Polygons
Problem 74: Slicing Axes-Parallel Rectangles
Problem 75: Edge-Coloring Geometric Graphs
Problem 76: Equiprojective Polyhedra
Problem 77: Zipper Unfoldings of Convex Polyhedra
Problem 78: Rectangling a Rectangle