The following pages link to Therese C. Biedl (Q293200):
Displayed 50 items.
- Three-dimensional orthogonal graph drawing with optimal volume (Q2492635) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING (Q2708038) (← links)
- Efficient Algorithms for Petersen's Matching Theorem (Q2709795) (← links)
- 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved (Q2724198) (← links)
- (Q2768405) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- Smart-Grid Electricity Allocation via Strip Packing with Slicing (Q2842139) (← links)
- A 4-Approximation for the Height of Drawing 2-Connected Outer-Planar Graphs (Q2848931) (← links)
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings (Q2867684) (← links)
- The point-set embeddability problem for plane graphs (Q2874563) (← links)
- THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS (Q2875647) (← links)
- STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA (Q2893454) (← links)
- Drawing Planar Graphs on Points Inside a Polygon (Q2912719) (← links)
- Height-Preserving Transformations of Planar Graph Drawings (Q2936946) (← links)
- Small-Area Orthogonal Drawings of 3-Connected Graphs (Q2959753) (← links)
- Representing Directed Trees as Straight Skeletons (Q2959768) (← links)
- Non-aligned Drawings of Planar Graphs (Q2961510) (← links)
- $1$-string $B_2$-VPG representation of planar graphs (Q2970471) (← links)
- Order-Preserving 1-String Representations of Planar Graphs (Q2971141) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- Ideal Drawings of Rooted Trees With Approximately Optimal Width (Q2985123) (← links)
- RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS (Q2999095) (← links)
- (Q3043732) (← links)
- (Q3043792) (← links)
- Finding Hidden Independent Sets in Interval Graphs (Q3082926) (← links)
- Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations (Q3104623) (← links)
- (Q3132853) (← links)
- Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs (Q3188882) (← links)
- Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames (Q3223941) (← links)
- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs (Q3557885) (← links)
- Drawing Planar 3-Trees with Given Face-Areas (Q3557888) (← links)
- (Q3575465) (← links)
- Partitions of Graphs into Trees (Q3595491) (← links)
- Cauchy’s Theorem and Edge Lengths of Convex Polyhedra (Q3603544) (← links)
- Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0 (Q3639236) (← links)
- Reconstructing Polygons from Scanner Data (Q3652273) (← links)
- (Q4232783) (← links)
- New Lower Bounds For Orthogonal Drawings (Q4243440) (← links)
- (Q4252281) (← links)
- (Q4393372) (← links)
- (Q4407717) (← links)
- (Q4422262) (← links)
- (Q4427862) (← links)
- (Q4472318) (← links)
- (Q4474098) (← links)
- (Q4501714) (← links)
- (Q4511242) (← links)
- (Q4536355) (← links)
- (Q4536356) (← links)