Travelled to:1 × Austria
1 × Italy
2 × Canada
7 × USA
Collaborated with:U.V.Vazirani S.Arora K.Talwar P.N.Klein S.Zhou W.D.Smith ∅ B.M.Maggs Y.T.Lee N.Srivastava R.Khandekar E.Amir R.Krauthgamer J.Fakcharoenphol P.Raghavan I.J.Cox Y.Zhong S.A.Plotkin K.Chaudhuri S.Riesenfeld M.R.Henzinger S.Subramanian W.Aiello B.Awerbuch R.R.Koch F.T.Leighton A.L.Rosenberg
Talks about:graph (7) approxim (6) flow (5) algorithm (3) network (3) planar (3) geometr (2) connect (2) partit (2) metric (2)
Person: Satish Rao
DBLP: Rao:Satish
Contributed to:
2013
20062006200420031998
19961994199319921989Wrote 15 papers:
- STOC-2013-LeeRS #approach #using
- A new approach to computing maximum flows using electrical flows (YTL, SR, NS), pp. 755–764.
- ICALP-v1-2006-ChaudhuriRRT #algorithm #approximate #bound
- A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.
- ICALP-v1-2006-RaoZ #graph
- Edge Disjoint Paths in Moderately Connected Graphs (SR, SZ), pp. 202–213.
- STOC-2006-KhandekarRV #clustering #graph #using
- Graph partitioning using single commodity flows (RK, SR, UVV), pp. 385–390.
- STOC-2004-AroraRV #clustering #geometry #graph
- Expander flows, geometric embeddings and graph partitioning (SA, SR, UVV), pp. 222–231.
- STOC-2003-AmirKR #approximate #constant #graph
- Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.
- STOC-2003-FakcharoenpholRT #approximate #bound #metric
- A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.
- STOC-1998-AroraRR #approximate #problem
- Approximation Schemes for Euclidean k-Medians and Related Problems (SA, PR, SR), pp. 106–113.
- STOC-1998-RaoS #approximate #geometry #graph
- Approximating Geometrical Graphs via “Spanners” and “Banyans” (SR, WDS), pp. 540–550.
- ICPR-1996-CoxRZ #image #quote #segmentation
- “Ratio regions”: a technique for image segmentation (IJC, SR, YZ), pp. 557–564.
- STOC-1994-KleinRRS #algorithm #graph #performance
- Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.
- STOC-1993-AielloAMR #approximate #network
- Approximate load balancing on dynamic and asynchronous networks (WA, BA, BMM, SR), pp. 632–641.
- STOC-1993-KleinPR #composition #multi #network
- Excluded minors, network decomposition, and multicommodity flow (PNK, SAP, SR), pp. 682–690.
- STOC-1992-Rao #algorithm #graph #performance
- Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (SR), pp. 229–240.
- STOC-1989-KochLMRR #network
- Work-Preserving Emulations of Fixed-Connection Networks (RRK, FTL, BMM, SR, ALR), pp. 227–240.