Search the dblp DataBase

Publications of Author

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