Shay Solomon Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Berend, Amir Sapir, Shay Solomon: The Tower of Hanoi problem on Pathh graphs. Discrete Applied Mathematics 160(10-11): 1465-1483 (2012)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon: The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. SIAM J. Discrete Math. 26(1): 250-262 (2012)
2011
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elkin, Shay Solomon: Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. FOCS 2011: 373-382
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon: An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. SODA 2011: 820-839
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon: The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. WADS 2011: 691-702
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon: The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light CoRR abs/1102.4866: (2011)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel Berend, Amir Sapir, Shay Solomon: The Tower of Hanoi problem on Pathh graphs CoRR abs/1102.4885: (2011)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon, Michael Elkin: Balancing Degree, Diameter and Weight in Euclidean Spanners CoRR abs/1108.6022: (2011)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elkin, Shay Solomon: Narrow-Shallow-Low-Light Trees with and without Steiner Points. SIAM J. Discrete Math. 25(1): 181-210 (2011)
2010
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon, Michael Elkin: Balancing Degree, Diameter and Weight in Euclidean Spanners. ESA (1) 2010: 48-59
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShay Solomon: An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter CoRR abs/1005.4155: (2010)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Michael Elkin, Shay Solomon: Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discrete & Computational Geometry 43(4): 736-783 (2010)
2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elkin, Shay Solomon: Narrow-Shallow-Low-Light Trees with and without Steiner Points. ESA 2009: 215-226
2008
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Michael Elkin, Shay Solomon: Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS 2008: 519-528
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Shay Solomon: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Transactions on Algorithms 4(3): (2008)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDany Azriel, Noam Solomon, Shay Solomon: On an infinite family of solvable Hanoi graphs. ACM Transactions on Algorithms 5(1): (2008)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Michael Elkin, Shay Solomon: Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners CoRR abs/0801.3581: (2008)
2007
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Shay Solomon: On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259
2006
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Shay Solomon: Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC 2006: 36-47

Coauthor Index

1Dany Azriel [4]
2Daniel Berend [13] [19]
3Yefim Dinitz [1] [2] [3] [5] [6] [8]
4Michael Elkin [3] [6] [7] [8] [10] [11] [12] [17]
5Amir Sapir [13] [19]
6Noam Solomon [4]

Last update Fri May 25 01:42:58 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page