The following pages link to Linda Kleist (Q827329):
Displaying 33 items.
- Folding polyominoes with holes into a cube (Q827332) (← links)
- \(\forall\exists\mathbb {R}\)-completeness and area-universality (Q1627164) (← links)
- On the area-universality of triangulations (Q1725766) (← links)
- Folding polyiamonds into octahedra (Q2088889) (← links)
- On the edge-vertex ratio of maximal thrackles (Q2206880) (← links)
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q2232238) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D (Q2936921) (← links)
- Upper and Lower Bounds on Long Dual Paths in Line Arrangements (Q2946411) (← links)
- Drawing Planar Graphs with Prescribed Face Areas (Q3181055) (← links)
- Drawing planar graphs with prescribed face areas (Q4626295) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- (Q5044449) (← links)
- Rainbow Cycles in Flip Graphs. (Q5115806) (← links)
- Rainbow Cycles in Flip Graphs (Q5208641) (← links)
- On Area-Universal Quadrangulations (Q5856667) (← links)
- Convexity-increasing morphs of planar graphs (Q5915593) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
- (Q6059993) (← links)
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game (Q6099392) (← links)
- The complexity of the Hausdorff distance (Q6145675) (← links)
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
- (Q6159887) (← links)
- A solution to Ringel's circle problem (Q6385228) (← links)
- Online sorting and translational packing of convex polygons (Q6538603) (← links)
- The complexity of the Hausdorff distance (Q6539553) (← links)
- Adjacency graphs of polyhedral surfaces (Q6541985) (← links)
- The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
- Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete (Q6620487) (← links)
- Bounding the tripartite-circle crossing number of complete tripartite graphs (Q6621173) (← links)
- Planar graphs and face areas. Area-universality (Q6631300) (← links)
- The tripartite-circle crossing number of graphs with two small partition classes (Q6640040) (← links)
