| 2026 | ESA | Dynamic Dominating Set in Uniformly Sparse Graphs. | Anton Bukov, Shay Solomon |
| 2026 | ICALP | Dynamic Set Cover with Worst-Case Recourse. | Shay Solomon, Amitai Uzrad |
| 2026 | SODA | Covering the Euclidean Plane by a Pair of Trees. | Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang |
| 2026 | SODA | Approximate Light Spanners in Planar Graphs. | Hung Le, Shay Solomon, Cuong Than, Csaba D. Tth, Tianyi Zhang |
| 2026 | SODA | Vizing's Theorem in Deterministic Almost-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2025 | SODA | Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. | Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2025 | SODA | Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- | Anton Bukov, Shay Solomon, Tianyi Zhang |
| 2025 | STOC | Vizing's Theorem in Near-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2025 | STOC | Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than |
| 2024 | ESA | Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. | Sayan Bhattacharya, Martn Costa, Nadav Panski, Shay Solomon |
| 2024 | FOCS | Towards Instance-Optimal Euclidean Spanners. | Hung Le, Shay Solomon, Cuong Than, Csaba D. Tth, Tianyi Zhang |
| 2024 | FOCS | Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. | Sayan Bhattacharya, Din Carmon, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2024 | FOCS | A Lossless Deamortization for Dynamic Greedy Set Cover. | Shay Solomon, Amitai Uzrad, Tianyi Zhang |
| 2024 | SODA | Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. | Sayan Bhattacharya, Martn Costa, Nadav Panski, Shay Solomon |
| 2024 | SODA | Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than |
| 2023 | FOCS | Covering Planar Metrics (and Beyond): O(1) Trees Suffice. | Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than |
| 2023 | FOCS | Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. | Hung Le, Shay Solomon, Cuong Than |
| 2023 | STOC | A Unified Framework for Light Spanners. | Hung Le, Shay Solomon |
| 2023 | STOC | Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. | Shay Solomon, Amitai Uzrad |
| 2022 | PODC | Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. | Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon |
| 2022 | SODA | Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. | Hung Le, Shay Solomon |
| 2021 | ESA | Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. | Sepehr Assadi, Shay Solomon |
| 2020 | ESA | Light Euclidean Spanners with Steiner Points. | Hung Le, Shay Solomon |
| 2020 | SPAA | A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. | Lazar Milenkovic, Shay Solomon |
| 2019 | FOCS | Truly Optimal Euclidean Spanners. | Hung Le, Shay Solomon |
| 2019 | ICALP | When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. | Sepehr Assadi, Shay Solomon |
| 2019 | SODA | (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. | Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon |
| 2019 | SODA | Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
| 2018 | ESA | Improved Dynamic Graph Coloring. | Shay Solomon, Nicole Wein |
| 2018 | ICALP | Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. | Moses Charikar, Shay Solomon |
| 2018 | ICALP | Fully Dynamic MIS in Uniformly Sparse Graphs. | Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein |
| 2018 | STOC | Fully dynamic maximal independent set with sublinear update time. | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
| 2018 | SPAA | Wireless Expanders. | Shirel Attali, Merav Parter, David Peleg, Shay Solomon |
| 2018 | SPAA | Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. | Haim Kaplan, Shay Solomon |
| 2016 | FOCS | Fully Dynamic Maximal Matching in Constant Update Time. | Shay Solomon |
| 2016 | PODC | The Greedy Spanner is Existentially Optimal. | Arnold Filtser, Shay Solomon |
| 2016 | SODA | Local-on-Average Distributed Tasks. | Merav Parter, David Peleg, Shay Solomon |
| 2016 | SODA | Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. | David Peleg, Shay Solomon |
| 2014 | ICALP | Light Spanners. | Michael Elkin, Ofer Neiman, Shay Solomon |
| 2014 | ICALP | Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. | Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon |
| 2014 | STOC | From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics. | Shay Solomon |
| 2013 | ICALP | New Doubling Spanners: Better and Simpler. | T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon |
| 2013 | SODA | Fast Constructions of Light-Weight Spanners for General Graphs. | Michael Elkin, Shay Solomon |
| 2013 | STOC | Optimal euclidean spanners: really short, thin and lanky. | Michael Elkin, Shay Solomon |
| 2013 | STOC | Simple deterministic algorithms for fully dynamic maximal matching. | Ofer Neiman, Shay Solomon |
| 2011 | FOCS | Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. | Michael Elkin, Shay Solomon |
| 2011 | SODA | An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. | Shay Solomon |
| 2011 | WADS | The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. | Shay Solomon |
| 2010 | ESA | Balancing Degree, Diameter and Weight in Euclidean Spanners. | Shay Solomon, Michael Elkin |
| 2009 | ESA | Narrow-Shallow-Low-Light Trees with and without Steiner Points. | Michael Elkin, Shay Solomon |
| 2008 | FOCS | Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. | Yefim Dinitz, Michael Elkin, Shay Solomon |
| 2007 | SOFSEM | On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. | Yefim Dinitz, Shay Solomon |
| 2006 | ISAAC | Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. | Yefim Dinitz, Shay Solomon |