Jeffrey S. Salowe

Publication Activity (10 Years)

Years Active: 1987-1999
Publications (10 Years): 0

Publications

Dana S. Richards, Jeffrey S. Salowe
Mixed Spanning Trees in Theory and Practice. Int. J. Comput. Geom. Appl. 9 (3) (1999)
Joseph L. Ganley, Jeffrey S. Salowe
The Power-p Steiner Tree Problem. Nord. J. Comput. 5 (2) (1998)
Joseph L. Ganley, Jeffrey S. Salowe
Optimal and approximate bottleneck Steiner trees. Oper. Res. Lett. 19 (5) (1996)
Gabriel Robins, Jeffrey S. Salowe
Low-Degree Minimum Spanning Trees. Discret. Comput. Geom. 14 (2) (1995)
Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
Euclidean spanners: short, thin, and lanky. STOC (1995)
Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON (1995)
Jeffrey S. Salowe, David M. Warme
Thirty-five-point rectilinear steiner minimal trees in a day. Networks 25 (2) (1995)
Gautam Das, Giri Narasimhan, Jeffrey S. Salowe
A New Way to Weigh Malnourished Euclidean Graphs. SODA (1995)
Gabriel Robins, Jeffrey S. Salowe
On the Maximum Degree of Minimum Spanning Trees. SCG (1994)
Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang
Closing the gap: near-optimal Steiner trees in polynomial time. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 13 (11) (1994)
Jeffrey S. Salowe
Euclidean Spanner Graphs with Degree Four. Discret. Appl. Math. 54 (1) (1994)
Jeffrey S. Salowe, Dana S. Richards, Dallas E. Wrege
Mixed spanning trees: a technique for performance-driven routing. Great Lakes Symposium on VLSI (1993)
Jeffrey S. Salowe, David M. Warme
An Exact Rectilinear Steiner Tree Algorithm. ICCD (1993)
Dana S. Richards, Jeffrey S. Salowe
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets. Algorithmica 7 (2&3) (1992)
Jeffrey S. Salowe
Enumerating interdistances in space. Int. J. Comput. Geom. Appl. 2 (1) (1992)
Jeffrey S. Salowe
On Euclidean Spanner Graphs with Small Degree. SCG (1992)
Dana S. Richards, Jeffrey S. Salowe
Stacks, Queues, and Deques with Order-Statistic Operations. Acta Informatica 29 (5) (1992)
Jeffrey S. Salowe
A Note on Lower Bounds for Rectilinear Steiner Trees. Inf. Process. Lett. 42 (3) (1992)
Jeffrey S. Salowe
A simple proof of the planar rectilinear Steiner ratio. Oper. Res. Lett. 12 (4) (1992)
Jeffrey S. Salowe
Constructing multidimensional spanner graphs. Int. J. Comput. Geom. Appl. 1 (2) (1991)
Dana S. Richards, Jeffrey S. Salowe
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. Ann. Oper. Res. 33 (7) (1991)
Jeffrey S. Salowe
Shallow Interdistnace Selection and Interdistance Enumeration. WADS (1991)
Jeffrey S. Salowe
Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees. SCG (1991)
J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe
Stable in Situ Sorting and Minimum Data Movement. BIT 30 (2) (1990)
Dana S. Richards, Jeffrey S. Salowe
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. SWAT (1990)
James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9 (4) (1990)
Jeffrey S. Salowe
Selecting the kth Largest-Area Convex Polygon. WADS (1989)
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. 18 (4) (1989)
Jeffrey S. Salowe
L-Infinity Interdistance Selection by Parametric Search. Inf. Process. Lett. 30 (1) (1989)
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
Optimal Slope Selection. ICALP (1988)
James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle. ICCAD (1988)
Jeffrey S. Salowe, William L. Steiger
Simplified Stable Merging Tasks. J. Algorithms 8 (4) (1987)
Jeffrey S. Salowe, William L. Steiger
Stable Unmerging in Linear Time and Constant Space. Inf. Process. Lett. 25 (5) (1987)