| Towards tight approximation bounds for graph diameter and eccentricities A Backurs, L Roditty, G Segal, VV Williams, N Wein Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 67 | 2018 |
| Improved dynamic graph coloring S Solomon, N Wein ACM Transactions on Algorithms (TALG) 16 (3), 1-24, 2020 | 49 | 2020 |
| Finding cliques in social networks: A new distribution-free model J Fox, T Roughgarden, C Seshadhri, F Wei, N Wein SIAM journal on computing 49 (2), 448-464, 2020 | 48 | 2020 |
| New techniques and fine-grained hardness for dynamic near-additive spanners T Bergamaschi, M Henzinger, MP Gutenberg, VV Williams, N Wein Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 32 | 2021 |
| New algorithms and hardness for incremental single-source shortest paths in directed graphs M Probst Gutenberg, V Vassilevska Williams, N Wein Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 32 | 2020 |
| Algorithms and hardness for diameter in dynamic graphs B Ancona, M Henzinger, L Roditty, VV Williams, N Wein arXiv preprint arXiv:1811.12527, 2018 | 31 | 2018 |
| Fully dynamic MIS in uniformly sparse graphs K Onak, B Schieber, S Solomon, N Wein ACM Transactions on Algorithms (TALG) 16 (2), 1-19, 2020 | 26 | 2020 |
| Tight conditional lower bounds for approximating diameter in directed graphs M Dalirrooyfard, N Wein Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 15 | 2021 |
| Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product∗ K Lu, VV Williams, N Wein, Z Xu Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 14 | 2022 |
| Tight approximation algorithms for bichromatic graph diameter and related problems M Dalirrooyfard, VV Williams, N Vyas, N Wein arXiv preprint arXiv:1904.11601, 2019 | 12 | 2019 |
| Approximation algorithms for min-distance problems M Dalirrooyfard, VV Williams, N Vyas, N Wein, Y Xu, Y Yu arXiv preprint arXiv:1904.11606, 2019 | 11 | 2019 |
| Approximation algorithms and hardness for n-pairs shortest paths and all-nodes shortest cycles M Dalirrooyfard, C Jin, VV Williams, N Wein 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 7 | 2022 |
| Hardness of token swapping on trees O Aichholzer, ED Demaine, M Korman, J Lynch, A Lubiw, Z Masárová, ... arXiv preprint arXiv:2103.06707, 2021 | 7 | 2021 |
| Closing the gap between directed hopsets and shortcut sets A Bernstein, N Wein Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 5 | 2023 |
| Algorithms for the minimum dominating set problem in bounded arboricity graphs: Simpler, faster, and combinatorial A Morgan, S Solomon, N Wein arXiv preprint arXiv:2102.10077, 2021 | 5 | 2021 |
| Memoryless worker-task assignment with polylogarithmic switching cost A Berger, W Kuszmaul, A Polak, J Tidor, N Wein arXiv preprint arXiv:2008.10709, 2020 | 4 | 2020 |
| Online List Labeling: Breaking the log2n Barrier MA Bender, A Conway, M Farach-Colton, H Komlós, W Kuszmaul, N Wein 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 3 | 2022 |
| A local-to-global theorem for congested shortest paths S Akmal, N Wein arXiv preprint arXiv:2211.07042, 2022 | 2 | 2022 |
| Lower bounds for dynamic distributed task allocation HH Su, N Wein arXiv preprint arXiv:2006.16898, 2020 | 2 | 2020 |
| Detecting Disjoint Shortest Paths in Linear Time and More S Akmal, VV Williams, N Wein arXiv preprint arXiv:2404.15916, 2024 | | 2024 |
