The following pages link to Michael Dinitz (Q748115):
Displaying 49 items.
- Efficient distributed computation of distance sketches in networks (Q748116) (← links)
- Lasserre integrality gaps for graph spanners and related problems (Q2117692) (← links)
- Approximate Moore graphs are good expanders (Q2284745) (← links)
- Explicit expanding expanders (Q2408170) (← links)
- (Q2830866) (← links)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner (Q2843256) (← links)
- Fault-tolerant spanners (Q2943394) (← links)
- (Q2969610) (← links)
- (Q2969613) (← links)
- (Q3094552) (← links)
- iBGP and Constrained Connectivity (Q3167390) (← links)
- The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
- Distributed Distance-Bounded Network Design Through Distributed Convex Programming (Q3300803) (← links)
- Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics (Q3540227) (← links)
- Improved Approximation Algorithm for Steiner <i>k</i> -Forest with Nearly Uniform Weights (Q4554929) (← links)
- Approximating Low-Stretch Spanners (Q4575638) (← links)
- Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds (Q4575771) (← links)
- Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion (Q4575795) (← links)
- Optimal Vertex Fault Tolerant Spanners (for fixed stretch) (Q4608012) (← links)
- (Q4633940) (← links)
- Computing approximate PSD factorizations (Q4636432) (← links)
- The Densest k-Subhypergraph Problem (Q4636436) (← links)
- (Q4638107) (← links)
- (Q4681982) (← links)
- Packing Interdiction and Partial Covering Problems (Q4910813) (← links)
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i> -Spanner (Q4962219) (← links)
- Approximating Spanners and Directed Steiner Forest (Q4987451) (← links)
- (Q5002788) (← links)
- (Q5009641) (← links)
- (Q5090972) (← links)
- (Q5091190) (← links)
- Distributed Minimum Degree Spanning Trees (Q5145263) (← links)
- Matroid Secretary for Regular and Decomposable Matroids (Q5173256) (← links)
- Towards Resistance Sparsifiers (Q5351932) (← links)
- Compact routing with slack (Q5401396) (← links)
- Directed spanners via flow-based linear programs (Q5419102) (← links)
- Spanners with Slack (Q5449528) (← links)
- Full Rank Tilings of Finite Abelian Groups (Q5470824) (← links)
- Efficient and Simple Algorithms for Fault-Tolerant Spanners (Q5854057) (← links)
- (Q5874270) (← links)
- (Q5875462) (← links)
- Smoothed analysis of dynamic networks (Q5915695) (← links)
- (Q6126251) (← links)
- Reception capacity: definitions, game theory and hardness (Q6536157) (← links)
- Improved approximations for relative survivable network design (Q6574948) (← links)
- Partially optimal edge fault-tolerant spanners (Q6575210) (← links)
- Relative survivable network design (Q6591894) (← links)
- Epic fail: emulators can tolerate polynomially many edge faults for free (Q6610282) (← links)
- Controlling tail risk in online ski-rental (Q6645516) (← links)
