| Simple deterministic algorithms for fully dynamic maximal matching O Neiman, S Solomon ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015 | 156 | 2015 |
| Fully dynamic maximal matching in constant update time S Solomon 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 151 | 2016 |
| 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 | 84 | 2018 |
| Dynamic (1+∊)-approximate matchings: A density-sensitive approach D Peleg, S Solomon Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 69 | 2016 |
| The greedy spanner is existentially optimal A Filtser, S Solomon Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 55 | 2016 |
| Truly optimal euclidean spanners H Le, S Solomon SIAM Journal on Computing, FOCS19-135-FOCS19-199, 2022 | 54 | 2022 |
| Improved dynamic graph coloring S Solomon, N Wein ACM Transactions on Algorithms (TALG) 16 (3), 1-24, 2020 | 54 | 2020 |
| 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 | 54 | 2014 |
| 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 | 49 | 2014 |
| New doubling spanners: Better and simpler THH Chan, M Li, L Ning, S Solomon SIAM Journal on Computing 44 (1), 37-53, 2015 | 47 | 2015 |
| Optimal euclidean spanners: Really short, thin, and lanky M Elkin, S Solomon Journal of the ACM (JACM) 62 (5), 1-45, 2015 | 46 | 2015 |
| Steiner shallow-light trees are exponentially lighter than spanning ones M Elkin, S Solomon SIAM Journal on Computing 44 (4), 996-1025, 2015 | 34 | 2015 |
| The greedy spanner is existentially optimal A Filtser, S Solomon SIAM Journal on Computing 49 (2), 429-447, 2020 | 33 | 2020 |
| Fast constructions of lightweight spanners for general graphs M Elkin, S Solomon ACM Transactions on Algorithms (TALG) 12 (3), 1-21, 2016 | 33 | 2016 |
| 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 | 32 | 2018 |
| 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 | 28 | 2020 |
| Local-on-average distributed tasks M Parter, D Peleg, S Solomon Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 27 | 2016 |
| 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 | 25 | 2022 |
| Local algorithms for bounded degree sparsifiers in sparse graphs S Solomon arXiv preprint arXiv:2105.02084, 2021 | 22 | 2021 |
| Light spanners M Elkin, O Neiman, S Solomon SIAM Journal on Discrete Mathematics 29 (3), 1312-1321, 2015 | 21 | 2015 |
