Jeffrey S. Salowe

According to our database1, Jeffrey S. Salowe
  • authored at least 33 papers between 1987 and 2008.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2008
Rip-Up and Reroute.
Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008

2004
Parametric search.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

1999
Mixed Spanning Trees in Theory and Practice.
Int. J. Comput. Geometry Appl., 1999

1998
The Power-p Steiner Tree Problem.
Nord. J. Comput., 1998

1996
Optimal and approximate bottleneck Steiner trees.
Oper. Res. Lett., 1996

1995
Thirty-five-point rectilinear steiner minimal trees in a day.
Networks, 1995

Low-Degree Minimum Spanning Trees.
Discrete & Computational Geometry, 1995

Euclidean spanners: short, thin, and lanky.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

A New Way to Weigh Malnourished Euclidean Graphs.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

The Multi-Weighted Spanning Tree Problem (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Closing the gap: near-optimal Steiner trees in polynomial time.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1994

Euclidean Spanner Graphs with Degree Four.
Discrete Applied Mathematics, 1994

On the Maximum Degree of Minimum Spanning Trees.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993
An Exact Rectilinear Steiner Tree Algorithm.
Proceedings of the Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, 1993

Mixed spanning trees: a technique for performance-driven routing.
Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

1992
A Note on Lower Bounds for Rectilinear Steiner Trees.
Inf. Process. Lett., 1992

Enumerating interdistances in space.
Int. J. Comput. Geometry Appl., 1992

A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.
Algorithmica, 1992

Stacks, Queues, and Deques with Order-Statistic Operations.
Acta Inf., 1992

On Euclidean Spanner Graphs with Small Degree.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Constructing multidimensional spanner graphs.
Int. J. Comput. Geometry Appl., 1991

Shallow Interdistnace Selection and Interdistance Enumeration.
Proceedings of the Algorithms and Data Structures, 1991

Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1990

Stable in Situ Sorting and Minimum Data Movement.
BIT, 1990

A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.
Proceedings of the SWAT 90, 1990

1989
An Optimal-Time Algorithm for Slope Selection.
SIAM J. Comput., 1989

L-Infinity Interdistance Selection by Parametric Search.
Inf. Process. Lett., 1989

Selecting the kth Largest-Area Convex Polygon.
Proceedings of the Algorithms and Data Structures, 1989

1988
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle.
Proceedings of the 1988 IEEE International Conference on Computer-Aided Design, 1988

Optimal Slope Selection.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
Simplified Stable Merging Tasks.
J. Algorithms, 1987

Stable Unmerging in Linear Time and Constant Space.
Inf. Process. Lett., 1987


  Loading...