`Travelled to:`

1 × Canada

1 × Greece

1 × Israel

1 × Italy

1 × Latvia

1 × Switzerland

1 × USA

`Collaborated with:`

O.Weimann U.Zwick V.Vassilevska R.Williams N.Alon D.Hermelin A.Levy

`Talks about:`

graph (6) time (3) find (3) subgraph (2) planar (2) path (2) even (2) cycl (2) bottleneck (1) smallest (1)

## Person: Raphael Yuster

### DBLP: Yuster:Raphael

### Contributed to:

### Wrote 7 papers:

- ICALP-v1-2013-WeimannY #approximate #graph #linear
- Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.
- ICALP-v2-2011-HermelinLWY #distance #graph
- Distance Oracles for Vertex-Labeled Graphs (DH, AL, OW, RY), pp. 490–501.
- ICALP-v1-2009-WeimannY #graph
- Computing the Girth of a Planar Graph in O(n logn) Time (OW, RY), pp. 764–773.
- STOC-2007-VassilevskaWY #graph
- All-pairs bottleneck paths for general graphs in truly sub-cubic time (VV, RW, RY), pp. 585–589.
- ICALP-v1-2006-VassilevskaWY #graph #problem
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
- ICALP-1994-YusterZ #performance
- Finding Even Cycles Even Faster (RY, UZ), pp. 532–543.
- STOC-1994-AlonYZ #graph #named #scalability
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (NA, RY, UZ), pp. 326–335.