Pages that link to "Item:Q1382254"
From MaRDI portal
The following pages link to A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254):
Displaying 18 items.
- Orthogonal graph drawing with flexibility constraints (Q476441) (← links)
- On the two-dimensional orthogonal drawing of series-parallel graphs (Q1026151) (← links)
- Single bend wiring on surfaces (Q1348375) (← links)
- A graph partition problem (Q1367109) (← links)
- Boolean approaches to graph embeddings related to VLSI (Q1609705) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid (Q1827866) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Grid straight-line embeddings of trees with a minimum number of bends per path (Q2059894) (← links)
- Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- (Q2741461) (← links)
- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles (Q5144877) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
