Advances in metric embedding theory I Abraham, Y Bartal, O Neimany Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 182 | 2006 |

Simple deterministic algorithms for fully dynamic maximal matching O Neiman, S Solomon ACM Transactions on Algorithms (TALG) 12 (1), 1-15, 2015 | 151 | 2015 |

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 | 146 | 2008 |

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 | 130 | 2012 |

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 | 94 | 2005 |

Hopsets with constant hopbound, and applications to approximate shortest paths M Elkin, O Neiman SIAM Journal on Computing 48 (4), 1436-1480, 2019 | 84 | 2019 |

Efficient algorithms for constructing very sparse spanners and emulators M Elkin, O Neiman ACM Transactions on Algorithms (TALG) 15 (1), 1-29, 2018 | 84 | 2018 |

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 | 55 | 2015 |

Assouad’s theorem with dimension independent of the snowflaking A Naor, O Neiman Revista Matematica Iberoamericana 28 (4), 1123-1142, 2012 | 52 | 2012 |

Embedding metric spaces in their intrinsic dimension I Abraham, Y Bartal, O Neiman Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 44 | 2008 |

Terminal embeddings M Elkin, A Filtser, O Neiman Theoretical Computer Science 697, 1-36, 2017 | 43 | 2017 |

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 | 42 | 2012 |

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 | 41 | 2014 |

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 | 37 | 2019 |

Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC M Elkin, O Neiman The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 333-341, 2019 | 36 | 2019 |

Snowflake universality of Wasserstein spaces A Andoni, A Naor, O Neiman Ann. Sci. Éc. Norm. Supér.(4) 51 (3), 657-700, 2018 | 33 | 2018 |

Distributed strong diameter network decomposition M Elkin, O Neiman Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 32 | 2016 |

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 | 30 | 2011 |

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 | 28 | 2020 |

On efficient distributed construction of near optimal routing schemes M Elkin, O Neiman Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 24 | 2016 |