The following pages link to Jeffrey S. Salowe (Q911310):
Displaying 26 items.
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- Stable unmerging in linear time and constant space (Q1108017) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- (Q1179760) (redirect page) (← links)
- A simple proof of Hwang's theorem for rectilinear Steiner minimal trees (Q1179761) (← links)
- A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets (Q1186799) (← links)
- A note on lower bounds for rectilinear Steiner trees (Q1198048) (← links)
- A simple proof of the planar rectilinear Steiner ratio (Q1200801) (← links)
- Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- Optimal and approximate bottleneck Steiner trees (Q1362990) (← links)
- Simplified stable merging tasks (Q3782801) (← links)
- (Q3795242) (← links)
- An Optimal-Time Algorithm for Slope Selection (Q3835020) (← links)
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS (Q3986395) (← links)
- ENUMERATING INTERDISTANCES IN SPACE (Q4016892) (← links)
- (Q4028890) (← links)
- (Q4037412) (← links)
- (Q4209363) (← links)
- (Q4234097) (← links)
- (Q4401027) (← links)
- Thirty‐five‐point rectilinear steiner minimal trees in a day (Q4698230) (← links)
- (Q4886051) (← links)
- MIXED SPANNING TREES IN THEORY AND PRACTICE (Q4949992) (← links)
- A rectilinear steiner minimal tree algorithm for convex point sets (Q5056104) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
