The following pages link to Therese C. Biedl (Q293200):
Displaying 50 items.
- (Q202640) (redirect page) (← links)
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Orthogonal cartograms with at most 12 corners per face (Q390136) (← links)
- A simple algorithm for computing positively weighted straight skeletons of monotone polygons (Q477646) (← links)
- On triangulating \(k\)-outerplanar graphs (Q479051) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs (Q629832) (← links)
- Efficient view point selection for silhouettes of convex polyhedra (Q634248) (← links)
- Reconstructing orthogonal polyhedra from putative vertex sets (Q634249) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- Polygons needing many flipturns (Q818679) (← links)
- Area-efficient static and incremental graph drawings (Q826069) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- Reconstructing \(hv\)-convex multi-coloured polyominoes (Q986548) (← links)
- Drawing \(K_{2,n}\): A lower bound (Q1007548) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Morphing polyhedra with parallel faces: Counterexamples (Q1025295) (← links)
- A note on reconfiguring tree linkages: Trees can lock (Q1348403) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q1386769) (← links)
- Palindrome recognition using a multidimensional tape. (Q1401342) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- Fun-Sort -- or the chaos of unordered binary search (Q1765229) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Bounded-degree independent sets in planar graphs (Q1780842) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- Drawing planar 3-trees with given face areas (Q1931272) (← links)
- Faster optimal algorithms for segment minimization with small maximal value (Q1932452) (← links)
- A note on improving the performance of approximation algorithms for radiation therapy (Q1944893) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Horton-Strahler number, rooted pathwidth and upward drawings of trees (Q2059912) (← links)
- Finding large matchings in 1-planar graphs of minimum degree 3 (Q2110625) (← links)
- All subgraphs of a wheel are 5-coupled-choosable (Q2115842) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- Line and plane cover numbers revisited (Q2206873) (← links)
- Homotopy height, grid-major height and graph-drawing height (Q2206879) (← links)
- A note on 1-planar graphs with minimum degree 7 (Q2217475) (← links)
- Weighted straight skeletons in the plane (Q2261581) (← links)
- Partitioning orthogonal histograms into rectangular boxes (Q2294687) (← links)
- Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs (Q2301549) (← links)
- Packing boundary-anchored rectangles and squares (Q2306362) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- Reprint of: Weighted straight skeletons in the plane (Q2341696) (← links)
- A 2-approximation for the height of maximal outerplanar graph drawings (Q2405282) (← links)
- Splitting \(B_2\)-VPG graphs into outer-string and co-comparability graphs (Q2405283) (← links)
- When can a net fold to a polyhedron? (Q2486084) (← links)
- A note on 3D orthogonal graph drawing (Q2486752) (← links)
