The following pages link to Stefan Langerman (Q243581):
Displayed 50 items.
- Optimizing some constructions with bars: new geometric knapsack problems (Q266044) (← links)
- Helly numbers of polyominoes (Q367067) (← links)
- The clique problem in ray intersection graphs (Q377488) (← links)
- Triangulating and guarding realistic polygons (Q390140) (← links)
- Draining a polygon-or-rolling a ball out of a polygon (Q390145) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- Proximate point searching (Q598552) (← links)
- Decomposition of multiple coverings into more parts (Q603854) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- Colorful strips (Q659707) (← links)
- Algorithmic folding complexity (Q659709) (← links)
- Continuous blooming of convex polyhedra (Q659710) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Stable roommates spanner (Q691764) (← links)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs (Q691765) (← links)
- Oja centers and centers of gravity (Q691766) (← links)
- Non-crossing matchings of points with geometric objects (Q714905) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- Juggling with pattern matching (Q864953) (← links)
- Morpion solitaire (Q864955) (← links)
- Geodesic ham-sandwich cuts (Q878384) (← links)
- Linear reconfiguration of cube-style modular robots (Q924084) (← links)
- Optimal location of transportation devices (Q945946) (← links)
- Confluently persistent tries for efficient version control (Q970608) (← links)
- Empty region graphs (Q1000919) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- Wrapping spheres with flat paper (Q1028228) (← links)
- Highway hull revisited (Q1037778) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- Interlocked open and closed linkages with few joints. (Q1395574) (← links)
- Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. (Q1395576) (← links)
- The complexity of hyperplane depth in the plane (Q1423588) (← links)
- Threes!, Fives, 1024!, and 2048 are hard (Q1623263) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- Pole dancing: 3D morphs for tree drawings (Q1725773) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Asymmetric communication protocols via hotlink assignments (Q1762995) (← links)
- Designing small keyboards is hard (Q1770399) (← links)
- Queaps (Q1777274) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)