The following pages link to (Q3997942):
Displayed 6 items.
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
- On the complexity of orthogonal compaction (Q5943322) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Some polynomially solvable subcases of the detailed routing problem in VLSI design (Q5954248) (← links)
- Rectangular drawings of plane graphs without designated corners (Q5959556) (← links)