The following pages link to Stefan Langerman (Q243581):
Displaying 50 items.
- Matching Points with Things (Q3557040) (← links)
- GRID VERTEX-UNFOLDING ORTHOSTACKS (Q3575384) (← links)
- (Q3576754) (← links)
- (Q3579416) (← links)
- (Q3579430) (← links)
- Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves (Q3596731) (← links)
- (Q3601523) (← links)
- The Stackelberg Minimum Spanning Tree Game (Q3603515) (← links)
- (Q3619930) (← links)
- Algorithmic Folding Complexity (Q3652233) (← links)
- (Q4411399) (← links)
- (Q4418636) (← links)
- (Q4425955) (← links)
- (Q4427858) (← links)
- (Q4547801) (← links)
- Interlocked open linkages with few joints (Q4557554) (← links)
- Weighted dynamic finger in binary search trees (Q4575627) (← links)
- Subquadratic algorithms for algebraic generalizations of 3SUM (Q4580085) (← links)
- Self-approaching paths in simple polygons (Q4580095) (← links)
- (Q4633837) (← links)
- (Q4736844) (← links)
- (Q4796193) (← links)
- (Q4952599) (← links)
- Dynamic Trees with Almost-Optimal Access Cost (Q5009598) (← links)
- Subquadratic Encodings for Point Configurations (Q5115787) (← links)
- An optimal algorithm to compute the inverse beacon attraction region (Q5115823) (← links)
- Competitive Online Search Trees on Trees (Q5146899) (← links)
- Bichromatic compatible matchings (Q5174487) (← links)
- Algorithms and Computation (Q5191667) (← links)
- Subquadratic encodings for point configurations (Q5207874) (← links)
- Pole Dancing: 3D Morphs for Tree Drawings (Q5233136) (← links)
- Threes!, Fives, 1024!, and 2048 are Hard (Q5282820) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- A Polynomial Bound for Untangling Geometric Planar Graphs (Q5301009) (← links)
- Combining Binary Search Trees (Q5326577) (← links)
- On the complexity of halfspace area queries (Q5361578) (← links)
- Proximate planar point location (Q5361626) (← links)
- Geodesic ham-sandwich cuts (Q5361648) (← links)
- Separating point sets in polygonal environments (Q5361649) (← links)
- Optimal detection of intersections between convex polyhedra (Q5363018) (← links)
- The Complexity of Order Type Isomorphism (Q5383989) (← links)
- Linear Reconfiguration of Cube-Style Modular Robots (Q5387758) (← links)
- Algorithms and Data Structures (Q5394248) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q5404416) (← links)
- Optimal Algorithms for Constrained 1-Center Problems (Q5405030) (← links)
- (Q5417721) (← links)
- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs (Q5443513) (← links)
- Necklaces, Convolutions, and X + Y (Q5449525) (← links)
- Near-Entropy Hotlink Assignments (Q5449536) (← links)
- Weighted Ham-Sandwich Cuts (Q5449753) (← links)
