Metric Embeddings with Relaxed Guarantees. - Ittai Abraham; Yair Bartal; T.-H. Hubert Chan; Kedar Dhamdhere; Anupam Gupta 001; Jon M. Kleinberg; Ofer Neiman; Aleksandrs Slivkins (FOCS, 2005)

Advances in metric embedding theory. - Ittai Abraham; Yair Bartal; Ofer Neiman (STOC, 2006)

Nearly Tight Low Stretch Spanning Trees. - Ittai Abraham; Yair Bartal; Ofer Neiman (FOCS, 2008)

Embedding metric spaces in their intrinsic dimension. - Ittai Abraham; Yair Bartal; Ofer Neiman (SODA, 2008)

On low dimensional local embeddings. - Ittai Abraham; Yair Bartal; Ofer Neiman (SODA, 2009)

A novel approach to embedding of metric spaces (גישה חדשה לשיכונים של מרחבים מטריים.). - Ofer Neiman (2009)

Near Linear Lower Bound for Dimension Reduction in L1. - Alexandr Andoni; Moses Charikar; Ofer Neiman; Huy L. Nguyen (FOCS, 2011)

Dynamic Inefficiency: Anarchy without Stability. - Noam Berger; Michal Feldman; Ofer Neiman; Mishael Rosenthal (SAGT, 2011)

Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. - Alantha Newman; Ofer Neiman; Aleksandar Nikolov (FOCS, 2012)

Deterministic Algorithms for Fully Dynamic Maximal Matching - Ofer Neiman; Shay Solomon (CoRR, 2012)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp, p>2. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (CoRR, 2013)

Bandwidth and low dimensional embedding. - Yair Bartal; Douglas E. Carroll; Adam Meyerson; Ofer Neiman (Theor. Comput. Sci., 2013)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (SoCG, 2014)

Volume in General Metric Spaces. - Ittai Abraham; Yair Bartal; Ofer Neiman; Leonard J. Schulman (Discret. Comput. Geom., 2014)

Local Embeddings of Metric Spaces. - Ittai Abraham; Yair Bartal; Ofer Neiman (Algorithmica, 2015)

On vertex rankings of graphs and its relatives. - Ilan Karpas; Ofer Neiman; Shakhar Smorodinsky (Discret. Math., 2015)

Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. - Ittai Abraham; Yair Bartal; Ofer Neiman (SIAM J. Comput., 2015)

On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. - Yair Bartal; Lee-Ad Gottlieb; Ofer Neiman (SIAM J. Discret. Math., 2015)

Light Spanners. - Michael Elkin; Ofer Neiman; Shay Solomon (SIAM J. Discret. Math., 2015)

Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost. - Alexandr Andoni; Assaf Naor; Ofer Neiman (ICALP, 2016)

Distributed Strong Diameter Network Decomposition: Extended Abstract. - Michael Elkin; Ofer Neiman (PODC, 2016)

On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract. - Michael Elkin; Ofer Neiman (PODC, 2016)

Low Dimensional Embeddings of Doubling Metrics. - Ofer Neiman (Theory Comput. Syst., 2016)

Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. - Ofer Neiman; Shay Solomon (ACM Trans. Algorithms, 2016)

Space-efficient path-reporting approximate distance oracles. - Michael Elkin; Ofer Neiman; Christian Wulff-Nilsen (Theor. Comput. Sci., 2016)

Spanning Trees with Low Average Stretch. - Ittai Abraham; Ofer Neiman (Encyclopedia of Algorithms, 2016)

Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory. - Michael Elkin; Ofer Neiman (CoRR, 2017)

Terminal embeddings. - Michael Elkin; Arnold Filtser; Ofer Neiman (Theor. Comput. Sci., 2017)

Near-Optimal Distributed Routing with Low Memory. - Michael Elkin; Ofer Neiman (PODC, 2018)

On efficient distributed construction of near optimal routing schemes. - Michael Elkin; Ofer Neiman (Distributed Comput., 2018)

