The following pages link to Graph Drawing (Q5896917):
Displaying 16 items.
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- Counting the number of crossings in geometric graphs (Q2224846) (← links)
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n logn) Area (Extended Abstract) (Q3605507) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- Drawing Planar Graphs on Area (Q5300977) (← links)
- Four-Connected Spanning Subgraphs of Doughnut Graphs (Q5452160) (← links)
- Accelerated Bend Minimization (Q5895514) (← links)
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468) (← links)
