
Vertex FaultTolerant Emulators
A kspanner of a graph G is a sparse subgraph that preserves its shortes...
read it

Faster Matchings via Learned Duals
A recent line of research investigates how algorithms can be augmented w...
read it

Fair Disaster Containment via GraphCut Problems
Graph cut problems form a fundamental problem type in combinatorial opti...
read it

Partially Optimal Edge FaultTolerant Spanners
Recent work has established that, for every positive integer k, every n...
read it

Optimal Vertex FaultTolerant Spanners in Polynomial Time
Recent work has pinned down the existentially optimal size bounds for ve...
read it

Efficient and Simple Algorithms for Fault Tolerant Spanners
It was recently shown that a version of the greedy algorithm gives a con...
read it

Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
New optical technologies offer the ability to reconfigure network topolo...
read it

The Capacity of Smartphone PeertoPeer Networks
We study three capacity problems in the mobile telephone model, a networ...
read it

Lasserre Integrality Gaps for Graph Spanners and Related Problems
There has been significant recent progress on algorithms for approximati...
read it

The Norms of Graph Spanners
A tspanner of a graph G is a subgraph H in which all distances are pres...
read it

Policy Regret in Repeated Games
The notion of policy regret in online learning is a well defined? perfor...
read it

Distributed Approximate Distance Oracles
Data structures that allow efficient distance estimation (distance oracl...
read it

Distributed Algorithms for Minimum Degree Spanning Trees
The minimum degree spanning tree (MDST) problem requires the constructio...
read it

Characterizing Demand Graphs for (FixedParameter) ShallowLight Steiner Network
We consider the ShallowLight Steiner Network problem from a fixedparam...
read it
Michael Dinitz
is this you? claim profile