The following pages link to Single Row Routing (Q3659167):
Displaying 9 items.
- Minimizing channel density in standard cell layout (Q1102924) (← links)
- The benefits of external wires in single row routing (Q1183431) (← links)
- A fast algorithm for finding interlocking sets (Q1263973) (← links)
- Optimum embedding of complete graphs in books (Q1379820) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- Using Euler’s Formula to Find the Lower Bound of the Page Number (Q6489355) (← links)