Jeffrey S. Salowe

According to our database, Jeffrey S. Salowe authored at least 35 papers between 1987 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2008

Rip-Up and Reroute.

Jeffrey S. Salowe

Proceedings of the Handbook of Algorithms for Physical Design Automation., 2008

2004

Parametric search.

Jeffrey S. Salowe

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

1999

Mixed Spanning Trees in Theory and Practice.

Dana S. Richards, Jeffrey S. Salowe

Int. J. Comput. Geom. Appl., 1999

1998

The Power-p Steiner Tree Problem.

Joseph L. Ganley, Jeffrey S. Salowe

Nord. J. Comput., 1998

1996

Optimal and approximate bottleneck Steiner trees.

Joseph L. Ganley, Jeffrey S. Salowe

Oper. Res. Lett., 1996

1995

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

Jeffrey S. Salowe, David M. Warme

Networks, 1995

Low-Degree Minimum Spanning Trees.

Gabriel Robins, Jeffrey S. Salowe

Discret. Comput. Geom., 1995

Euclidean spanners: short, thin, and lanky.

Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

A New Way to Weigh Malnourished Euclidean Graphs.

Gautam Das, Giri Narasimhan, Jeffrey S. Salowe

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

The Multi-Weighted Spanning Tree Problem (Extended Abstract).

Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Closing the gap: near-optimal Steiner trees in polynomial time.

Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

Euclidean Spanner Graphs with Degree Four.

Jeffrey S. Salowe

Discret. Appl. Math., 1994

On the Maximum Degree of Minimum Spanning Trees.

Gabriel Robins, Jeffrey S. Salowe

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

1993

An Exact Rectilinear Steiner Tree Algorithm.

Jeffrey S. Salowe, David M. Warme

Proceedings of the Proceedings 1993 International Conference on Computer Design: VLSI in Computers & Processors, 1993

Mixed spanning trees: a technique for performance-driven routing.

Jeffrey S. Salowe, Dana S. Richards, Dallas E. Wrege

Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

1992

A simple proof of the planar rectilinear Steiner ratio.

Jeffrey S. Salowe

Oper. Res. Lett., 1992

A Note on Lower Bounds for Rectilinear Steiner Trees.

Jeffrey S. Salowe

Inf. Process. Lett., 1992

Enumerating interdistances in space.

Jeffrey S. Salowe

Int. J. Comput. Geom. Appl., 1992

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

Dana S. Richards, Jeffrey S. Salowe

Algorithmica, 1992

Stacks, Queues, and Deques with Order-Statistic Operations.

Dana S. Richards, Jeffrey S. Salowe

Acta Informatica, 1992

On Euclidean Spanner Graphs with Small Degree.

Jeffrey S. Salowe

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Constructing multidimensional spanner graphs.

Jeffrey S. Salowe

Int. J. Comput. Geom. Appl., 1991

A simple proof of Hwang's theorem for rectilinear Steiner minimal trees.

Dana S. Richards, Jeffrey S. Salowe

Ann. Oper. Res., 1991

Shallow Interdistnace Selection and Interdistance Enumeration.

Jeffrey S. Salowe

Proceedings of the Algorithms and Data Structures, 1991

Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees.

Jeffrey S. Salowe

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.

James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990

Stable in Situ Sorting and Minimum Data Movement.

J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe

BIT, 1990

A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.

Dana S. Richards, Jeffrey S. Salowe

Proceedings of the SWAT 90, 1990

1989

An Optimal-Time Algorithm for Slope Selection.

Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi

SIAM J. Comput., 1989

L-Infinity Interdistance Selection by Parametric Search.

Jeffrey S. Salowe

Inf. Process. Lett., 1989

Selecting the kth Largest-Area Convex Polygon.

Jeffrey S. Salowe

Proceedings of the Algorithms and Data Structures, 1989

1988

A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle.

James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe

Proceedings of the 1988 IEEE International Conference on Computer-Aided Design, 1988

Optimal Slope Selection.

Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

Simplified Stable Merging Tasks.

Jeffrey S. Salowe, William L. Steiger

J. Algorithms, 1987

Stable Unmerging in Linear Time and Constant Space.

Jeffrey S. Salowe, William L. Steiger

Inf. Process. Lett., 1987