Prioritized Metric Structures and Embedding. - Michael Elkin; Arnold Filtser; Ofer Neiman (SIAM J. Comput., 2018)

Dimensionality reduction: theoretical perspective on practical measures. - Yair Bartal; Nova Fandina; Ofer Neiman (NeurIPS, 2019)

Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs. - Michael Elkin; Yuval Gitlitz; Ofer Neiman (CoRR, 2019)

On notions of distortion and an almost minimum spanning tree with constant average distortion. - Yair Bartal; Arnold Filtser; Ofer Neiman (J. Comput. Syst. Sci., 2019)

Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. - Ittai Abraham; Cyril Gavoille; Anupam Gupta 001; Ofer Neiman; Kunal Talwar (SIAM J. Comput., 2019)

Using Petal-Decompositions to Build a Low Stretch Spanning Tree. - Ittai Abraham; Ofer Neiman (SIAM J. Comput., 2019)

Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. - Michael Elkin; Ofer Neiman (SIAM J. Comput., 2019)

Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. - Michael Elkin; Ofer Neiman (ACM Trans. Algorithms, 2019)

Distributed Construction of Light Networks. - Michael Elkin; Arnold Filtser; Ofer Neiman (PODC, 2020)

Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication. - Michael Elkin; Ofer Neiman (CoRR, 2020)

Near-Additive Spanners and Near-Exact Hopsets, A Unified View. - Michael Elkin; Ofer Neiman (Bull. EATCS, 2020)

Ramsey Spanning Trees and Their Applications. - Ittai Abraham; Shiri Chechik; Michael Elkin; Arnold Filtser; Ofer Neiman (ACM Trans. Algorithms, 2020)

Near Isometric Terminal Embeddings for Doubling Metrics. - Michael Elkin; Ofer Neiman (Algorithmica, 2021)

A Unified Framework for Hopsets and Spanners. - Idan Shabat; Ofer Neiman (CoRR, 2021)

A Unified Framework for Hopsets. - Ofer Neiman; Idan Shabat (ESA, 2022)

Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. - Michael Elkin; Ofer Neiman (STACS, 2022)

Almost Shortest Paths with Near-Additive Error in Weighted Graphs. - Michael Elkin; Yuval Gitlitz; Ofer Neiman (SWAT, 2022)

Light Spanners for High Dimensional Norms via Stochastic Decompositions. - Arnold Filtser; Ofer Neiman (Algorithmica, 2022)

Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC. - Michael Elkin; Ofer Neiman (Distributed Comput., 2022)

Covering metric spaces by few trees. - Yair Bartal; Ora Nova Fandina; Ofer Neiman (J. Comput. Syst. Sci., 2022)

Metric Embedding via Shortest Path Decompositions. - Ittai Abraham; Arnold Filtser; Anupam Gupta 001; Ofer Neiman (SIAM J. Comput., 2022)

Lossless Prioritized Embeddings. - Michael Elkin; Ofer Neiman (SIAM J. Discret. Math., 2022)

Distributed strong diameter network decomposition. - Michael Elkin; Ofer Neiman (Theor. Comput. Sci., 2022)

Improved weighted additive spanners. - Michael Elkin; Yuval Gitlitz; Ofer Neiman (Distributed Comput., 2023)

Corrigendum: Metric Embedding via Shortest Path Decompositions. - Ittai Abraham; Arnold Filtser; Anupam Gupta 001; Ofer Neiman (SIAM J. Comput., 2023)

Light, Reliable Spanners. - Arnold Filtser; Yuval Gitlitz; Ofer Neiman (SoCG, 2024)

On the Size Overhead of Pairwise Spanners. - Ofer Neiman; Idan Shabat (ITCS, 2024)

Path-Reporting Distance Oracles with Linear Size. - Ofer Neiman; Idan Shabat (SWAT, 2024)

Lightweight Near-Additive Spanners. - Yuval Gitlitz; Ofer Neiman; Richard Spence (WG, 2024)