Follow
Ofer Neiman
Ofer Neiman
Ben Gurion University
Verified email at mail.huji.ac.il
Title
Cited by
Cited by
Year
Nearly tight low stretch spanning trees
I Abraham, Y Bartal, O Neiman
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 781-790, 2008
1352008
Simple deterministic algorithms for fully dynamic maximal matching
O Neiman, S Solomon
ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015
1312015
Using petal-decompositions to build a low stretch spanning tree
I Abraham, O Neiman
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
1172012
Metric embeddings with relaxed guarantees
I Abraham, Y Bartal, J Kleinberg, THH Chan, O Neiman, K Dhamdhere, ...
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 83-100, 2005
902005
Advances in metric embedding theory
I Abraham, Y Bartal, O Neimany
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
882006
Advances in metric embedding theory
I Abraham, Y Bartal, O Neiman
Advances in Mathematics 228 (6), 3026-3126, 2011
712011
Efficient algorithms for constructing very sparse spanners and emulators
M Elkin, O Neiman
ACM Transactions on Algorithms (TALG) 15 (1), 1-29, 2018
682018
Hopsets with constant hopbound, and applications to approximate shortest paths
M Elkin, O Neiman
SIAM Journal on Computing 48 (4), 1436-1480, 2019
672019
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
I Abraham, Y Bartal, O Neiman
SIAM Journal on Computing 44 (1), 160-192, 2015
522015
Embedding metric spaces in their intrinsic dimension
I Abraham, Y Bartal, O Neiman
Society for Industrial and Applied Mathematics, 2008
472008
Assouad’s theorem with dimension independent of the snowflaking
A Naor, O Neiman
Revista Matematica Iberoamericana 28 (4), 1123-1142, 2012
382012
Beck's three permutations conjecture: A counterexample and some consequences
A Newman, O Neiman, A Nikolov
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 253-262, 2012
342012
Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs
I Abraham, C Gavoille, A Gupta, O Neiman, K Talwar
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
332014
Terminal embeddings
M Elkin, A Filtser, O Neiman
Theoretical Computer Science 697, 1-36, 2017
312017
Near linear lower bound for dimension reduction in l1
A Andoni, MS Charikar, O Neiman, HL Nguyen
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 315-323, 2011
282011
Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC
M Elkin, O Neiman
Distributed Computing, 1-19, 2022
242022
Local embeddings of metric spaces
I Abraham, Y Bartal, O Neiman
Proceedings of the thirty-ninth annual ACM Symposium on Theory of Computing …, 2007
242007
Distributed strong diameter network decomposition
M Elkin, O Neiman
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
232016
Ramsey spanning trees and their applications
I Abraham, S Chechik, M Elkin, A Filtser, O Neiman
ACM Transactions on Algorithms (TALG) 16 (2), 1-21, 2020
212020
Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs
I Abraham, C Gavoille, A Gupta, O Neiman, K Talwar
SIAM Journal on Computing 48 (3), 1120-1145, 2019
212019
The system can't perform the operation now. Try again later.
Articles 1–20