Shay Solomon
Tel Aviv University
H-index: 20
Asia-Israel
Top articles of Shay Solomon
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time | Sayan Bhattacharya Martín Costa Nadav Panski Shay Solomon | 2024 | |
Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more | Hsien-Chih Chang Jonathan Conroy Hung Le Lazar Milenković Shay Solomon | 2024 | |
Optimal Euclidean Tree Covers | arXiv preprint arXiv:2403.17754 | Hsien-Chih Chang Jonathan Conroy Hung Le Lazar Milenkovic Shay Solomon | 2024/3/26 |
Covering planar metrics (and beyond): O (1) trees suffice | Hsien-Chih Chang Jonathan Conroy Hung Le Lazar Milenkovic Shay Solomon | 2023/11/6 | |
Dynamic ((1+ ????) ln ????)-Approximation Algorithms for Minimum Set Cover and Dominating Set | Shay Solomon Amitai Uzrad | 2023/6/2 | |
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- Time Barrier | arXiv preprint arXiv:2308.00793 | Anton Bukov Shay Solomon Tianyi Zhang | 2023/8/1 |
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function | Hung Le Lazar Milenković Shay Solomon | 2023 | |
Dynamic -Approximation Algorithms for Minimum Set Cover and Dominating Set | arXiv preprint arXiv:2312.17625 | Shay Solomon Amitai Uzrad | 2023/12/29 |
Density-Sensitive Algorithms for -Edge Coloring | arXiv preprint arXiv:2307.02415 | Sayan Bhattacharya Martín Costa Nadav Panski Shay Solomon | 2023/7/5 |
Resolving the steiner point removal problem in planar graphs via shortcut partitions | arXiv preprint arXiv:2306.06235 | Hsien-Chih Chang Jonathan Conroy Hung Le Lazar Milenkovic Shay Solomon | 2023/6/9 |
Arboricity-dependent algorithms for edge coloring | arXiv preprint arXiv:2311.08367 | Sayan Bhattacharya Martín Costa Nadav Panski Shay Solomon | 2023/11/14 |
Optimal fault-tolerant spanners in euclidean and doubling metrics: Breaking the ω (log n) lightness barrier | Hung Le Shay Solomon Cuong Than | 2023/11/6 | |
A unified framework for light spanners | Hung Le Shay Solomon | 2023/6/2 | |
Dynamic matching algorithms under vertex updates | The 13th Innovations in Theoretical Computer Science Conference (ITCS 2022) | Hung Le Lazar Milenkovic Shay Solomon Virginia Vassilevska Williams | 2022/1 |
Maintaining an EDCS in general graphs: Simpler, density-sensitive and with worst-case time bounds | Fabrizio Grandoni Chris Schwiegelshohn Shay Solomon Amitai Uzrad | 2022 | |
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time∗ | Hung Le Shay Solomon | 2022 | |
Can't see the forest for the trees: Navigating metric spaces by bounded hop-diameter spanners | Omri Kahalon Hung Le Lazar Milenković Shay Solomon | 2022/7/20 | |
Truly optimal euclidean spanners | SIAM Journal on Computing | Hung Le Shay Solomon | 2022 |
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time | ACM Transactions on Algorithms (TALG) | Sayan Bhattacharya Fabrizio Grandoni Janardhan Kulkarni Quanquan C Liu Shay Solomon | 2022/3/4 |
A unified framework of light spanners II: fine-grained optimality | arXiv preprint arXiv:2111.13748 | Hung Le Shay Solomon | 2021/11/26 |
