The following pages link to Accelerated Bend Minimization (Q5894781):
Displaying 23 items.
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Accelerated backward warping (Q1400035) (← links)
- Orthogonal layout with optimal face complexity (Q1616241) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284) (← links)
- Orthogonal Graph Drawing with Inflexible Edges (Q2947010) (← links)
- Accelerating Benders method using covering cut bundle generation (Q3563624) (← links)
- On Turn-Regular Orthogonal Representations (Q5014121) (← links)
- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time (Q5014134) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)
- On Turn-Regular Orthogonal Representations (Q5049999) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- Bend Minimization in Planar Orthogonal Drawings Using Integer Programming (Q5757344) (← links)
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468) (← links)
- Rectilinear planarity of partial 2-trees (Q6117043) (← links)
- Rectilinear Planarity of Partial 2-Trees (Q6141789) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)
- Proper colorability of segment intersection graphs (Q6571282) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6618248) (← links)
- On the parameterized complexity of bend-minimum orthogonal planarity (Q6623586) (← links)
- Unit-length rectangular drawings of graphs (Q6636988) (← links)
