The following pages link to Anna Lubiw (Q293262):
Displayed 50 items.
- Pattern matching for permutations (Q293263) (← links)
- Reprint of: Refold rigidity of convex polyhedra (Q390173) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← links)
- Item:Q293262 (redirect page) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Visibility graphs of towers (Q676570) (← links)
- Bounded-degree polyhedronization of point sets (Q691768) (← links)
- Star unfolding from a geodesic curve (Q728501) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Flip distance between two triangulations of a point set is NP-complete (Q906837) (← links)
- Counterexample to a conjecture of Szymanski on hypercube routing (Q911780) (← links)
- Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
- Morphing polyhedra with parallel faces: Counterexamples (Q1025295) (← links)
- Shortest descending paths through given faces (Q1025303) (← links)
- A note on odd/even cycles (Q1120591) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- A lower bound for the integer element distinctness problem (Q1175947) (← links)
- A weighted min-max relation for intervals (Q1186133) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- Enumerating foldings and unfoldings between polygons and polytopes (Q1348668) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Construction and local routing for angle-monotone graphs (Q1627192) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- Flipping edge-labelled triangulations (Q1699301) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Embedding problems for paths with direction constrained edges. (Q1853570) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Coverage with \(k\)-transmitters in the presence of obstacles (Q1944388) (← links)
- Bounded-angle minimum spanning trees (Q2072102) (← links)
- On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Reconfiguring undirected paths (Q2285101) (← links)
- Partitioning orthogonal histograms into rectangular boxes (Q2294687) (← links)
- Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs (Q2301549) (← links)
- Refold rigidity of convex polyhedra (Q2391544) (← links)
- A proof of the orbit conjecture for flipping edge-labelled triangulations (Q2415384) (← links)
- Computing homotopic shortest paths efficiently (Q2432731) (← links)
- Equiprojective polyhedra (Q2483559) (← links)
- When can a net fold to a polyhedron? (Q2486084) (← links)
- Folding a paper strip to minimize thickness (Q2634713) (← links)
- Efficient Algorithms for Petersen's Matching Theorem (Q2709795) (← links)
- (Q2766815) (← links)
- Smart-Grid Electricity Allocation via Strip Packing with Slicing (Q2842139) (← links)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (Q2867674) (← links)
- SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM (Q2893462) (← links)
- Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (Q2936933) (← links)