We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Storyboards are commonly known as rows of pictures, which exemplarily sketch scenes in performing arts. The rows specify the sequence of scenes. The scenes themselves are illustra...
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...