- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**A rapidly emerging design paradigm for large-scale optical fiber networks involves connecting clusters of nodes through a synchronous optical network (SONET) ring and building a network over these… Expand

In the edge-disjoint paths (EDP) problem, we are given a graph G and a set of source-sink pairs in G. The goal is connect as many pairs as possible in an edge-disjoint manner. This problem is NP-hard… Expand

We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to… Expand

A rapidly emerging design paradigm for large-scale optical fiber networks involves connecting clusters of nodes through a synchronous optical network (SONET) ring and building a network over these… Expand

We initiate a study of space-time tradeoos in the cell-probe model under restricted preprocessing power. Classically, space-time trade-oos have been studied in this model under the assumption that… Expand

We consider the well-studied problem of finding a perfect matching in $d$-regular bipartite graphs with $2n$ vertices and $m = nd$ edges. While the best-known algorithm for general bipartite graphs… Expand

We consider approximation algorithms for the metric labeling problem. This problem was introduced in a paper by Kleinberg and Tardos [26], and captures many classification problems t hat arise in… Expand

Suppose a graph G is stochastically created by uniformly sampling vertices along a line segment and connecting each pair of vertices with a probability that is a known decreasing function of their… Expand