7 citations · 7 across the 4 of their papers we have counts for
4 papers
On Vertex Rankings of Graphs and its Relatives
Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must conta…
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators
Michael Elkin, Ofer Neiman
Miller et al. \cite{MPVX15} devised a distributed\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \cite{MPVX15}.} alg…
Prioritized Metric Structures and Embedding
Michael Elkin, Arnold Filtser, Ofer Neiman
Metric data structures (distance oracles, distance labeling schemes, routing schemes) and low-distortion embeddings provide a powerful algorithmic methodology, which has been succe…
Light Spanners
Michael Elkin, Ofer Neiman, Shay Solomon
A -spanner of a weighted undirected graph , is a subgraph such that for all . The sparseness of the spanner can be measured…