PushPush is NP-hard in 3D

Quadrilateral Meshing by Circle Packing

Quantifying Homology Classes

Quantifying Homology Classes II: Localization and Stability

Quantifying Transversality by Measuring the Robustness of Intersections

Quasi-Polynomial Time Approximation Schemes for Target Tracking

Quasiconvex Programming

Querying for the Largest Empty Geometric Object in a Desired Location

Querying Two Boundary Points for Shortest Paths in a Polygonal Domain

Quickest Path Queries on Transportation Network

Random hyperplane search trees in high dimensions

Randomization yields simple O(n log star n) algorithms for difficult Omega(n) problems

Randomized Incremental Construction of Compressed Quadtrees

Randomly removing g handles at once

Ranking Unit Squares with Few Visibilities

Reachability by Paths of Bounded Curvature in a Convex Polygon

Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves

Reconstructing Curves from Points and Tangents

Recursive tilings and space-filling curves with little fragmentation

Reducing Interpolation on Multi-Dimensional Grid to Quantizing Grid's Data-Base as a Recursion