AuthorProfile for Joseph Lavinus Ganley
Optimal Rectilinear Steiner Tree Routing in the Presence of Obstacles
Joseph L. Ganley
A new heuristic for rectilinear Steiner trees.
Joseph L. Ganley
Heuristics for laying out information graphs.
Joseph L. Ganley
Thumbnail rectilinear Steiner trees.
Joseph L. Ganley
Introductory Scheme - revision 1
Joseph W. Lavinus
Efficient solution of systems of orientation constraints.
Joseph L. Ganley
113 Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles
Joseph L. Ganley
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation
Joseph L. Ganley
The Multi-Weighted Spanning Tree Problem (Extended Abstract).
Joseph L. Ganley
Improved Computation of Optimal Rectilinear Steiner Minimal Trees.
Joseph L. Ganley
Provably good moat routing.
Joseph L. Ganley
Accuracy and fidelity of fast net length estimates.
Joseph L. Ganley
An architecture-independent approach to FPGA routing based on multi-weighted graphs.
Joseph L. Ganley
Gabriel Robins
Computing Optimal Rectilinear Steiner Trees: A Survey and Experimental Evaluation.
Joseph L. Ganley
Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time.
Joseph L. Ganley
An Architecture-Independent Approach to FPGA Routing Based on Multi-Weighted Graphs
Michael Alexander
Joseph L. Ganley
Gabriel Robins
A New Heuristic for Rectilinear Steiner Trees
Joseph L. Ganley
Quick Placement with Geometric Constraints
Joseph L. Ganley
Edoardo Charbon
Accuracy and Fidelity of Fast Net Length Estimates
Joseph L. Ganley
Minimum-Congestion Hypergraph Embedding in a Cycle.
Joseph L. Ganley
A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees
Joseph L. Ganley
A new heuristic for rectilinear Steiner trees.
Joseph L. Ganley
Provably Good Moat Routing
Joseph L. Ganley
Optimal and Random Partitions of Random Graphs.
Joseph L. Ganley
Rectilinear Steiner trees on a checkerboard.
Joseph L. Ganley
Geometric Interconnection and Placement Algorithms
Joseph Lavinus Ganley
The Power-p Steiner Tree Problem.
Joseph L. Ganley
The pagenumber of k-trees is O(k).
Joseph L. Ganley
Performance-oriented placement and routing for field-programmable gate arrays.
Joseph L. Ganley
Gabriel Robins
An Experimental Evaluation of Local Search Heuristics for Graph Partitioning.
Joseph L. Ganley
A Simple Approximation Algorithm for Two Problems in Circuit Design.
Tamra Carpenter
Steven Cosares
Joseph L. Ganley
Iraj Saniee
Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles
Joseph Ganley
A Faster Dynamic Programming Algorithm for Exact Rectilinear Steiner Minimal Trees
Joseph Ganley
Optimal Rectilinear Steiner Minimal Trees in O(n²2.62²) Time
Joseph L. Ganley
Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles.
Joseph L. Ganley
A Provably Good Moat Routing Algorithm.
Joseph L. Ganley
This service is maintained by
James R. Griffin III
and
Thomas Krichel