default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey S. Salowe
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[r2]Jeffrey S. Salowe:
Rip-Up and Reroute. Handbook of Algorithms for Physical Design Automation 2008- 2004
- [r1]Jeffrey S. Salowe:
Parametric search. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 969-982
1990 – 1999
- 1999
- [j20]Dana S. Richards, Jeffrey S. Salowe:
Mixed Spanning Trees in Theory and Practice. Int. J. Comput. Geom. Appl. 9(3): 277-292 (1999) - 1998
- [j19]Joseph L. Ganley, Jeffrey S. Salowe:
The Power-p Steiner Tree Problem. Nord. J. Comput. 5(2): 115-127 (1998) - 1996
- [j18]Joseph L. Ganley, Jeffrey S. Salowe:
Optimal and approximate bottleneck Steiner trees. Oper. Res. Lett. 19(5): 217-224 (1996) - 1995
- [j17]Gabriel Robins, Jeffrey S. Salowe:
Low-Degree Minimum Spanning Trees. Discret. Comput. Geom. 14(2): 151-165 (1995) - [j16]Jeffrey S. Salowe, David M. Warme:
Thirty-five-point rectilinear steiner minimal trees in a day. Networks 25(2): 69-87 (1995) - [c13]Joseph L. Ganley, Mordecai J. Golin
, Jeffrey S. Salowe:
The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON 1995: 141-150 - [c12]Gautam Das, Giri Narasimhan, Jeffrey S. Salowe:
A New Way to Weigh Malnourished Euclidean Graphs. SODA 1995: 215-222 - [c11]Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid:
Euclidean spanners: short, thin, and lanky. STOC 1995: 489-498 - 1994
- [j15]Jeffrey S. Salowe:
Euclidean Spanner Graphs with Degree Four. Discret. Appl. Math. 54(1): 55-66 (1994) - [j14]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): 1351-1365 (1994) - [c10]Gabriel Robins, Jeffrey S. Salowe:
On the Maximum Degree of Minimum Spanning Trees. SCG 1994: 250-258 - 1993
- [c9]Jeffrey S. Salowe, Dana S. Richards, Dallas E. Wrege:
Mixed spanning trees: a technique for performance-driven routing. Great Lakes Symposium on VLSI 1993: 62-66 - [c8]Jeffrey S. Salowe, David M. Warme:
An Exact Rectilinear Steiner Tree Algorithm. ICCD 1993: 472-475 - 1992
- [j13]Dana S. Richards, Jeffrey S. Salowe:
Stacks, Queues, and Deques with Order-Statistic Operations. Acta Informatica 29(5): 395-414 (1992) - [j12]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) - [j11]Jeffrey S. Salowe:
Enumerating interdistances in space. Int. J. Comput. Geom. Appl. 2(1): 49-59 (1992) - [j10]Jeffrey S. Salowe:
A Note on Lower Bounds for Rectilinear Steiner Trees. Inf. Process. Lett. 42(3): 151-152 (1992) - [j9]Jeffrey S. Salowe:
A simple proof of the planar rectilinear Steiner ratio. Oper. Res. Lett. 12(4): 271-274 (1992) - [c7]Jeffrey S. Salowe:
On Euclidean Spanner Graphs with Small Degree. SCG 1992: 186-191 - 1991
- [j8]Dana S. Richards, Jeffrey S. Salowe:
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. Ann. Oper. Res. 33(7): 549-556 (1991) - [j7]Jeffrey S. Salowe:
Constructing multidimensional spanner graphs. Int. J. Comput. Geom. Appl. 1(2): 99-107 (1991) - [c6]Jeffrey S. Salowe:
Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees. SCG 1991: 256-261 - [c5]Jeffrey S. Salowe:
Shallow Interdistnace Selection and Interdistance Enumeration. WADS 1991: 117-128 - 1990
- [j6]J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe:
Stable in Situ Sorting and Minimum Data Movement. BIT 30(2): 220-234 (1990) - [j5]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): 398-407 (1990) - [c4]Dana S. Richards, Jeffrey S. Salowe:
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. SWAT 1990: 201-212
1980 – 1989
- 1989
- [j4]Jeffrey S. Salowe:
L-Infinity Interdistance Selection by Parametric Search. Inf. Process. Lett. 30(1): 9-14 (1989) - [j3]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) - [c3]Jeffrey S. Salowe:
Selecting the kth Largest-Area Convex Polygon. WADS 1989: 243-250 - 1988
- [c2]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi:
Optimal Slope Selection. ICALP 1988: 133-146 - [c1]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: 402-405 - 1987
- [j2]Jeffrey S. Salowe, William L. Steiger:
Stable Unmerging in Linear Time and Constant Space. Inf. Process. Lett. 25(5): 285-294 (1987) - [j1]Jeffrey S. Salowe, William L. Steiger:
Simplified Stable Merging Tasks. J. Algorithms 8(4): 557-571 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
