The following pages link to On optimum single-row routing (Q4198668):
Displaying 7 items.
- Partitioning technique for transforming perfect binary trees into single-row networks (Q691994) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- The benefits of external wires in single row routing (Q1183431) (← links)
- Single backup table schemes for shortest-path routing (Q1770371) (← links)
- Ranking intervals under visibility constraints<sup>∗</sup> (Q3477956) (← links)
- Double-row planar routing and permutation layout (Q3952043) (← links)