Ofer Neiman

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 68

Top Venues

Publications

Ofer Neiman, Idan Shabat
Path-Reporting Distance Oracles with Linear Size. SWAT (2024)
Ofer Neiman, Idan Shabat
Path-Reporting Distance Oracles with Linear Size. CoRR (2024)
Arnold Filtser, Yuval Gitlitz, Ofer Neiman
Light, Reliable Spanners. SoCG (2024)
Ofer Neiman, Idan Shabat
On the Size Overhead of Pairwise Spanners. ITCS (2024)
Ofer Neiman, Idan Shabat
On the Size Overhead of Pairwise Spanners. CoRR (2023)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52 (5) (2023)
Arnold Filtser, Yuval Gitlitz, Ofer Neiman
Light, Reliable Spanners. CoRR (2023)
Michael Elkin, Yuval Gitlitz, Ofer Neiman
Improved weighted additive spanners. Distributed Comput. 36 (3) (2023)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 51 (2) (2022)
Michael Elkin, Ofer Neiman
Lossless Prioritized Embeddings. SIAM J. Discret. Math. 36 (3) (2022)
Michael Elkin, Ofer Neiman
Distributed strong diameter network decomposition. Theor. Comput. Sci. 922 (2022)
Michael Elkin, Ofer Neiman
Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC. Distributed Comput. 35 (5) (2022)
Arnold Filtser, Ofer Neiman
Light Spanners for High Dimensional Norms via Stochastic Decompositions. Algorithmica 84 (10) (2022)
Michael Elkin, Ofer Neiman
Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication. STACS (2022)
Yair Bartal, Ora Nova Fandina, Ofer Neiman
Covering metric spaces by few trees. J. Comput. Syst. Sci. 130 (2022)
Ofer Neiman, Idan Shabat
A Unified Framework for Hopsets. ESA (2022)
Michael Elkin, Yuval Gitlitz, Ofer Neiman
Almost Shortest Paths with Near-Additive Error in Weighted Graphs. SWAT (2022)
Idan Shabat, Ofer Neiman
A Unified Framework for Hopsets and Spanners. CoRR (2021)
Michael Elkin, Yuval Gitlitz, Ofer Neiman
Improved Weighted Additive Spanners. DISC (2021)
Michael Elkin, Ofer Neiman
Near Isometric Terminal Embeddings for Doubling Metrics. Algorithmica 83 (11) (2021)
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms 16 (2) (2020)
Michael Elkin, Ofer Neiman
Centralized and Parallel Multi-Source Shortest Paths via Hopsets and Fast Matrix Multiplication. CoRR (2020)
Michael Elkin, Ofer Neiman
Near-Additive Spanners and Near-Exact Hopsets, A Unified View. Bull. EATCS 130 (2020)
Michael Elkin, Ofer Neiman
Lossless Prioritized Embeddings. SODA (2020)
Michael Elkin, Arnold Filtser, Ofer Neiman
Distributed Construction of Light Networks. PODC (2020)
Michael Elkin, Yuval Gitlitz, Ofer Neiman
Improved Weighted Additive Spanners. CoRR (2020)
Michael Elkin, Ofer Neiman
Near-Additive Spanners and Near-Exact Hopsets, A Unified View. CoRR (2020)
Yair Bartal, Nova Fandina, Ofer Neiman
Dimensionality reduction: theoretical perspective on practical measures. NeurIPS (2019)
Michael Elkin, Ofer Neiman
Lossless Prioritized Embeddings. CoRR (2019)
Michael Elkin, Arnold Filtser, Ofer Neiman
Distributed Construction of Light Networks. CoRR (2019)
Yair Bartal, Arnold Filtser, Ofer Neiman
On notions of distortion and an almost minimum spanning tree with constant average distortion. J. Comput. Syst. Sci. 105 (2019)
Michael Elkin, Ofer Neiman
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. SIAM J. Comput. 48 (4) (2019)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. 48 (3) (2019)
Michael Elkin, Ofer Neiman
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC. SPAA (2019)
Yair Bartal, Nova Fandina, Ofer Neiman
Covering Metric Spaces by Few Trees. ICALP (2019)
Ittai Abraham, Ofer Neiman
Using Petal-Decompositions to Build a Low Stretch Spanning Tree. SIAM J. Comput. 48 (2) (2019)
Michael Elkin, Yuval Gitlitz, Ofer Neiman
Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs. CoRR (2019)
Yair Bartal, Nova Fandina, Ofer Neiman
Covering Metric Spaces by Few Trees. CoRR (2019)
Michael Elkin, Ofer Neiman
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. ACM Trans. Algorithms 15 (1) (2019)
Michael Elkin, Ofer Neiman
Near-Optimal Distributed Routing with Low Memory. PODC (2018)
Arnold Filtser, Ofer Neiman
Light Spanners for High Dimensional Norms via Stochastic Decompositions. ESA (2018)
Michael Elkin, Ofer Neiman
Near Isometric Terminal Embeddings for Doubling Metrics. SoCG (2018)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric embedding via shortest path decompositions. STOC (2018)
Michael Elkin, Ofer Neiman
On efficient distributed construction of near optimal routing schemes. Distributed Comput. 31 (2) (2018)
Michael Elkin, Ofer Neiman
Near Isometric Terminal Embeddings for Doubling Metrics. CoRR (2018)
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
Ramsey Spanning Trees and their Applications. SODA (2018)
Michael Elkin, Arnold Filtser, Ofer Neiman
Prioritized Metric Structures and Embedding. SIAM J. Comput. 47 (3) (2018)
Arnold Filtser, Ofer Neiman
Light Spanners for High Dimensional Norms via Stochastic Decompositions. CoRR (2018)
Michael Elkin, Arnold Filtser, Ofer Neiman
Terminal embeddings. Theor. Comput. Sci. 697 (2017)
Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
Metric Embedding via Shortest Path Decompositions. CoRR (2017)
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
Ramsey Spanning Trees and their Applications. CoRR (2017)
Michael Elkin, Ofer Neiman
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. SODA (2017)
Michael Elkin, Ofer Neiman
Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory. CoRR (2017)
Michael Elkin, Arnold Filtser, Ofer Neiman
Terminal Embeddings. CoRR (2016)
Alexandr Andoni, Assaf Naor, Ofer Neiman
Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost. ICALP (2016)
Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
On Vertex Rankings of Graphs and its Relatives. CoRR (2016)
Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen
Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci. 651 (2016)
Michael Elkin, Ofer Neiman
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. FOCS (2016)
Yair Bartal, Arnold Filtser, Ofer Neiman
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. SODA (2016)
Ofer Neiman
Low Dimensional Embeddings of Doubling Metrics. Theory Comput. Syst. 58 (1) (2016)
Yair Bartal, Arnold Filtser, Ofer Neiman
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion. CoRR (2016)
Michael Elkin, Ofer Neiman
Distributed Strong Diameter Network Decomposition: Extended Abstract. PODC (2016)
Michael Elkin, Ofer Neiman
Distributed Strong Diameter Network Decomposition. CoRR (2016)
Michael Elkin, Ofer Neiman
On Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract. PODC (2016)
Michael Elkin, Ofer Neiman
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths. CoRR (2016)
Michael Elkin, Ofer Neiman
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. CoRR (2016)
Michael Elkin, Ofer Neiman
On Efficient Distributed Construction of Near Optimal Routing Schemes. CoRR (2016)
Ofer Neiman, Shay Solomon
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms 12 (1) (2016)
Michael Elkin, Ofer Neiman, Shay Solomon
Light Spanners. SIAM J. Discret. Math. 29 (3) (2015)
Ittai Abraham, Yair Bartal, Ofer Neiman
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. SIAM J. Comput. 44 (1) (2015)
Michael Elkin, Arnold Filtser, Ofer Neiman
Prioritized Metric Structures and Embedding. CoRR (2015)
Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman
. SIAM J. Discret. Math. 29 (3) (2015)
Michael Elkin, Arnold Filtser, Ofer Neiman
Terminal Embeddings. APPROX-RANDOM (2015)
Michael Elkin, Arnold Filtser, Ofer Neiman
Prioritized Metric Structures and Embedding. STOC (2015)
Ittai Abraham, Yair Bartal, Ofer Neiman
Local Embeddings of Metric Spaces. Algorithmica 72 (2) (2015)
Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky
On vertex rankings of graphs and its relatives. Discret. Math. 338 (8) (2015)
Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
Volume in General Metric Spaces. Discret. Comput. Geom. 52 (2) (2014)
Michael Elkin, Ofer Neiman, Shay Solomon
Light Spanners. CoRR (2014)
Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman
On the Impossibility of Dimension Reduction for Doubling Subsets of ℓp. SoCG (2014)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC (2014)
Michael Elkin, Ofer Neiman, Shay Solomon
Light Spanners. ICALP (1) (2014)
Michael Elkin, Ofer Neiman, Christian Wulff-Nilsen
Space-Efficient Path-Reporting Approximate Distance Oracles. CoRR (2014)
Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman
Bandwidth and low dimensional embedding. Theor. Comput. Sci. 500 (2013)
Ofer Neiman
Low Dimensional Embeddings of Doubling Metrics. WAOA (2013)
Ofer Neiman, Shay Solomon
Simple deterministic algorithms for fully dynamic maximal matching. STOC (2013)
Yair Bartal, Lee-Ad Gottlieb, Ofer Neiman
, p>2. CoRR (2013)
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR (2013)
Ittai Abraham, Ofer Neiman
Using petal-decompositions to build a low stretch spanning tree. STOC (2012)
Ofer Neiman, Shay Solomon
Deterministic Algorithms for Fully Dynamic Maximal Matching CoRR (2012)
Alantha Newman, Ofer Neiman, Aleksandar Nikolov
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS (2012)
Yair Bartal, Douglas E. Carroll, Adam Meyerson, Ofer Neiman
Bandwidth and Low Dimensional Embedding. APPROX-RANDOM (2011)
Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen
Near Linear Lower Bound for Dimension Reduction in L1. FOCS (2011)
Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal
Dynamic Inefficiency: Anarchy without Stability. SAGT (2011)
Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
Volume in General Metric Spaces. ESA (2) (2010)
Ittai Abraham, Yair Bartal, Ofer Neiman
On low dimensional local embeddings. SODA (2009)
Ittai Abraham, Yair Bartal, Ofer Neiman
Nearly Tight Low Stretch Spanning Trees. FOCS (2008)
Ittai Abraham, Yair Bartal, Ofer Neiman
Embedding metric spaces in their intrinsic dimension. SODA (2008)
Ittai Abraham, Yair Bartal, Ofer Neiman
Nearly Tight Low Stretch Spanning Trees CoRR (2008)
Ittai Abraham, Yair Bartal, Ofer Neiman
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA (2007)
Ittai Abraham, Yair Bartal, Ofer Neiman
Local embeddings of metric spaces. STOC (2007)

Ofer Neiman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ofer Neiman