The following pages link to Anna Lubiw (Q293262):
Displaying 50 items.
- Algorithms for Designing Pop-Up Cards (Q2957890) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- (Q3024789) (← links)
- The Boolean Basis Problem and How to Cover Some Polygons by Rectangles (Q3031946) (← links)
- Simultaneous Interval Graphs (Q3060734) (← links)
- Testing Simultaneous Planarity When the Common Graph Is 2-Connected (Q3060792) (← links)
- Coverage with k-Transmitters in the Presence of Obstacles (Q3066439) (← links)
- Algorithms for Solving Rubik’s Cubes (Q3092271) (← links)
- DISTANCE VISIBILITY GRAPHS (Q3136225) (← links)
- (Q3138287) (← links)
- (Q3138955) (← links)
- Morphing Planar Graph Drawings with Bent Edges (Q3168839) (← links)
- Noncrossing Subgraphs in Topological Layouts (Q3357538) (← links)
- A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING (Q3575389) (← links)
- Touring a sequence of polygons (Q3581275) (← links)
- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra (Q3603544) (← links)
- Shortest Gently Descending Paths (Q3605485) (← links)
- Doubly Lexical Orderings of Matrices (Q3758873) (← links)
- Some NP-Complete Problems Similar to Graph Isomorphism (Q3902476) (← links)
- (Q4252281) (← links)
- (Q4252395) (← links)
- The Floodlight Problem (Q4340965) (← links)
- A Visibility Representation for Graphs in Three Dimensions (Q4397214) (← links)
- (Q4411377) (← links)
- Elastic labels around the perimeter of a map (Q4420424) (← links)
- (Q4472317) (← links)
- (Q4504019) (← links)
- A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations (Q4580126) (← links)
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges (Q4625119) (← links)
- Flat foldings of plane graphs with prescribed angles and edge lengths (Q4626289) (← links)
- Continuously Flattening Polyhedra Using Straight Skeletons (Q4635564) (← links)
- Fractional coverings, greedy coverings, and rectifier networks (Q4636621) (← links)
- Convergents of folded continued fractions (Q4875922) (← links)
- Upward Planar Drawing of Single-Source Acyclic Digraphs (Q4877519) (← links)
- A Generalization of the Source Unfolding of Convex Polyhedra (Q4899277) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Self-approaching Graphs (Q4912208) (← links)
- Testing Simultaneous Planarity when the Common Graph is 2-Connected (Q4913760) (← links)
- Rollercoasters and Caterpillars (Q5002684) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Pattern matching for permutations (Q5060113) (← links)
- Rigid flattening of polyhedra with slits (Q5078741) (← links)
- Face flips in origami tessellations (Q5132647) (← links)
- Folding a Paper Strip to Minimize Thickness (Q5176577) (← links)
- Rollercoasters: Long Sequences without Short Runs (Q5232132) (← links)
- Morphing Planar Graph Drawings with Bent Edges (Q5300979) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311146) (← links)
- Shortest paths avoiding forbidden subpaths (Q5326797) (← links)
- Optimal Morphs of Convex Drawings (Q5368681) (← links)
- Star Unfolding from a Geodesic Curve (Q5368701) (← links)
