
O(1) Steiner Point Removal in SeriesParallel Graphs
We study how to vertexsparsify a graph while preserving both the graph'...
read it

DistrictFair Participatory Budgeting
Participatory budgeting is a method used by city governments to select p...
read it

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
Embeddings of graphs into distributions of trees that preserve distances...
read it

Tree Embeddings for HopConstrained Network Design
Network design problems aim to compute lowcost structures such as route...
read it

An Optimal Rounding for HalfIntegral Weighted Minimum Strongly Connected Spanning Subgraph
In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
read it

NearOptimal Schedules for Simultaneous Multicasts
We study the storeandforward packet routing problem for simultaneous m...
read it

Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
In this paper we study how to optimally balance cheap inflexible resourc...
read it

Reverse Greedy is Bad for kCenter
We demonstrate that the reverse greedy algorithm is a Θ(k) approximation...
read it

A Computational Approach to Organizational Structure
An organizational structure defines how an organization arranges and man...
read it

Erasure Correction for Noisy Radio Networks
The radio network model is a wellstudied abstraction for modeling wirel...
read it

Round and MessageOptimal Distributed Graph Algorithms
Distributed graph algorithms that separately optimize for either the num...
read it

Round and MessageOptimal Distributed PartWise Aggregation
Distributed graph algorithms that separately optimize for either the num...
read it

Near Optimal Behavior via Approximate State Abstraction
The combinatorial explosion that plagues planning and reinforcement lear...
read it
D. Ellis Hershkowitz
is this you? claim profile