The complexity of minimizing wire lengths in VLSI layouts
Deciding if a graph has a VLSI layout with a specified maximum edge length is NP-complete.
www.sciencedirect.com