The following pages link to Joseph L. Ganley (Q176419):
Displaying 11 items.
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- (Q1332691) (redirect page) (← links)
- Heuristics for laying out information graphs (Q1332692) (← links)
- Optimal and approximate bottleneck Steiner trees (Q1362990) (← links)
- An experimental evaluation of local search heuristics for graph partitioning (Q1382773) (← links)
- Accuracy and fidelity of fast net length estimates (Q3840903) (← links)
- (Q4209363) (← links)
- Provably good moat routing (Q4225375) (← links)
- Improved Computation of Optimal Rectilinear Steiner Minimal Trees (Q4365027) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
