Nicole Wein
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
25
Venues
6
Active years
2018–2026
Best venue rank
A*
Where they publish
Papers
25 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | DAG Covers for Structured Graphs: The Steiner Point Effect. | Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein, Da Wei Zheng |
| 2025 | ESA | Improved Hardness-Of-Approximation for Token-Swapping. | Sam Hiken, Nicole Wein |
| 2025 | SODA | Beyond 2-Approximation for | Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein |
| 2025 | STOC | Covering Approximate Shortest Paths with DAGs. | Sepehr Assadi, Gary Hoppenworth, Nicole Wein |
| 2025 | WAOA | Improved Online Sorting. | Jubayer Nirjhor, Nicole Wein |
| 2024 | ICALP | Detecting Disjoint Shortest Paths in Linear Time and More. | Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein |
| 2024 | ICALP | Additive Spanner Lower Bounds with Optimal Inner Graph Structure. | Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu |
| 2023 | ESA | A Local-To-Global Theorem for Congested Shortest Paths. | Shyan Akmal, Nicole Wein |
| 2023 | SODA | Closing the Gap Between Directed Hopsets and Shortcut Sets. | Aaron Bernstein, Nicole Wein |
| 2022 | ESA | Hardness of Token Swapping on Trees. | Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masrov, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | FOCS | Online List Labeling: Breaking the log | Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komls, William Kuszmaul, Nicole Wein |
| 2022 | FOCS | Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. | Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | ICALP | Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. | Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein |
| 2022 | SODA | Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. | Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu |
| 2021 | SODA | New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. | Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |
| 2021 | STOC | Tight conditional lower bounds for approximating diameter in directed graphs. | Mina Dalirrooyfard, Nicole Wein |
| 2020 | ICALP | Lower Bounds for Dynamic Distributed Task Allocation. | Hsin-Hao Su, Nicole Wein |
| 2020 | STOC | New algorithms and hardness for incremental single-source shortest paths in directed graphs. | Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein |
| 2019 | ICALP | Algorithms and Hardness for Diameter in Dynamic Graphs. | Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein |
| 2019 | ICALP | Approximation Algorithms for Min-Distance Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu |
| 2019 | ICALP | Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. | Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein |
| 2018 | ESA | Improved Dynamic Graph Coloring. | Shay Solomon, Nicole Wein |
| 2018 | ICALP | Finding Cliques in Social Networks: A New Distribution-Free Model. | Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein |
| 2018 | ICALP | Fully Dynamic MIS in Uniformly Sparse Graphs. | Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein |
| 2018 | STOC | Towards tight approximation bounds for graph diameter and eccentricities. | Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein |