Shay Solomon

Michael Elkin, Shay Solomon: Fast Constructions of Light-Weight Spanners for General Graphs. SODA 2013: 513-525

Shay Solomon: From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics. CoRR abs/1304.8135 (2013)

Daniel Berend, Amir Sapir, Shay Solomon: The Tower of Hanoi problem on Path_h graphs. Discrete Applied Mathematics 160(10-11): 1465-1483 (2012)

Shay Solomon: The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. SIAM J. Discrete Math. 26(1): 250-262 (2012)

Ofer Neiman, Shay Solomon: Deterministic Algorithms for Fully Dynamic Maximal Matching. CoRR abs/1207.1277 (2012)

Michael Elkin, Shay Solomon: Fast Constructions of Light-Weight Spanners for General Graphs. CoRR abs/1207.1668 (2012)

Michael Elkin, Shay Solomon: Optimal Euclidean spanners: really short, thin and lanky. CoRR abs/1207.1831 (2012)

Shay Solomon: Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler. CoRR abs/1207.7040 (2012)

Michael Elkin, Shay Solomon: Narrow-Shallow-Low-Light Trees with and without Steiner Points. SIAM J. Discrete Math. 25(1): 181-210 (2011)

Michael Elkin, Shay Solomon: Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. FOCS 2011: 373-382

Shay Solomon: An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. SODA 2011: 820-839

Shay Solomon: The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. WADS 2011: 691-702

Shay Solomon: The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light. CoRR abs/1102.4866 (2011)

Daniel Berend, Amir Sapir, Shay Solomon: The Tower of Hanoi problem on Path_h graphs. CoRR abs/1102.4885 (2011)

Shay Solomon, Michael Elkin: Balancing Degree, Diameter and Weight in Euclidean Spanners. CoRR abs/1108.6022 (2011)

Yefim Dinitz, Michael Elkin, Shay Solomon: Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discrete & Computational Geometry 43(4): 736-783 (2010)

Shay Solomon, Michael Elkin: Balancing Degree, Diameter and Weight in Euclidean Spanners. ESA (1) 2010: 48-59

Shay Solomon: An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter. CoRR abs/1005.4155 (2010)

Michael Elkin, Shay Solomon: Narrow-Shallow-Low-Light Trees with and without Steiner Points. ESA 2009: 215-226

Yefim Dinitz, Shay Solomon: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Transactions on Algorithms 4(3) (2008)

Dany Azriel, Noam Solomon, Shay Solomon: On an infinite family of solvable Hanoi graphs. ACM Transactions on Algorithms 5(1) (2008)

Yefim Dinitz, Michael Elkin, Shay Solomon: Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS 2008: 519-528

Yefim Dinitz, Michael Elkin, Shay Solomon: Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners. CoRR abs/0801.3581 (2008)

Yefim Dinitz, Shay Solomon: On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259

Yefim Dinitz, Shay Solomon: Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC 2006: 36-47