Shay Solomon - RankMe

149 papers A* 41A 10B 5Journal 85Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Approximate Light Spanners in Planar Graphs. SODA Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2026	A*	`conf`	Covering the Euclidean Plane by a Pair of Trees. SODA Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2026	J	`jnl`	Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. ACM Trans. Algorithms Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
2026	J	`jnl`	Optimal Euclidean Tree Covers. Discret. Comput. Geom. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2026	A*	`conf`	Vizing's Theorem in Deterministic Almost-Linear Time. SODA Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	J	`jnl`	A Tight Lower Bound for Doubling Spanners. CoRR An La, Hung Le, Shay Solomon, Cuong Than, Vinayak, Shuang Yang, Tianyi Zhang
2025	J	`jnl`	A Unified Framework of Light Spanners I: Fast (Yet Optimal) Constructions. SIAM J. Comput. Hung Le, Shay Solomon
2025	J	`jnl`	Approximate Light Spanners in Planar Graphs. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2025	J	`jnl`	Approximating Euclidean Shallow-Light Trees. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2025	J	`jnl`	Covering the Euclidean Plane by a Pair of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Tianyi Zhang
2025	J	`jnl`	Dynamic Set Cover with Worst-Case Recourse. CoRR Shay Solomon, Amitai Uzrad
2025	A*	`conf`	Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. SODA Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. STOC Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than
2025	J	`jnl`	Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Shay Solomon, Cuong Than
2025	A*	`conf`	Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- SODA Anton Bukov, Shay Solomon, Tianyi Zhang
2025	J	`jnl`	Tree-Like Shortcuttings of Trees. CoRR Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2025	J	`jnl`	Truly Optimal Euclidean Spanners. SIAM J. Comput. Hung Le, Shay Solomon
2025	J	`jnl`	Vizing's Theorem in Deterministic Almost-Linear Time. CoRR Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Vizing's Theorem in Near-Linear Time. STOC Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024	A*	`conf`	A Lossless Deamortization for Dynamic Greedy Set Cover. FOCS Shay Solomon, Amitai Uzrad, Tianyi Zhang
2024	J	`jnl`	A Lossless Deamortization for Dynamic Greedy Set Cover. CoRR Shay Solomon, Amitai Uzrad, Tianyi Zhang
2024	—	`conf`	Arboricity-Dependent Algorithms for Edge Coloring. SWAT Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2024	A	`conf`	Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. ESA Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2024	J	`jnl`	Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. CoRR Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024	J	`jnl`	Faster (Δ + 1)-Edge Coloring: Breaking the m √n Time Barrier. CoRR Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
2024	A*	`conf`	Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. FOCS Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang
2024	A*	`conf`	Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. SODA Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2024	A*	`conf`	Optimal Euclidean Tree Covers. SoCG Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	J	`jnl`	Optimal Euclidean Tree Covers. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	A*	`conf`	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2024	A*	`conf`	Towards Instance-Optimal Euclidean Spanners. FOCS Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2024	J	`jnl`	Towards Instance-Optimal Euclidean Spanners. CoRR Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang
2024	J	`jnl`	Vizing's Theorem in Near-Linear Time. CoRR Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2023	A*	`conf`	A Unified Framework for Light Spanners. STOC Hung Le, Shay Solomon
2023	J	`jnl`	Arboricity-Dependent Algorithms for Edge Coloring. CoRR Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2023	A*	`conf`	Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Density-Sensitive Algorithms for (Δ+1)-Edge Coloring. CoRR Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2023	A*	`conf`	Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. STOC Shay Solomon, Amitai Uzrad
2023	J	`jnl`	Dynamic ((1+ε)ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. CoRR Shay Solomon, Amitai Uzrad
2023	J	`jnl`	Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. CoRR Anton Bukov, Shay Solomon, Tianyi Zhang
2023	J	`jnl`	Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. CoRR Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon
2023	A*	`conf`	Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. FOCS Hung Le, Shay Solomon, Cuong Than
2023	J	`jnl`	Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier. CoRR Hung Le, Shay Solomon, Cuong Than
2023	J	`jnl`	Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	J	`jnl`	Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than
2023	A*	`conf`	Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. SoCG Hung Le, Lazar Milenkovic, Shay Solomon
2022	A*	`conf`	Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. PODC Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2022	A	`conf`	Dynamic Matching Algorithms Under Vertex Updates. ITCS Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams
2022	J	`jnl`	Fully Dynamic (Δ +1)-Coloring in ACM Trans. Algorithms Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
2022	—	`conf`	Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. SOSA Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
2022	A	`conf`	Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. ITCS Shiri Antaki, Quanquan C. Liu, Shay Solomon
2022	A*	`conf`	Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. SODA Hung Le, Shay Solomon
2022	A*	`conf`	Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. SoCG Hung Le, Lazar Milenkovic, Shay Solomon
2021	A	`conf`	A Generalized Matching Reconfiguration Problem. ITCS Noam Solomon, Shay Solomon
2021	J	`jnl`	A Unified Framework of Light Spanners II: Fine-Grained Optimality. CoRR Hung Le, Shay Solomon
2021	A	`conf`	Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. DISC Adir Morgan, Shay Solomon, Nicole Wein
2021	J	`jnl`	Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. CoRR Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon
2021	J	`jnl`	Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. ACM Trans. Parallel Comput. Haim Kaplan, Shay Solomon
2021	A	`conf`	Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. ESA Sepehr Assadi, Shay Solomon
2021	J	`jnl`	Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. CoRR Sepehr Assadi, Shay Solomon
2021	J	`jnl`	Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs. CoRR Shay Solomon
2021	J	`jnl`	Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. CoRR Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad
2021	J	`jnl`	Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. CoRR Hung Le, Shay Solomon
2021	J	`jnl`	Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs. CoRR Adir Morgan, Shay Solomon, Nicole Wein
2021	J	`jnl`	Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. CoRR Hung Le, Lazar Milenkovic, Shay Solomon
2021	J	`jnl`	Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions. CoRR Hung Le, Shay Solomon
2020	B	`conf`	A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. SPAA Lazar Milenkovic, Shay Solomon
2020	J	`jnl`	A Unified and Fine-Grained Approach for Light Spanners. CoRR Hung Le, Shay Solomon
2020	J	`jnl`	Dynamic Distributed MIS with Improved Bounds. CoRR Shiri Antaki, Quanquan C. Liu, Shay Solomon
2020	J	`jnl`	Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2020	J	`jnl`	Improved Dynamic Graph Coloring. ACM Trans. Algorithms Shay Solomon, Nicole Wein
2020	A	`conf`	Light Euclidean Spanners with Steiner Points. ESA Hung Le, Shay Solomon
2020	J	`jnl`	Light Euclidean Spanners with Steiner Points. CoRR Hung Le, Shay Solomon
2020	J	`jnl`	The Greedy Spanner Is Existentially Optimal. SIAM J. Comput. Arnold Filtser, Shay Solomon
2020	J	`jnl`	When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time. CoRR Sepehr Assadi, Shay Solomon
2019	A*	`conf`	(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon
2019	J	`jnl`	Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
2019	A*	`conf`	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2019	J	`jnl`	Improved Dynamic Graph Coloring. CoRR Shay Solomon, Nicole Wein
2019	A*	`conf`	Truly Optimal Euclidean Spanners. FOCS Hung Le, Shay Solomon
2019	J	`jnl`	Truly Optimal Euclidean Spanners. CoRR Hung Le, Shay Solomon
2019	A*	`conf`	When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. ICALP Sepehr Assadi, Shay Solomon
2018	J	`jnl`	Dynamic Approximate Matchings with an Optimal Recourse Bound. CoRR Shay Solomon
2018	B	`conf`	Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. SPAA Haim Kaplan, Shay Solomon
2018	A*	`conf`	Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. ICALP Moses Charikar, Shay Solomon
2018	A*	`conf`	Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2018	J	`jnl`	Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2018	J	`jnl`	Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	J	`jnl`	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	A*	`conf`	Fully dynamic maximal independent set with sublinear update time. STOC Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	A	`conf`	Improved Dynamic Graph Coloring. ESA Shay Solomon, Nicole Wein
2018	A	`conf`	Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs. ITCS Shay Solomon
2018	J	`jnl`	Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. CoRR Haim Kaplan, Shay Solomon
2018	B	`conf`	Wireless Expanders. SPAA Shirel Attali, Merav Parter, David Peleg, Shay Solomon
2018	J	`jnl`	Wireless Expanders. CoRR Shirel Attali, Merav Parter, David Peleg, Shay Solomon
2017	J	`jnl`	Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds. CoRR Moses Charikar, Shay Solomon
2016	A*	`conf`	Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. SODA David Peleg, Shay Solomon
2016	J	`jnl`	Fast Constructions of Lightweight Spanners for General Graphs. ACM Trans. Algorithms Michael Elkin, Shay Solomon
2016	A*	`conf`	Fully Dynamic Maximal Matching in Constant Update Time. FOCS Shay Solomon
2016	J	`jnl`	Fully Dynamic Maximal Matching in Constant Update Time. CoRR Shay Solomon
2016	A*	`conf`	Local-on-Average Distributed Tasks. SODA Merav Parter, David Peleg, Shay Solomon
2016	J	`jnl`	Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms Ofer Neiman, Shay Solomon
2016	A*	`conf`	The Greedy Spanner is Existentially Optimal. PODC Arnold Filtser, Shay Solomon
2016	J	`jnl`	The Greedy Spanner is Existentially Optimal. CoRR Arnold Filtser, Shay Solomon
2015	J	`jnl`	Euclidean Steiner shallow-light trees. J. Comput. Geom. Shay Solomon
2015	J	`jnl`	Light Spanners. SIAM J. Discret. Math. Michael Elkin, Ofer Neiman, Shay Solomon
2015	J	`jnl`	New Doubling Spanners: Better and Simpler. SIAM J. Comput. T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon
2015	J	`jnl`	Optimal Euclidean Spanners: Really Short, Thin, and Lanky. J. ACM Michael Elkin, Shay Solomon
2015	J	`jnl`	Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones. SIAM J. Comput. Michael Elkin, Shay Solomon
2014	J	`jnl`	Balancing Degree, Diameter, and Weight in Euclidean Spanners. SIAM J. Discret. Math. Shay Solomon, Michael Elkin
2014	A*	`conf`	Euclidean Steiner Shallow-Light Trees. SoCG Shay Solomon
2014	A*	`conf`	From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics. STOC Shay Solomon
2014	—	`conf`	Light Spanners. ICALP (1) Michael Elkin, Ofer Neiman, Shay Solomon
2014	J	`jnl`	Light Spanners. CoRR Michael Elkin, Ofer Neiman, Shay Solomon
2014	A*	`conf`	Light spanners for Snowflake Metrics. SoCG Lee-Ad Gottlieb, Shay Solomon
2014	J	`jnl`	Light spanners for snowflake metrics. CoRR Lee-Ad Gottlieb, Shay Solomon
2014	—	`conf`	On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. ANALCO Noam Solomon, Shay Solomon
2014	—	`conf`	Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon
2013	A*	`conf`	Fast Constructions of Light-Weight Spanners for General Graphs. SODA Michael Elkin, Shay Solomon
2013	J	`jnl`	From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics CoRR Shay Solomon
2013	—	`conf`	New Doubling Spanners: Better and Simpler. ICALP (1) T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon
2013	A*	`conf`	Optimal euclidean spanners: really short, thin and lanky. STOC Michael Elkin, Shay Solomon
2013	J	`jnl`	Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon
2013	A*	`conf`	Simple deterministic algorithms for fully dynamic maximal matching. STOC Ofer Neiman, Shay Solomon
2013	J	`jnl`	Sparse Euclidean Spanners with Tiny Diameter. ACM Trans. Algorithms Shay Solomon
2012	J	`jnl`	Deterministic Algorithms for Fully Dynamic Maximal Matching CoRR Ofer Neiman, Shay Solomon
2012	J	`jnl`	Fast Constructions of Light-Weight Spanners for General Graphs CoRR Michael Elkin, Shay Solomon
2012	J	`jnl`	Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler CoRR Shay Solomon
2012	J	`jnl`	Optimal Euclidean spanners: really short, thin and lanky CoRR Michael Elkin, Shay Solomon
2012	J	`jnl`	The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. SIAM J. Discret. Math. Shay Solomon
2012	J	`jnl`	The Tower of Hanoi problem on Path Discret. Appl. Math. Daniel Berend, Amir Sapir, Shay Solomon
2011	A*	`conf`	An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. SODA Shay Solomon
2011	J	`jnl`	Balancing Degree, Diameter and Weight in Euclidean Spanners CoRR Shay Solomon, Michael Elkin
2011	J	`jnl`	Narrow-Shallow-Low-Light Trees with and without Steiner Points. SIAM J. Discret. Math. Michael Elkin, Shay Solomon
2011	A*	`conf`	Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. FOCS Michael Elkin, Shay Solomon
2011	B	`conf`	The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. WADS Shay Solomon
2011	J	`jnl`	The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light CoRR Shay Solomon
2011	J	`jnl`	The Tower of Hanoi problem on Path CoRR Daniel Berend, Amir Sapir, Shay Solomon
2010	J	`jnl`	An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter CoRR Shay Solomon
2010	—	`conf`	Balancing Degree, Diameter and Weight in Euclidean Spanners. ESA (1) Shay Solomon, Michael Elkin
2010	J	`jnl`	Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discret. Comput. Geom. Yefim Dinitz, Michael Elkin, Shay Solomon
2009	A	`conf`	Narrow-Shallow-Low-Light Trees with and without Steiner Points. ESA Michael Elkin, Shay Solomon
2008	J	`jnl`	On an infinite family of solvable Hanoi graphs. ACM Trans. Algorithms Dany Azriel, Noam Solomon, Shay Solomon
2008	J	`jnl`	Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Trans. Algorithms Yefim Dinitz, Shay Solomon
2008	J	`jnl`	Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners CoRR Yefim Dinitz, Michael Elkin, Shay Solomon
2008	A*	`conf`	Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS Yefim Dinitz, Michael Elkin, Shay Solomon
2007	—	`conf`	On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) Yefim Dinitz, Shay Solomon
2006	B	`conf`	Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC Yefim Dinitz, Shay Solomon