Computing k-Centers On a Line

Computing L1 Shortest Paths among Polygonal Obstacles in the Plane

Computing largest circles separating two sets of segments

Computing Multidimensional Persistence

Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time

Computing Shortest Paths among Curved Obstacles in the Plane

Computing the Depth of a Flat

Computing the Discrete Fréchet Distance in Subquadratic Time

Computing the Distance between Piecewise-Linear Bivariate Functions

Computing the Fewest-turn Map Directions based on the Connectivity of Natural Roads

Computing the Fréchet Distance Between Folded Polygons

Computing the obstacle number of a plane graph

Cone fields and topological sampling in manifolds with bounded curvature

Configuration spaces of convex and embedded polygons in the plane

Conflict-free graph orientations with parity constraints

Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way

Confluent Hasse diagrams

Confluent Layered Drawings

Conformal Geometry, Euclidean Space and Geometric Algebra

Connecting a Set of Circles with Minimum Sum of Radii