default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShay Solomon
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c59]Anton Bukov, Shay Solomon, Tianyi Zhang:
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. SODA 2025: 824-863- [c58]Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang:
Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. SODA 2025: 4914-4947 - 2024
- [c57]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. SoCG 2024: 37:1-37:15 - [c56]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. ESA 2024: 23:1-23:18 - [c55]Shay Solomon, Amitai Uzrad, Tianyi Zhang:
A Lossless Deamortization for Dynamic Greedy Set Cover. FOCS 2024: 264-290 - [c54]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. FOCS 2024: 1579-1609 - [c53]Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang:
Faster (Δ+1)-Edge Coloring: Breaking the m√n Time Barrier. FOCS 2024: 2186-2201 - [c52]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. SODA 2024: 3393-3440 - [c51]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA 2024: 5300-5331 - [c50]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Arboricity-Dependent Algorithms for Edge Coloring. SWAT 2024: 12:1-12:15 - [i53]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. CoRR abs/2403.17754 (2024) - [i52]Sayan Bhattacharya, Din Carmon, Martín Costa, Shay Solomon, Tianyi Zhang:
Faster (Δ + 1)-Edge Coloring: Breaking the m √n Time Barrier. CoRR abs/2405.15449 (2024) - [i51]Shay Solomon, Amitai Uzrad, Tianyi Zhang:
A Lossless Deamortization for Dynamic Greedy Set Cover. CoRR abs/2407.06431 (2024) - [i50]Hung Le, Shay Solomon, Cuong Than, Csaba D. Tóth, Tianyi Zhang:
Towards Instance-Optimal Euclidean Spanners. CoRR abs/2409.08227 (2024) - [i49]Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang:
Vizing's Theorem in Near-Linear Time. CoRR abs/2410.05240 (2024) - [i48]Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang:
Even Faster (Δ + 1)-Edge Coloring via Shorter Multi-Step Vizing Chains. CoRR abs/2410.12479 (2024) - 2023
- [c49]Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function. SoCG 2023: 47:1-47:17 - [c48]Hung Le, Shay Solomon, Cuong Than:
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier. FOCS 2023: 77-97 - [c47]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS 2023: 2231-2261 - [c46]Hung Le, Shay Solomon:
A Unified Framework for Light Spanners. STOC 2023: 295-308 - [c45]Shay Solomon, Amitai Uzrad:
Dynamic ((1+ε) ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. STOC 2023: 1187-1200 - [i47]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR abs/2306.06215 (2023) - [i46]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR abs/2306.06235 (2023) - [i45]Hung Le, Shay Solomon, Cuong Than:
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω(log n) Lightness Barrier. CoRR abs/2306.11226 (2023) - [i44]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Density-Sensitive Algorithms for (Δ+1)-Edge Coloring. CoRR abs/2307.02415 (2023) - [i43]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR abs/2308.00555 (2023) - [i42]Anton Bukov, Shay Solomon, Tianyi Zhang:
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier. CoRR abs/2308.00793 (2023) - [i41]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time. CoRR abs/2311.03267 (2023) - [i40]Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:
Arboricity-Dependent Algorithms for Edge Coloring. CoRR abs/2311.08367 (2023) - [i39]Shay Solomon, Amitai Uzrad:
Dynamic ((1+ε)ln n)-Approximation Algorithms for Minimum Set Cover and Dominating Set. CoRR abs/2312.17625 (2023) - 2022
- [j20]Sayan Bhattacharya, Fabrizio Grandoni
, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. ACM Trans. Algorithms 18(2): 10:1-10:25 (2022) - [c44]Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. SoCG 2022: 54:1-54:15 - [c43]Shiri Antaki, Quanquan C. Liu, Shay Solomon:
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. ITCS 2022: 7:1-7:25 - [c42]Hung Le, Lazar Milenkovic, Shay Solomon, Virginia Vassilevska Williams:
Dynamic Matching Algorithms Under Vertex Updates. ITCS 2022: 96:1-96:24 - [c41]Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon:
Can't See the Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. PODC 2022: 151-162 - [c40]Hung Le, Shay Solomon:
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. SODA 2022: 3332-3361 - [c39]Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. SOSA 2022: 12-23 - 2021
- [j19]Haim Kaplan, Shay Solomon:
Dynamic Representations of Sparse Distributed Networks: A Locality-sensitive Approach. ACM Trans. Parallel Comput. 8(1): 5:1-5:26 (2021) - [c38]Sepehr Assadi, Shay Solomon:
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. ESA 2021: 8:1-8:18 - [c37]Noam Solomon, Shay Solomon:
A Generalized Matching Reconfiguration Problem. ITCS 2021: 57:1-57:20 - [c36]Adir Morgan, Shay Solomon, Nicole Wein:
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. DISC 2021: 33:1-33:19 - [i38]Adir Morgan, Shay Solomon, Nicole Wein:
Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs. CoRR abs/2102.10077 (2021) - [i37]Shay Solomon:
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs. CoRR abs/2105.02084 (2021) - [i36]Sepehr Assadi, Shay Solomon:
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. CoRR abs/2105.06889 (2021) - [i35]Hung Le, Shay Solomon:
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions. CoRR abs/2106.15596 (2021) - [i34]Omri Kahalon, Hung Le, Lazar Milenkovic, Shay Solomon:
Can't See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners. CoRR abs/2107.14221 (2021) - [i33]Hung Le, Shay Solomon:
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time. CoRR abs/2108.00102 (2021) - [i32]Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad:
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. CoRR abs/2108.08825 (2021) - [i31]Hung Le, Shay Solomon:
A Unified Framework of Light Spanners II: Fine-Grained Optimality. CoRR abs/2111.13748 (2021) - [i30]Hung Le, Lazar Milenkovic, Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound. CoRR abs/2112.09124 (2021) - 2020
- [j18]Arnold Filtser, Shay Solomon:
The Greedy Spanner Is Existentially Optimal. SIAM J. Comput. 49(2): 429-447 (2020) - [j17]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16(2): 26:1-26:19 (2020) - [j16]Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. ACM Trans. Algorithms 16(3): 41:1-41:24 (2020) - [c35]Hung Le, Shay Solomon:
Light Euclidean Spanners with Steiner Points. ESA 2020: 67:1-67:22 - [c34]Lazar Milenkovic, Shay Solomon:
A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence. SPAA 2020: 395-406 - [i29]Sepehr Assadi, Shay Solomon:
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time. CoRR abs/2006.07628 (2020) - [i28]Hung Le, Shay Solomon:
Light Euclidean Spanners with Steiner Points. CoRR abs/2007.11636 (2020) - [i27]Hung Le, Shay Solomon:
A Unified and Fine-Grained Approach for Light Spanners. CoRR abs/2008.10582 (2020) - [i26]Shiri Antaki, Quanquan C. Liu, Shay Solomon:
Dynamic Distributed MIS with Improved Bounds. CoRR abs/2010.16177 (2020)
2010 – 2019
- 2019
- [c33]Hung Le, Shay Solomon:
Truly Optimal Euclidean Spanners. FOCS 2019: 1078-1100 - [c32]Sepehr Assadi, Shay Solomon:
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. ICALP 2019: 17:1-17:17 - [c31]Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon:
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time. SODA 2019: 1886-1898 - [c30]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA 2019: 1919-1936 - [i25]Hung Le, Shay Solomon:
Truly Optimal Euclidean Spanners. CoRR abs/1904.12042 (2019) - [i24]Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. CoRR abs/1904.12427 (2019) - [i23]Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR abs/1910.02063 (2019) - 2018
- [c29]Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. ESA 2018: 72:1-72:16 - [c28]Moses Charikar, Shay Solomon:
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. ICALP 2018: 33:1-33:14 - [c27]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP 2018: 92:1-92:14 - [c26]Shay Solomon:
Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs. ITCS 2018: 52:1-52:19 - [c25]Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. SPAA 2018: 13-22 - [c24]Haim Kaplan, Shay Solomon:
Dynamic Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. SPAA 2018: 33-42 - [c23]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully dynamic maximal independent set with sublinear update time. STOC 2018: 815-826 - [i22]Shirel Attali, Merav Parter, David Peleg, Shay Solomon:
Wireless Expanders. CoRR abs/1802.07177 (2018) - [i21]Haim Kaplan, Shay Solomon:
Representations of Sparse Distributed Networks: A Locality-Sensitive Approach. CoRR abs/1802.09515 (2018) - [i20]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR abs/1802.09709 (2018) - [i19]Shay Solomon:
Dynamic Approximate Matchings with an Optimal Recourse Bound. CoRR abs/1803.05825 (2018) - [i18]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR abs/1806.10051 (2018) - [i17]Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR abs/1808.10316 (2018) - 2017
- [i16]Moses Charikar, Shay Solomon:
Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Barrier for Worst-Case Time Bounds. CoRR abs/1711.06883 (2017) - 2016
- [j15]Ofer Neiman, Shay Solomon:
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms 12(1): 7:1-7:15 (2016) - [j14]Michael Elkin, Shay Solomon:
Fast Constructions of Lightweight Spanners for General Graphs. ACM Trans. Algorithms 12(3): 29:1-29:21 (2016) - [c22]Shay Solomon:
Fully Dynamic Maximal Matching in Constant Update Time. FOCS 2016: 325-334 - [c21]Arnold Filtser, Shay Solomon:
The Greedy Spanner is Existentially Optimal. PODC 2016: 9-17 - [c20]Merav Parter, David Peleg, Shay Solomon:
Local-on-Average Distributed Tasks. SODA 2016: 220-239 - [c19]David Peleg, Shay Solomon:
Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach. SODA 2016: 712-729 - [i15]Shay Solomon:
Fully Dynamic Maximal Matching in Constant Update Time. CoRR abs/1604.08491 (2016) - [i14]Arnold Filtser, Shay Solomon:
The Greedy Spanner is Existentially Optimal. CoRR abs/1605.06852 (2016) - 2015
- [j13]Michael Elkin, Shay Solomon:
Optimal Euclidean Spanners: Really Short, Thin, and Lanky. J. ACM 62(5): 35:1-35:45 (2015) - [j12]Shay Solomon:
Euclidean Steiner shallow-light trees. J. Comput. Geom. 6(2): 113-139 (2015) - [j11]T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. SIAM J. Comput. 44(1): 37-53 (2015) - [j10]Michael Elkin, Shay Solomon:
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones. SIAM J. Comput. 44(4): 996-1025 (2015) - [j9]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. SIAM J. Discret. Math. 29(3): 1312-1321 (2015) - 2014
- [j8]Shay Solomon, Michael Elkin:
Balancing Degree, Diameter, and Weight in Euclidean Spanners. SIAM J. Discret. Math. 28(3): 1173-1198 (2014) - [c18]Noam Solomon, Shay Solomon:
On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. ANALCO 2014: 104-112 - [c17]Lee-Ad Gottlieb, Shay Solomon:
Light spanners for Snowflake Metrics. SoCG 2014: 387 - [c16]Shay Solomon:
Euclidean Steiner Shallow-Light Trees. SoCG 2014: 454 - [c15]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. ICALP (1) 2014: 442-452 - [c14]Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) 2014: 532-543 - [c13]Shay Solomon:
From hierarchical partitions to hierarchical covers: optimal fault-tolerant spanners for doubling metrics. STOC 2014: 363-372 - [i13]Lee-Ad Gottlieb, Shay Solomon:
Light spanners for snowflake metrics. CoRR abs/1401.5014 (2014) - [i12]Michael Elkin, Ofer Neiman, Shay Solomon:
Light Spanners. CoRR abs/1404.7703 (2014) - 2013
- [j7]Shay Solomon:
Sparse Euclidean Spanners with Tiny Diameter. ACM Trans. Algorithms 9(3): 28:1-28:33 (2013) - [c12]T.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon:
New Doubling Spanners: Better and Simpler. ICALP (1) 2013: 315-327 - [c11]Michael Elkin, Shay Solomon:
Fast Constructions of Light-Weight Spanners for General Graphs. SODA 2013: 513-525 - [c10]Michael Elkin, Shay Solomon:
Optimal euclidean spanners: really short, thin and lanky. STOC 2013: 645-654 - [c9]Ofer Neiman, Shay Solomon:
Simple deterministic algorithms for fully dynamic maximal matching. STOC 2013: 745-754 - [i11]Shay Solomon:
From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics. CoRR abs/1304.8135 (2013) - [i10]Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR abs/1312.1382 (2013) - 2012
- [j6]Daniel Berend, Amir Sapir, Shay Solomon:
The Tower of Hanoi problem on Pathh graphs. Discret. Appl. Math. 160(10-11): 1465-1483 (2012) - [j5]Shay Solomon:
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. SIAM J. Discret. Math. 26(1): 250-262 (2012) - [i9]Ofer Neiman, Shay Solomon:
Deterministic Algorithms for Fully Dynamic Maximal Matching. CoRR abs/1207.1277 (2012) - [i8]Michael Elkin, Shay Solomon:
Fast Constructions of Light-Weight Spanners for General Graphs. CoRR abs/1207.1668 (2012) - [i7]Michael Elkin, Shay Solomon:
Optimal Euclidean spanners: really short, thin and lanky. CoRR abs/1207.1831 (2012) - [i6]Shay Solomon:
Fault-Tolerant Spanners for Doubling Metrics: Better and Simpler. CoRR abs/1207.7040 (2012) - 2011
- [j4]Michael Elkin, Shay Solomon:
Narrow-Shallow-Low-Light Trees with and without Steiner Points. SIAM J. Discret. Math. 25(1): 181-210 (2011) - [c8]Michael Elkin, Shay Solomon:
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. FOCS 2011: 373-382 - [c7]Shay Solomon:
An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. SODA 2011: 820-839 - [c6]Shay Solomon:
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light. WADS 2011: 691-702 - [i5]Shay Solomon:
The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light. CoRR abs/1102.4866 (2011) - [i4]Daniel Berend, Amir Sapir, Shay Solomon:
The Tower of Hanoi problem on Pathh graphs. CoRR abs/1102.4885 (2011) - [i3]Shay Solomon, Michael Elkin:
Balancing Degree, Diameter and Weight in Euclidean Spanners. CoRR abs/1108.6022 (2011) - 2010
- [j3]Yefim Dinitz, Michael Elkin, Shay Solomon:
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. Discret. Comput. Geom. 43(4): 736-783 (2010) - [c5]Shay Solomon, Michael Elkin:
Balancing Degree, Diameter and Weight in Euclidean Spanners. ESA (1) 2010: 48-59 - [i2]Shay Solomon:
An Optimal-Time Construction of Euclidean Sparse Spanners with Tiny Diameter. CoRR abs/1005.4155 (2010)
2000 – 2009
- 2009
- [c4]Michael Elkin, Shay Solomon:
Narrow-Shallow-Low-Light Trees with and without Steiner Points. ESA 2009: 215-226 - 2008
- [j2]Yefim Dinitz, Shay Solomon:
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Trans. Algorithms 4(3): 25:1-25:9 (2008) - [j1]Dany Azriel, Noam Solomon, Shay Solomon:
On an infinite family of solvable Hanoi graphs. ACM Trans. Algorithms 5(1): 13:1-13:22 (2008) - [c3]Yefim Dinitz, Michael Elkin, Shay Solomon:
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS 2008: 519-528 - [i1]Yefim Dinitz, Michael Elkin, Shay Solomon:
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners. CoRR abs/0801.3581 (2008) - 2007
- [c2]Yefim Dinitz, Shay Solomon:
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259 - 2006
- [c1]Yefim Dinitz, Shay Solomon:
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC 2006: 36-47
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-29 21:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
