Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. - Yefim Dinitz; Shay Solomon (ISAAC, 2006)

On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. - Yefim Dinitz; Shay Solomon (SOFSEM (1), 2007)

Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. - Yefim Dinitz; Michael Elkin; Shay Solomon (FOCS, 2008)

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners - Yefim Dinitz; Michael Elkin; Shay Solomon (CoRR, 2008)

On an infinite family of solvable Hanoi graphs. - Dany Azriel; Noam Solomon; Shay Solomon (ACM Trans. Algorithms, 2008)

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. - Yefim Dinitz; Shay Solomon (ACM Trans. Algorithms, 2008)

An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter - Shay Solomon (CoRR, 2010)

Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. - Yefim Dinitz; Michael Elkin; Shay Solomon (Discret. Comput. Geom., 2010)

An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. - Shay Solomon (SODA, 2011)

The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light - Shay Solomon (CoRR, 2011)

Narrow-Shallow-Low-Light Trees with and without Steiner Points. - Michael Elkin; Shay Solomon (SIAM J. Discret. Math., 2011)

Deterministic Algorithms for Fully Dynamic Maximal Matching - Ofer Neiman; Shay Solomon (CoRR, 2012)

Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler - Shay Solomon (CoRR, 2012)

The Tower of Hanoi problem on Pathh graphs. - Daniel Berend; Amir Sapir; Shay Solomon (Discret. Appl. Math., 2012)

The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. - Shay Solomon (SIAM J. Discret. Math., 2012)

Fast Constructions of Light-Weight Spanners for General Graphs. - Michael Elkin; Shay Solomon (SODA, 2013)

Sparse Euclidean Spanners with Tiny Diameter. - Shay Solomon (ACM Trans. Algorithms, 2013)

On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. - Noam Solomon; Shay Solomon (ANALCO, 2014)

Light spanners for Snowflake Metrics. - Lee-Ad Gottlieb; Shay Solomon (SoCG, 2014)

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. - Tsvi Kopelowitz; Robert Krauthgamer; Ely Porat; Shay Solomon (ICALP (2), 2014)

From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics. - Shay Solomon (STOC, 2014)

Balancing Degree, Diameter, and Weight in Euclidean Spanners. - Shay Solomon; Michael Elkin (SIAM J. Discret. Math., 2014)

Optimal Euclidean Spanners: Really Short, Thin, and Lanky. - Michael Elkin; Shay Solomon (J. ACM, 2015)

Euclidean Steiner shallow-light trees. - Shay Solomon (J. Comput. Geom., 2015)

New Doubling Spanners: Better and Simpler. - T.-H. Hubert Chan; Mingfei Li; Li Ning 001; Shay Solomon (SIAM J. Comput., 2015)

Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones. - Michael Elkin; Shay Solomon (SIAM J. Comput., 2015)

Light Spanners. - Michael Elkin; Ofer Neiman; Shay Solomon (SIAM J. Discret. Math., 2015)

Fully Dynamic Maximal Matching in Constant Update Time. - Shay Solomon (FOCS, 2016)

Local-on-Average Distributed Tasks. - Merav Parter; David Peleg; Shay Solomon (SODA, 2016)

Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. - David Peleg; Shay Solomon (SODA, 2016)

Fast Constructions of Lightweight Spanners for General Graphs. - Michael Elkin; Shay Solomon (ACM Trans. Algorithms, 2016)

Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. - Ofer Neiman; Shay Solomon (ACM Trans. Algorithms, 2016)

Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds. - Moses Charikar; Shay Solomon (CoRR, 2017)

Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. - Moses Charikar; Shay Solomon (ICALP, 2018)

Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs. - Shay Solomon (ITCS, 2018)

Wireless Expanders. - Shirel Attali; Merav Parter; David Peleg; Shay Solomon (SPAA, 2018)

Fully dynamic maximal independent set with sublinear update time. - Sepehr Assadi; Krzysztof Onak; Baruch Schieber; Shay Solomon (STOC, 2018)

Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. - Haim Kaplan; Shay Solomon (CoRR, 2018)

Dynamic Approximate Matchings with an Optimal Recourse Bound. - Shay Solomon (CoRR, 2018)

Truly Optimal Euclidean Spanners. - Hung Le 001; Shay Solomon (FOCS, 2019)

When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. - Sepehr Assadi; Shay Solomon (ICALP, 2019)

