Shay Solomon
- S. Solomon,
Sparse Euclidean Spanners with Tiny
Diameter. Invited to
ACM Transactions on Algorithms (special issue of SODA'11).
- D. Berend, A. Sapir
and S. Solomon,
The Tower of Hanoi Problem on Pathh Graphs. Accepted to
Discrete Applied Mathematics
(2012).
- S. Solomon,
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is
Light.
To appear in
SIAM Journal on Discrete Mathematics (2012).
-
M. Elkin
and S. Solomon,
Narrow-Shallow-Low-Light Trees with and without Steiner points.
SIAM Journal on Discrete Mathematics 25(1), 181-210 (2011).
-
Y. Dinitz
, M. Elkin
and S. Solomon,
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
Discrete & Computational Geometry 43(4), 736-783 (2010).
(An invited
paper.)
-
N. Solomon
and S. Solomon,
A Natural
Extension of
Catalan Numbers, Journal of Integer Sequences 11, Article
08.3.5 (2008).
- D. Azriel,
N. Solomon
and S. Solomon,
On an Infinite Family of
Solvable
Hanoi Graphs.
ACM Transactions on Algorithms 5(1), Article 13 (2008).
- Y. Dinitz
and S. Solomon,
Optimality of an Algorithm Solving the
Bottleneck Tower of Hanoi Problem, ACM
Transactions on Algorithms 4(3), Article 25 (2008).
- M. Elkin and S. Solomon,
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning
Ones. To appear in Proc. of the 52nd Anual IEEE Symposium on
Foundations of
Computer Science, FOCS'11.
- S. Solomon,
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is
Light.
In Proc. of the 12th Algorithms and Data Structures
Symposium,
WADS'11, 692-703.
- S. Solomon,
An Optimal-Time Construction of
Sparse Euclidean Spanners with Tiny
Diameter.
In Proc. of the 22st Annual ACM-SIAM Symposium on
Discrete Algorithms, SODA'11, 820-839.
Received SODA'11
Best Student Paper Award.
- S. Solomon
and M. Elkin,
Balancing Degree, Diameter and Weight in Euclidean Spanners.
In Proc. of the 18th Annual European Symposium on
Algorithms, ESA'10, 48-59.
- M. Elkin
and S. Solomon,
Narrow-Shallow-Low-Light Trees with and without Steiner points
. In Proc. of the
17th
Annual European Symposium on Algorithms, ESA'09, 215-226.
- Y. Dinitz, M. Elkin
and S. Solomon,
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
In Proc. of the 49th
Anual IEEE Symposium on Foundations of Computer Science,
FOCS'08,
519-528.
- Y. Dinitz
and S. Solomon,
On Optimal Solutions for the Bottleneck
Tower of Hanoi Problem. In Proc. of the 33rd
International Conference on Current Trends in Theory and Practice of
Computer Science, SOFSEM'07, 248-259.
- Y. Dinitz
and S. Solomon,
Optimal Algorithms for Tower of Hanoi Problems
with Relaxed Placement Rules. In Proc.
of the 17th Symposium on Algorithms and
Computation,
ISAAC'06, 36-47.
Email me