Skip to content

Ofer Neiman

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

34

Venues

11

Active years

2005–2024

Best venue rank

A*

Where they publish

Papers

34 indexed papers, newest first.

YearVenueTitleAuthors
2024WGLightweight Near-Additive Spanners.Yuval Gitlitz, Ofer Neiman, Richard Spence
2022ESAA Unified Framework for Hopsets.Ofer Neiman, Idan Shabat
2022STACSCentralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication.Michael Elkin, Ofer Neiman
2020PODCDistributed Construction of Light Networks.Michael Elkin, Arnold Filtser, Ofer Neiman
2020SODALossless Prioritized Embeddings.Michael Elkin, Ofer Neiman
2019ICALPCovering Metric Spaces by Few Trees.Yair Bartal, Nova Fandina, Ofer Neiman
2019SPAALinear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC.Michael Elkin, Ofer Neiman
2018ESALight Spanners for High Dimensional Norms via Stochastic Decompositions.Arnold Filtser, Ofer Neiman
2018PODCNear-Optimal Distributed Routing with Low Memory.Michael Elkin, Ofer Neiman
2018SODARamsey Spanning Trees and their Applications.Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman
2018STOCMetric embedding via shortest path decompositions.Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman
2017SODAEfficient Algorithms for Constructing Very Sparse Spanners and Emulators.Michael Elkin, Ofer Neiman
2016FOCSHopsets with Constant Hopbound, and Applications to Approximate Shortest Paths.Michael Elkin, Ofer Neiman
2016ICALPImpossibility of Sketching of the 3D Transportation Metric with Quadratic Cost.Alexandr Andoni, Assaf Naor, Ofer Neiman
2016PODCDistributed Strong Diameter Network Decomposition: Extended Abstract.Michael Elkin, Ofer Neiman
2016PODCOn Efficient Distributed Construction of Near Optimal Routing Schemes: Extended Abstract.Michael Elkin, Ofer Neiman
2016SODAOn Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion.Yair Bartal, Arnold Filtser, Ofer Neiman
2015STOCPrioritized Metric Structures and Embedding.Michael Elkin, Arnold Filtser, Ofer Neiman
2014ICALPLight Spanners.Michael Elkin, Ofer Neiman, Shay Solomon
2014STOCCops, robbers, and threatening skeletons: padded decomposition for minor-free graphs.Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar
2013STOCSimple deterministic algorithms for fully dynamic maximal matching.Ofer Neiman, Shay Solomon
2013WAOALow Dimensional Embeddings of Doubling Metrics.Ofer Neiman
2012FOCSBeck's Three Permutations Conjecture: A Counterexample and Some Consequences.Alantha Newman, Ofer Neiman, Aleksandar Nikolov
2012STOCUsing petal-decompositions to build a low stretch spanning tree.Ittai Abraham, Ofer Neiman
2011FOCSNear Linear Lower Bound for Dimension Reduction in L1.Alexandr Andoni, Moses Charikar, Ofer Neiman, Huy L. Nguyen
2011SAGTDynamic Inefficiency: Anarchy without Stability.Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal
2010ESAVolume in General Metric Spaces.Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman
2009SODAOn low dimensional local embeddings.Ittai Abraham, Yair Bartal, Ofer Neiman
2008FOCSNearly Tight Low Stretch Spanning Trees.Ittai Abraham, Yair Bartal, Ofer Neiman
2008SODAEmbedding metric spaces in their intrinsic dimension.Ittai Abraham, Yair Bartal, Ofer Neiman
2007SODAEmbedding metrics into ultrametrics and graphs into spanning trees with constant average distortion.Ittai Abraham, Yair Bartal, Ofer Neiman
2007STOCLocal embeddings of metric spaces.Ittai Abraham, Yair Bartal, Ofer Neiman
2006STOCAdvances in metric embedding theory.Ittai Abraham, Yair Bartal, Ofer Neiman
2005FOCSMetric Embeddings with Relaxed Guarantees.Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins