Follow
Shay Solomon
Shay Solomon
Verified email at tauex.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
Simple deterministic algorithms for fully dynamic maximal matching
O Neiman, S Solomon
ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015
1462015
Fully dynamic maximal matching in constant update time
S Solomon
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
1402016
Fully dynamic maximal independent set with sublinear update time
S Assadi, K Onak, B Schieber, S Solomon
Proceedings of the 50th Annual ACM SIGACT Symposium on theory of computing …, 2018
742018
Dynamic (1+∊)-approximate matchings: A density-sensitive approach
D Peleg, S Solomon
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
662016
The greedy spanner is existentially optimal
A Filtser, S Solomon
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
532016
Truly optimal euclidean spanners
H Le, S Solomon
SIAM Journal on Computing, FOCS19-135-FOCS19-199, 2022
502022
Orienting fully dynamic graphs with worst-case time bounds
T Kopelowitz, R Krauthgamer, E Porat, S Solomon
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
492014
Improved dynamic graph coloring
S Solomon, N Wein
ACM Transactions on Algorithms (TALG) 16 (3), 1-24, 2020
472020
Optimal Euclidean spanners: Really short, thin, and lanky
M Elkin, S Solomon
Journal of the ACM (JACM) 62 (5), 1-45, 2015
472015
From hierarchical partitions to hierarchical covers: Optimal fault-tolerant spanners for doubling metrics
S Solomon
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
442014
New doubling spanners: Better and simpler
THH Chan, M Li, L Ning, S Solomon
SIAM Journal on Computing 44 (1), 37-53, 2015
392015
Fast constructions of lightweight spanners for general graphs
M Elkin, S Solomon
ACM Transactions on Algorithms (TALG) 12 (3), 1-21, 2016
342016
Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier
M Charikar, S Solomon
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
312018
Steiner shallow-light trees are exponentially lighter than spanning ones
M Elkin, S Solomon
SIAM Journal on Computing 44 (4), 996-1025, 2015
312015
Fully dynamic MIS in uniformly sparse graphs
K Onak, B Schieber, S Solomon, N Wein
ACM Transactions on Algorithms (TALG) 16 (2), 1-19, 2020
262020
Maintaining an edcs in general graphs: Simpler, density-sensitive and with worst-case time bounds
F Grandoni, C Schwiegelshohn, S Solomon, A Uzrad
Symposium on Simplicity in Algorithms (SOSA), 12-23, 2022
252022
The greedy spanner is existentially optimal
A Filtser, S Solomon
SIAM Journal on Computing 49 (2), 429-447, 2020
252020
Local-on-average distributed tasks
M Parter, D Peleg, S Solomon
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
242016
Balancing degree, diameter, and weight in Euclidean spanners
S Solomon, M Elkin
SIAM Journal on Discrete Mathematics 28 (3), 1173-1198, 2014
242014
Local algorithms for bounded degree sparsifiers in sparse graphs
S Solomon
arXiv preprint arXiv:2105.02084, 2021
202021
The system can't perform the operation now. Try again later.
Articles 1–20