10 citations · 54 across the 49 of their papers we have counts for
4 papers · 1 filter
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry-Breaking Problems
Shiri Antaki, Quanquan C. Liu, Shay Solomon
The field of dynamic graph algorithms aims at achieving a thorough understanding of real-world networks whose topology evolves with time. Traditionally, the focus has been on the c…
A Unified Framework for Light Spanners
Hung Le, Shay Solomon
Seminal works on light spanners over the years have provided spanners with optimal lightness in various graph classes, such as general graphs, Euclidean spanners, and minor-free gr…
Light Euclidean Spanners with Steiner Points
Hung Le, Shay Solomon
The FOCS'19 paper of Le and Solomon, culminating a long line of research on Euclidean spanners, proves that the lightness (normalized weight) of the greedy -spanner in $\mat…
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time
Sepehr Assadi, Shay Solomon
Maximal independent set (MIS), maximal matching (MM), and -coloring in graphs of maximum degree are among the most prominent algorithmic graph theory problems. They are…