| 2001 |
|---|
| 21 | | Joseph L. Ganley,
Lenwood S. Heath:
The pagenumber of k-trees is O(k).
Discrete Applied Mathematics 109(3): 215-221 (2001) |
| 2000 |
|---|
| 20 | EE | Ion I. Mandoiu,
Vijay V. Vazirani,
Joseph L. Ganley:
A new heuristic for rectilinear Steiner trees.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(10): 1129-1139 (2000) |
| 1999 |
|---|
| 19 | EE | Ion I. Mandoiu,
Vijay V. Vazirani,
Joseph L. Ganley:
A new heuristic for rectilinear Steiner trees.
ICCAD 1999: 157-162 |
| 18 | EE | Joseph L. Ganley:
Efficient solution of systems of orientation constraints.
ISPD 1999: 140-144 |
| 17 | EE | Joseph L. Ganley:
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation.
Discrete Applied Mathematics 90(1-3): 161-171 (1999) |
| 16 | EE | Joseph L. Ganley,
James P. Cohoon:
Provably good moat routing.
Integration 27(1): 47-56 (1999) |
| 1998 |
|---|
| 15 | EE | Joseph L. Ganley,
Lenwood S. Heath:
An Experimental Evaluation of Local Search Heuristics for Graph Partitioning.
Computing 60(2): 121-132 (1998) |
| 14 | | Tamra Carpenter,
Steven Cosares,
Joseph L. Ganley,
Iraj Saniee:
A Simple Approximation Algorithm for Two Problems in Circuit Design.
IEEE Trans. Computers 47(11): 1310-1312 (1998) |
| 13 | | Joseph L. Ganley,
Jeffrey S. Salowe:
The Power-p Steiner Tree Problem.
Nord. J. Comput. 5(2): 115-127 (1998) |
| 1997 |
|---|
| 12 | | Joseph L. Ganley,
James P. Cohoon:
Minimum-Congestion Hypergraph Embedding in a Cycle.
IEEE Trans. Computers 46(5): 600-602 (1997) |
| 11 | | Joseph L. Ganley,
James P. Cohoon:
Improved Computation of Optimal Rectilinear Steiner Minimal Trees.
Int. J. Comput. Geometry Appl. 7(5): 457-472 (1997) |
| 10 | EE | Joseph L. Ganley:
Accuracy and fidelity of fast net length estimates.
Integration 23(2): 151-155 (1997) |
| 1996 |
|---|
| 9 | EE | Joseph L. Ganley,
James P. Cohoon:
A Provably Good Moat Routing Algorithm.
Great Lakes Symposium on VLSI 1996: 86-85 |
| 8 | EE | Joseph L. Ganley,
James P. Cohoon:
Rectilinear Steiner trees on a checkerboard.
ACM Trans. Design Autom. Electr. Syst. 1(4): 512-522 (1996) |
| 1995 |
|---|
| 7 | | Joseph L. Ganley,
Mordecai J. Golin,
Jeffrey S. Salowe:
The Multi-Weighted Spanning Tree Problem (Extended Abstract).
COCOON 1995: 141-150 |
| 6 | EE | Michael J. Alexander,
James P. Cohoon,
Joseph L. Ganley,
Gabriel Robins:
Performance-oriented placement and routing for field-programmable gate arrays.
EURO-DAC 1995: 80-85 |
| 5 | EE | Joseph L. Ganley,
James P. Cohoon:
Thumbnail rectilinear Steiner trees.
Great Lakes Symposium on VLSI 1995: 46-49 |
| 1994 |
|---|
| 4 | | Joseph L. Ganley,
James P. Cohoon:
Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time.
CCCG 1994: 308-313 |
| 3 | EE | Michael J. Alexander,
James P. Cohoon,
Joseph L. Ganley,
Gabriel Robins:
An architecture-independent approach to FPGA routing based on multi-weighted graphs.
EURO-DAC 1994: 259-264 |
| 2 | | Joseph L. Ganley,
James P. Cohoon:
Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles.
ISCAS 1994: 113-116 |
| 1 | | Joseph L. Ganley,
Lenwood S. Heath:
Optimal and Random Partitions of Random Graphs.
Comput. J. 37(7): 641-643 (1994) |
