Disjoint edges in complete topological graphs

Higher-order Erdos--Szekeres theorems

On topological changes in the Delaunay triangulation of moving points

Object-image correspondence for curves under central and parallel projections

Geometric Packing under Non-uniform Constraints

On sub-determinants and the diameter of polyhedra

Cubic Plane Graphs on a Given Point Set

Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique

The point-set embeddability problem for plane graphs

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

How to Walk Your Dog in the Mountains with No Magic Leash

Add Isotropic Gaussian Kernels at Own Risk: More and More Resiliant Modes in Higher Dimensions

Self-improving Algorithms for Coordinate-wise Maxima

Linear-Size Approximations to the Vietoris-Rips Filtration

Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore

Approximating Tverberg Points in Linear Time for Any Fixed Dimension

Multinerves and Helly numbers of acyclic families

Duals of Orphan-Free Anisotropic Voronoi Diagrams are Triangulations

Certified Computation of planar Morse-Smale Complexes

Tracing Compressed Curves in Triangulated Surfaces

Computing Cartograms with Optimal Complexity

Algorithmic complexity of finding cross-cycles in flag complexes

Stabbing Horizontal Segments with Vertical Rays

On the Expected Complexity of Voronoi Diagrams on Terrains

Approximating Low-Dimensional Coverage Problems

The 2-page crossing number of $K_{n}$

Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model

Improved Range Searching Lower Bounds

Stability of Delaunay-type structures for manifolds

A Fast and Simple Surface Reconstruction Algorithm

A theorem of Barany revisited and extended

Testing graph isotopy on surfaces

Counting Crossing Free Structures

Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems

A Deterministic O(m log m) Time Algorithm for the Reeb Graph

Finding the Maximal Empty Disk Containing a Query Point

Optimal Area-Sensitive Bounds for Polytope Approximation

An output-sensitive algorithm for computing projections of resultant polytopes

Conflict-Free Coloring of Points with Respect to Rectangles and Approximation Algorithms for Discrete Independent Set

On Laplacians of Random Complexes

On Klee's Measure Problem on Grounded Boxes

Periodic body-and-bar frameworks

String graphs and incomparability graphs

Approximate Bregman near neighbors in sublinear time: Beyond the triangle inequality