http://localhost:4173/http://localhost:4173/problems/http://localhost:4173/news/http://localhost:4173/submit/http://localhost:4173/about/http://localhost:4173/problems/3-colorability-of-arrangements-of-great-circles/http://localhost:4173/problems/3d-minimum-bend-orthogonal-graph-drawings/http://localhost:4173/problems/3sum-hard-problems/http://localhost:4173/problems/bpp-vs-p/http://localhost:4173/problems/chromatic-number-of-the-plane/http://localhost:4173/problems/compatible-triangulations/http://localhost:4173/problems/congruent-partitions-of-polygons/http://localhost:4173/problems/counting-polyominoes/http://localhost:4173/problems/distances-among-point-sets-in-r-2-and-r-3/http://localhost:4173/problems/dynamic-planar-nearest-neighbors/http://localhost:4173/problems/edge-coloring-geometric-graphs/http://localhost:4173/problems/edge-unfolding-convex-polyhedra/http://localhost:4173/problems/edge-unfolding-polycubes/http://localhost:4173/problems/equiprojective-polyhedra/http://localhost:4173/problems/euclidean-minimum-spanning-tree/http://localhost:4173/problems/matrix-multiplication-exponent/http://localhost:4173/problems/extending-pseudosegment-arrangements-by-subdivision/http://localhost:4173/problems/fair-partitioning-of-convex-polygons/http://localhost:4173/problems/fast-l-1-difference-3b724921/http://localhost:4173/problems/flip-graph-connectivity-in-3d/http://localhost:4173/problems/freeze-tag-optimal-strategies-for-awakening-a-swarm-of-robots/http://localhost:4173/problems/general-unfoldings-of-nonconvex-polyhedra/http://localhost:4173/problems/graph-isomorphism-complexity/http://localhost:4173/problems/hamiltonian-tetrahedralizations/http://localhost:4173/problems/k-sets/http://localhost:4173/problems/l-vs-nl/http://localhost:4173/problems/linear-programming-strongly-polynomial/http://localhost:4173/problems/linear-volume-3d-grid-drawings-of-planar-graphs/http://localhost:4173/problems/lines-tangent-to-four-unit-balls/http://localhost:4173/problems/minimum-euclidean-matching-in-2d/http://localhost:4173/problems/minimum-link-path-in-2d/http://localhost:4173/problems/monochromatic-triangles/http://localhost:4173/problems/most-circular-partition-of-a-square/http://localhost:4173/problems/output-sensitive-convex-hull-in-r-d/http://localhost:4173/problems/p-vs-np/http://localhost:4173/problems/p-vs-pspace/http://localhost:4173/problems/pallet-loading/http://localhost:4173/problems/planar-euclidean-maximum-tsp/http://localhost:4173/problems/point-location-in-3d-subdivision/http://localhost:4173/problems/polygonal-curve-simplification/http://localhost:4173/problems/polyhedral-surface-approximation/http://localhost:4173/problems/polyhedron-with-regular-pentagon-faces/http://localhost:4173/problems/quantiles-908c1500/http://localhost:4173/problems/quantum-pcp/http://localhost:4173/problems/queue-number-of-planar-graphs/http://localhost:4173/problems/rectangling-a-rectangle/http://localhost:4173/problems/reflexivity-of-point-sets/http://localhost:4173/problems/rolling-a-die-over-a-labeled-board/http://localhost:4173/problems/simple-linear-time-polygon-triangulation/http://localhost:4173/problems/simple-polygonalizations/http://localhost:4173/problems/smallest-universal-set-of-points-for-planar-graphs/http://localhost:4173/problems/sorting-x-y-pairwise-sums/http://localhost:4173/problems/strong-exponential-time-hypothesis/http://localhost:4173/problems/sum-of-square-roots/http://localhost:4173/problems/np-circuit-lower-bounds/http://localhost:4173/problems/surface-reconstruction/http://localhost:4173/problems/the-number-of-pointed-pseudotriangulations/http://localhost:4173/problems/thrackles/http://localhost:4173/problems/transforming-polygons-via-vertex-centroid-moves/http://localhost:4173/problems/trapping-light-rays-with-segment-mirrors/http://localhost:4173/problems/traveling-salesman-problem-in-solid-grid-graphs/http://localhost:4173/problems/union-of-fat-objects-in-3d/http://localhost:4173/problems/unique-games-conjecture/http://localhost:4173/problems/vertex-pi-floodlights/http://localhost:4173/problems/vertex-unfolding-polyhedra/http://localhost:4173/problems/vertical-decompositions-in-r-d/http://localhost:4173/problems/visibility-graph-recognition/http://localhost:4173/problems/volume-maximizing-convex-shape/http://localhost:4173/problems/voronoi-diagram-of-lines-in-3d/http://localhost:4173/problems/what-is-the-complexity-of-joint-differential-privacy-in-linear-contextual-bandits-f7af6dac/http://localhost:4173/problems/yao-yao-graph-a-spanner/http://localhost:4173/problems/zipper-unfoldings-of-convex-polyhedra/http://localhost:4173/news/openai-first-proof-submissions/http://localhost:4173/news/gemini-imo-2025/http://localhost:4173/news/alphaevolve-matrix-multiplication/