| 1999 |
|---|
| 27 | | Dana S. Richards,
Jeffrey S. Salowe:
Mixed Spanning Trees in Theory and Practice.
Int. J. Comput. Geometry Appl. 9(3): 277-292 (1999) |
| 1998 |
|---|
| 26 | | Joseph L. Ganley,
Jeffrey S. Salowe:
The Power-p Steiner Tree Problem.
Nord. J. Comput. 5(2): 115-127 (1998) |
| 1995 |
|---|
| 25 | | Joseph L. Ganley,
Mordecai J. Golin,
Jeffrey S. Salowe:
The Multi-Weighted Spanning Tree Problem (Extended Abstract).
COCOON 1995: 141-150 |
| 24 | | Gautam Das,
Giri Narasimhan,
Jeffrey S. Salowe:
A New Way to Weigh Malnourished Euclidean Graphs.
SODA 1995: 215-222 |
| 23 | EE | Sunil Arya,
Gautam Das,
David M. Mount,
Jeffrey S. Salowe,
Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky.
STOC 1995: 489-498 |
| 22 | | Gabriel Robins,
Jeffrey S. Salowe:
Low-Degree Minimum Spanning Trees.
Discrete & Computational Geometry 14(2): 151-165 (1995) |
| 1994 |
|---|
| 21 | EE | Gabriel Robins,
Jeffrey S. Salowe:
On the Maximum Degree of Minimum Spanning Trees.
Symposium on Computational Geometry 1994: 250-258 |
| 20 | EE | Jeffrey S. Salowe:
Euclidean Spanner Graphs with Degree Four.
Discrete Applied Mathematics 54(1): 55-66 (1994) |
| 19 | EE | Jeff Griffith,
Gabriel Robins,
Jeffrey S. Salowe,
Tongtong Zhang:
Closing the gap: near-optimal Steiner trees in polynomial time.
IEEE Trans. on CAD of Integrated Circuits and Systems 13(11): 1351-1365 (1994) |
| 1993 |
|---|
| 18 | | Jeffrey S. Salowe,
David M. Warme:
An Exact Rectilinear Steiner Tree Algorithm.
ICCD 1993: 472-475 |
| 1992 |
|---|
| 17 | EE | Jeffrey S. Salowe:
On Euclidean Spanner Graphs with Small Degree.
Symposium on Computational Geometry 1992: 186-191 |
| 16 | | Dana S. Richards,
Jeffrey S. Salowe:
Stacks, Queues, and Deques with Order-Statistic Operations.
Acta Inf. 29(5): 395-414 (1992) |
| 15 | | 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): 247-276 (1992) |
| 14 | | Jeffrey S. Salowe:
A Note on Lower Bounds for Rectilinear Steiner Trees.
Inf. Process. Lett. 42(3): 151-152 (1992) |
| 13 | | Jeffrey S. Salowe:
Enumerating interdistances in space.
Int. J. Comput. Geometry Appl. 2(1): 49-59 (1992) |
| 1991 |
|---|
| 12 | EE | Jeffrey S. Salowe:
Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees.
Symposium on Computational Geometry 1991: 256-261 |
| 11 | | Jeffrey S. Salowe:
Shallow Interdistnace Selection and Interdistance Enumeration.
WADS 1991: 117-128 |
| 10 | | Jeffrey S. Salowe:
Constructing multidimensional spanner graphs.
Int. J. Comput. Geometry Appl. 1(2): 99-107 (1991) |
| 1990 |
|---|
| 9 | | Dana S. Richards,
Jeffrey S. Salowe:
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.
SWAT 1990: 201-212 |
| 8 | | J. Ian Munro,
Venkatesh Raman,
Jeffrey S. Salowe:
Stable in Situ Sorting and Minimum Data Movement.
BIT 30(2): 220-234 (1990) |
| 7 | EE | 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. on CAD of Integrated Circuits and Systems 9(4): 398-407 (1990) |
| 1989 |
|---|
| 6 | | Jeffrey S. Salowe:
Selecting the kth Largest-Area Convex Polygon.
WADS 1989: 243-250 |
| 5 | | Jeffrey S. Salowe:
L-Infinity Interdistance Selection by Parametric Search.
Inf. Process. Lett. 30(1): 9-14 (1989) |
| 4 | | Richard Cole,
Jeffrey S. Salowe,
William L. Steiger,
Endre Szemerédi:
An Optimal-Time Algorithm for Slope Selection.
SIAM J. Comput. 18(4): 792-810 (1989) |
| 1988 |
|---|
| 3 | | Richard Cole,
Jeffrey S. Salowe,
William L. Steiger,
Endre Szemerédi:
Optimal Slope Selection.
ICALP 1988: 133-146 |
| 1987 |
|---|
| 2 | | Jeffrey S. Salowe,
William L. Steiger:
Stable Unmerging in Linear Time and Constant Space.
Inf. Process. Lett. 25(5): 285-294 (1987) |
| 1 | | Jeffrey S. Salowe,
William L. Steiger:
Simplified Stable Merging Tasks.
J. Algorithms 8(4): 557-571 (1987) |
