Nicole Wein

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 50

Top Topics

Top Venues

Publications

Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. CoRR (2024)
Aaron Bernstein, Greg Bodwin, Nicole Wein
Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS (2024)
Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
Additive Spanner Lower Bounds with Optimal Inner Graph Structure. ICALP (2024)
Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
Detecting Disjoint Shortest Paths in Linear Time and More. CoRR (2024)
Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
Detecting Disjoint Shortest Paths in Linear Time and More. ICALP (2024)
Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein
Low Sensitivity Hopsets. CoRR (2024)
Aaron Bernstein, Greg Bodwin, Nicole Wein
Are there graphs whose shortest path structure requires large edge weights? CoRR (2023)
Aaron Bernstein, Nicole Wein
Closing the Gap Between Directed Hopsets and Shortcut Sets. SODA (2023)
Shyan Akmal, Nicole Wein
A Local-To-Global Theorem for Congested Shortest Paths. ESA (2023)
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR (2022)
Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP (2022)
Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
n Barrier. FOCS (2022)
Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
n Barrier. CoRR (2022)
Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12 (11) (2022)
Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS (2022)
Aaron Bernstein, Nicole Wein
Closing the Gap Between Directed Hopsets and Shortcut Sets. CoRR (2022)
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
Hardness of Token Swapping on Trees. ESA (2022)
Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. SODA (2022)
Shyan Akmal, Nicole Wein
A Local-to-Global Theorem for Congested Shortest Paths. CoRR (2022)
Adir Morgan, Shay Solomon, Nicole Wein
Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs. CoRR (2021)
Mina Dalirrooyfard, Nicole Wein
Tight conditional lower bounds for approximating diameter in directed graphs. STOC (2021)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. 50 (4) (2021)
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. SODA (2021)
Adir Morgan, Shay Solomon, Nicole Wein
Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. DISC (2021)
Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
Hardness of Token Swapping on Trees. CoRR (2021)
Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. CoRR (2021)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. 49 (2) (2020)
Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16 (2) (2020)
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR (2020)
Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs. CoRR (2020)
Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR (2020)
Hsin-Hao Su, Nicole Wein
Lower Bounds for Dynamic Distributed Task Allocation. ICALP (2020)
Hsin-Hao Su, Nicole Wein
Lower Bounds for Dynamic Distributed Task Allocation. CoRR (2020)
Shay Solomon, Nicole Wein
Improved Dynamic Graph Coloring. ACM Trans. Algorithms 16 (3) (2020)
Mina Dalirrooyfard, Nicole Wein
Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs. CoRR (2020)
Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
New algorithms and hardness for incremental single-source shortest paths in directed graphs. STOC (2020)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
Approximation Algorithms for Min-Distance Problems. ICALP (2019)
Shay Solomon, Nicole Wein
Improved Dynamic Graph Coloring. CoRR (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR (2019)
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
Approximation Algorithms for Min-Distance Problems. CoRR (2019)
Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP (2019)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR (2018)
Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP (2018)
Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR (2018)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Towards tight approximation bounds for graph diameter and eccentricities. STOC (2018)
Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP (2018)
Shay Solomon, Nicole Wein
Improved Dynamic Graph Coloring. ESA (2018)
Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR (2018)
Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR (2018)