Shay Solomon
Affiliations:- Tel Aviv University, Israel
According to our database1,
Shay Solomon
authored at least 83 papers
between 2006 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
10
1
2
1
4
5
1
2
1
2
5
1
1
4
2
2
3
2
8
5
6
3
2
4
4
3
4
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024
Proceedings of the 40th International Symposium on Computational Geometry, 2024
2023
CoRR, 2023
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions.
CoRR, 2023
Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function.
Proceedings of the 39th International Symposium on Computational Geometry, 2023
2022
ACM Trans. Algorithms, 2022
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach.
ACM Trans. Parallel Comput., 2021
CoRR, 2021
Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs.
CoRR, 2021
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial.
Proceedings of the 35th International Symposium on Distributed Computing, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
CoRR, 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
2017
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds.
CoRR, 2017
2016
ACM Trans. Algorithms, 2016
ACM Trans. Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
2015
SIAM J. Comput., 2015
2014
SIAM J. Discret. Math., 2014
From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics.
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014
2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
SIAM J. Discret. Math., 2012
2011
SIAM J. Discret. Math., 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
2010
Discret. Comput. Geom., 2010
CoRR, 2010
2008
ACM Trans. Algorithms, 2008
CoRR, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007
2006
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006