The following pages link to Stefan Langerman (Q243581):
Displaying 50 items.
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Sigma-local graphs (Q2266933) (← links)
- Polyhedral characterization of reversible hinged dissections (Q2308491) (← links)
- Cookie clicker (Q2308498) (← links)
- Which convex polyhedra can be made by gluing regular hexagons? (Q2308504) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- Generalized river crossing problems (Q2345990) (← links)
- Worst-case optimal tree layout in external memory (Q2354018) (← links)
- Bichromatic compatible matchings (Q2354926) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- Searching edges in the overlap of two plane graphs (Q2405305) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Edge-unfolding nested polyhedral bands (Q2456664) (← links)
- Local properties of geometric graphs (Q2456666) (← links)
- Dynamic hotlinks (Q2480907) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Covering things with things (Q2484005) (← links)
- Output-sensitive algorithms for computing nearest-neighbour decision boundaries (Q2484010) (← links)
- Geometric restrictions on producible polygonal protein chains (Q2492634) (← links)
- Toward unfolding doubly covered \(n\)-stars (Q2695478) (← links)
- The four bars problem (Q2821957) (← links)
- Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles (Q2842144) (← links)
- De-amortizing Binary Search Trees (Q2843241) (← links)
- Blocking Colored Point Sets (Q2849797) (← links)
- Algorithms and Complexity of Generalized River Crossing Problems (Q2902926) (← links)
- The Clique Problem in Ray Intersection Graphs (Q2912845) (← links)
- Reconstructing Point Set Order Typesfrom Radial Orderings (Q2942609) (← links)
- Retroactive data structures (Q2944550) (← links)
- (Q2949117) (← links)
- Space-Time Trade-offs for Stack-Based Algorithms (Q2957891) (← links)
- Reversible Nets of Polyhedra (Q2958083) (← links)
- Bust-a-Move/Puzzle Bobble Is NP-complete (Q2958090) (← links)
- Approximating the average stretch factor of geometric graphs (Q2968089) (← links)
- Reconstructing Point Set Order Types from Radial Orderings (Q2988723) (← links)
- COMPUTING SIGNED PERMUTATIONS OF POLYGONS (Q3007725) (← links)
- Approximating the Average Stretch Factor of Geometric Graphs (Q3060719) (← links)
- Realistic Reconfiguration of Crystalline (and Telecube) Robots (Q3079494) (← links)
- Determination of All Tessellation Polyhedra with Regular Polygonal Faces (Q3098060) (← links)
- Common Unfoldings of Polyominoes and Polycubes (Q3098067) (← links)
- Computing the Visibility Polygon Using Few Variables (Q3104601) (← links)
- Incremental Voronoi diagrams (Q3132848) (← links)
- A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino (Q3132886) (← links)
- Entropy, triangulation, and point location in planar subdivisions (Q3189070) (← links)
- PRICING GEOMETRIC TRANSPORTATION NETWORKS (Q3405968) (← links)
- (Q3445222) (← links)
- (Q3497955) (← links)
- Confluently Persistent Tries for Efficient Version Control (Q3512456) (← links)
- A Characterization of the degree sequences of 2-trees (Q3522846) (← links)
- Colorful Strips (Q3557004) (← links)