(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. - Fabrizio Grandoni 001; Stefano Leonardi 001; Piotr Sankowski; Chris Schwiegelshohn; Shay Solomon (SODA, 2019)

Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. - Sepehr Assadi; Krzysztof Onak; Baruch Schieber; Shay Solomon (SODA, 2019)

Fully Dynamic (Δ+1)-Coloring in Constant Update Time. - Sayan Bhattacharya; Fabrizio Grandoni 001; Janardhan Kulkarni; Quanquan C. Liu; Shay Solomon (CoRR, 2019)

Light Euclidean Spanners with Steiner Points. - Hung Le 001; Shay Solomon (ESA, 2020)

A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. - Lazar Milenkovic; Shay Solomon (SPAA, 2020)

A Unified and Fine-Grained Approach for Light Spanners. - Hung Le 001; Shay Solomon (CoRR, 2020)

Dynamic Distributed MIS with Improved Bounds. - Shiri Antaki; Quanquan C. Liu; Shay Solomon (CoRR, 2020)

The Greedy Spanner Is Existentially Optimal. - Arnold Filtser; Shay Solomon (SIAM J. Comput., 2020)

Fully Dynamic MIS in Uniformly Sparse Graphs. - Krzysztof Onak; Baruch Schieber; Shay Solomon; Nicole Wein (ACM Trans. Algorithms, 2020)

Improved Dynamic Graph Coloring. - Shay Solomon; Nicole Wein (ACM Trans. Algorithms, 2020)

Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. - Sepehr Assadi; Shay Solomon (ESA, 2021)

A Generalized Matching Reconfiguration Problem. - Noam Solomon; Shay Solomon (ITCS, 2021)

Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. - Adir Morgan; Shay Solomon; Nicole Wein (DISC, 2021)

Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs. - Adir Morgan; Shay Solomon; Nicole Wein (CoRR, 2021)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions. - Hung Le 001; Shay Solomon (CoRR, 2021)

A Unified Framework of Light Spanners II: Fine-Grained Optimality. - Hung Le 001; Shay Solomon (CoRR, 2021)

Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. - Haim Kaplan; Shay Solomon (ACM Trans. Parallel Comput., 2021)

Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. - Hung Le 001; Lazar Milenkovic; Shay Solomon (SoCG, 2022)

Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. - Shiri Antaki; Quanquan C. Liu; Shay Solomon (ITCS, 2022)

Dynamic Matching Algorithms Under Vertex Updates. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Virginia Vassilevska Williams (ITCS, 2022)

Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. - Omri Kahalon; Hung Le 001; Lazar Milenkovic; Shay Solomon (PODC, 2022)

Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. - Hung Le 001; Shay Solomon (SODA, 2022)

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)

Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. - Sayan Bhattacharya; Fabrizio Grandoni 001; Janardhan Kulkarni; Quanquan C. Liu; Shay Solomon (ACM Trans. Algorithms, 2022)

Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. - Hung Le 001; Lazar Milenkovic; Shay Solomon (SoCG, 2023)

Covering Planar Metrics (and Beyond): O(1) Trees Suffice. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (FOCS, 2023)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. - Hung Le 001; Shay Solomon; Cuong Than (FOCS, 2023)

A Unified Framework for Light Spanners. - Hung Le 001; Shay Solomon (STOC, 2023)

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

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (CoRR, 2023)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. - Anton Bukov; Shay Solomon; Tianyi Zhang 008 (CoRR, 2023)

Optimal Euclidean Tree Covers. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SoCG, 2024)

Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. - Sayan Bhattacharya; Martín Costa; Nadav Panski; Shay Solomon (ESA, 2024)

Towards Instance-Optimal Euclidean Spanners. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (FOCS, 2024)

Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. - Sayan Bhattacharya; Din Carmon; Martín Costa; Shay Solomon; Tianyi Zhang 008 (FOCS, 2024)

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

Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. - Sayan Bhattacharya; Martín Costa; Nadav Panski; Shay Solomon (SODA, 2024)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SODA, 2024)

Arboricity-Dependent Algorithms for Edge Coloring. - Sayan Bhattacharya; Martín Costa; Nadav Panski; Shay Solomon (SWAT, 2024)

Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. - Sayan Bhattacharya; Martín Costa; Shay Solomon; Tianyi Zhang 008 (SODA, 2025)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. - Anton Bukov; Shay Solomon; Tianyi Zhang 008 (SODA, 2025)

Vizing's Theorem in Near-Linear Time. - Sepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martín Costa; Shay Solomon; Tianyi Zhang 008 (STOC, 2025)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Shay Solomon; Cuong Than (STOC, 2025)

Approximate Light Spanners in Planar Graphs. - Hung Le 001; Shay Solomon; Cuong Than; Csaba D. Tóth; Tianyi Zhang 008 (CoRR, 2025)

Covering the Euclidean Plane by a Pair of Trees. - Hung Le 001; Lazar Milenkovic; Shay Solomon; Tianyi Zhang 008 (CoRR, 2025)

A Tight Lower Bound for Doubling Spanners. - An La; Hung Le 001; Shay Solomon; Cuong Than; Vinayak; Shuang Yang; Tianyi Zhang 008 (CoRR, 2025)