| The greedy spanner is existentially optimal A Filtser, S Solomon SIAM Journal on Computing 49 (2), 429-447, 2020 | 72* | 2020 |
| Terminal embeddings M Elkin, A Filtser, O Neiman Theoretical Computer Science 697, 1-36, 2017 | 48 | 2017 |
| Approximate nearest neighbor for curves: simple, efficient, and deterministic A Filtser, O Filtser, MJ Katz Algorithmica 85 (5), 1490-1519, 2023 | 32 | 2023 |
| On light spanners, low-treewidth embeddings and efficient traversing in minor-free graphs V Cohen-Addad, A Filtser, PN Klein, H Le 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 31 | 2020 |
| Constructing light spanners deterministically in near-linear time S Alstrup, S Dahlgaard, A Filtser, M Stöckel, C Wulff-Nilsen Theoretical Computer Science 907, 82-112, 2022 | 30 | 2022 |
| Steiner Point Removal with Distortion using the Relaxed-Voronoi Algorithm A Filtser SIAM Journal on Computing 48 (2), 249-278, 2019 | 30* | 2019 |
| Scattering and sparse partitions, and their applications A Filtser ACM Transactions on Algorithms, 2020 | 27 | 2020 |
| 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 | 27 | 2020 |
| Graph spanners by sketching in dynamic streams and the simultaneous communication model A Filtser, M Kapralov, N Nouri Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 26 | 2021 |
| Prioritized metric structures and embedding M Elkin, A Filtser, O Neiman Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015 | 24 | 2015 |
| On notions of distortion and an almost minimum spanning tree with constant average distortion Y Bartal, A Filtser, O Neiman Journal of Computer and System Sciences 105, 116-129, 2019 | 23 | 2019 |
| Metric embedding via shortest path decompositions I Abraham, A Filtser, A Gupta, O Neiman Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 22* | 2018 |
| Relaxed voronoi: A simple framework for terminal-clustering problems A Filtser, R Krauthgamer, O Trabelsi arXiv preprint arXiv:1809.00942, 2018 | 21 | 2018 |
| Clan embeddings into trees, and low treewidth graphs A Filtser, H Le Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 19 | 2021 |
| A face cover perspective to ℓ1 embeddings of planar graphs A Filtser Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 18 | 2020 |
| On strong diameter padded decompositions A Filtser arXiv preprint arXiv:1906.09783, 2019 | 17 | 2019 |
| Locality-sensitive orderings and applications to reliable spanners A Filtser, H Le Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 16* | 2022 |
| Hop-constrained metric embeddings and their applications A Filtser 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 15 | 2022 |
| Light spanners for high dimensional norms via stochastic decompositions A Filtser, O Neiman arXiv preprint arXiv:1804.07456, 2018 | 15* | 2018 |
| Static and streaming data structures for Fréchet distance queries A Filtser, O Filtser ACM Transactions on Algorithms 19 (4), 1-36, 2023 | 11 | 2023 |
Ofer NeimanBen Gurion UniversityVerified email at mail.huji.ac.il
