Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. - Fabrizio Grandoni 001; Chris Schwiegelshohn; Shay Solomon; Amitai Uzrad (SOSA, 2022)

Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. - Shay Solomon; Amitai Uzrad (STOC, 2023)

A Lossless Deamortization for Dynamic Greedy Set Cover. - Shay Solomon; Amitai Uzrad; Tianyi Zhang 008 (FOCS, 2024)