Nicole Wein - RankMe

66 papers A* 19A 8B 1Journal 37

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Bounding the Fragmentation of B-Trees Subject to Batched Insertions. CoRR Michael A. Bender, Aaron Bernstein, Nairen Cao, Alexander Conway, Martín Farach-Colton, Hanna Komlós, Yarin Shechter, Nicole Wein
2025	J	`jnl`	A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs. CoRR Kuowen Chen, Nicole Wein, Yiran Zhang
2025	A*	`conf`	Beyond 2-Approximation for SODA Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein
2025	J	`jnl`	Beyond 2-approximation for k-Center in Graphs. CoRR Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein
2025	A*	`conf`	Covering Approximate Shortest Paths with DAGs. STOC Sepehr Assadi, Gary Hoppenworth, Nicole Wein
2025	J	`jnl`	Covering Approximate Shortest Paths with DAGs. CoRR Sepehr Assadi, Gary Hoppenworth, Nicole Wein
2025	A	`conf`	Edge-Minimum Walk of Modular Length in Polynomial Time. ITCS Antoine Amarilli, Benoît Groz, Nicole Wein
2025	A	`conf`	Improved Hardness-Of-Approximation for Token-Swapping. ESA Sam Hiken, Nicole Wein
2025	B	`conf`	Improved Online Sorting. WAOA Jubayer Nirjhor, Nicole Wein
2025	J	`jnl`	Improved Online Sorting. CoRR Jubayer Nirjhor, Nicole Wein
2025	A	`conf`	Low Sensitivity Hopsets. ITCS Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein
2025	J	`jnl`	Online List Labeling: Breaking the \({\log^2 n}\) Barrier. SIAM J. Comput. Michael A. Bender, Alexander Conway, Martín Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
2025	J	`jnl`	Settling Weighted Token Swapping up to Algorithmic Barriers. CoRR Nicole Wein, Guanyu Tony Zhang
2024	A*	`conf`	Additive Spanner Lower Bounds with Optimal Inner Graph Structure. ICALP Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2024	J	`jnl`	Additive Spanner Lower Bounds with Optimal Inner Graph Structure. CoRR Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2024	A	`conf`	Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights? ITCS Aaron Bernstein, Greg Bodwin, Nicole Wein
2024	A*	`conf`	Detecting Disjoint Shortest Paths in Linear Time and More. ICALP Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
2024	J	`jnl`	Detecting Disjoint Shortest Paths in Linear Time and More. CoRR Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein
2024	J	`jnl`	Edge-Minimum Walk of Modular Length in Polynomial Time. CoRR Antoine Amarilli, Benoît Groz, Nicole Wein
2024	J	`jnl`	Improved Hardness-of-Approximation for Token Swapping. CoRR Sam Hiken, Nicole Wein
2024	J	`jnl`	Low Sensitivity Hopsets. CoRR Vikrant Ashvinkumar, Aaron Bernstein, Chengyuan Deng, Jie Gao, Nicole Wein
2023	A	`conf`	A Local-To-Global Theorem for Congested Shortest Paths. ESA Shyan Akmal, Nicole Wein
2023	J	`jnl`	Are there graphs whose shortest path structure requires large edge weights? CoRR Aaron Bernstein, Greg Bodwin, Nicole Wein
2023	A*	`conf`	Closing the Gap Between Directed Hopsets and Shortcut Sets. SODA Aaron Bernstein, Nicole Wein
2022	J	`jnl`	A Local-to-Global Theorem for Congested Shortest Paths. CoRR Shyan Akmal, Nicole Wein
2022	A*	`conf`	Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
2022	J	`jnl`	Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein
2022	A*	`conf`	Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. SODA Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2022	J	`jnl`	Closing the Gap Between Directed Hopsets and Shortcut Sets. CoRR Aaron Bernstein, Nicole Wein
2022	J	`jnl`	Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
2022	A	`conf`	Hardness of Token Swapping on Trees. ESA Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2022	A*	`conf`	Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost. ICALP Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
2022	A*	`conf`	Online List Labeling: Breaking the log FOCS Michael A. Bender, Alex Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
2022	J	`jnl`	Online List Labeling: Breaking the log CoRR Michael A. Bender, Alexander Conway, Martin Farach-Colton, Hanna Komlós, William Kuszmaul, Nicole Wein
2021	—	`—`	Algorithms and Hardness for Approximating the Diameter of a Graph. Nicole Wein
2021	A	`conf`	Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial. DISC Adir Morgan, Shay Solomon, Nicole Wein
2021	J	`jnl`	Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product. CoRR Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, Zixuan Xu
2021	J	`jnl`	Hardness of Token Swapping on Trees. CoRR Oswin Aichholzer, Erik D. Demaine, Matias Korman, Jayson Lynch, Anna Lubiw, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein
2021	A*	`conf`	New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. SODA Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
2021	J	`jnl`	Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs. CoRR Adir Morgan, Shay Solomon, Nicole Wein
2021	A*	`conf`	Tight conditional lower bounds for approximating diameter in directed graphs. STOC Mina Dalirrooyfard, Nicole Wein
2021	J	`jnl`	Toward Tight Approximation Bounds for Graph Diameter and Eccentricities. SIAM J. Comput. Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
2020	J	`jnl`	Algorithms and Lower Bounds for the Worker-Task Assignment Problem. CoRR Aaron Berger, William Kuszmaul, Adam Polak, Jonathan Tidor, Nicole Wein
2020	J	`jnl`	Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2020	J	`jnl`	Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2020	J	`jnl`	Improved Dynamic Graph Coloring. ACM Trans. Algorithms Shay Solomon, Nicole Wein
2020	A*	`conf`	Lower Bounds for Dynamic Distributed Task Allocation. ICALP Hsin-Hao Su, Nicole Wein
2020	J	`jnl`	Lower Bounds for Dynamic Distributed Task Allocation. CoRR Hsin-Hao Su, Nicole Wein
2020	J	`jnl`	New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs. CoRR Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
2020	J	`jnl`	New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners. CoRR Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
2020	A*	`conf`	New algorithms and hardness for incremental single-source shortest paths in directed graphs. STOC Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein
2020	J	`jnl`	Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs. CoRR Mina Dalirrooyfard, Nicole Wein
2019	A*	`conf`	Algorithms and Hardness for Diameter in Dynamic Graphs. ICALP Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2019	A*	`conf`	Approximation Algorithms for Min-Distance Problems. ICALP Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
2019	J	`jnl`	Approximation Algorithms for Min-Distance Problems. CoRR Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein, Yinzhan Xu, Yuancheng Yu
2019	J	`jnl`	Improved Dynamic Graph Coloring. CoRR Shay Solomon, Nicole Wein
2019	A*	`conf`	Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. ICALP Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
2019	J	`jnl`	Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems. CoRR Mina Dalirrooyfard, Virginia Vassilevska Williams, Nikhil Vyas, Nicole Wein
2018	J	`jnl`	Algorithms and Hardness for Diameter in Dynamic Graphs. CoRR Bertie Ancona, Monika Henzinger, Liam Roditty, Virginia Vassilevska Williams, Nicole Wein
2018	A*	`conf`	Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2018	J	`jnl`	Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein
2018	A*	`conf`	Fully Dynamic MIS in Uniformly Sparse Graphs. ICALP Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2018	J	`jnl`	Fully Dynamic MIS in Uniformly Sparse Graphs. CoRR Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein
2018	A	`conf`	Improved Dynamic Graph Coloring. ESA Shay Solomon, Nicole Wein
2018	J	`jnl`	Towards Tight Approximation Bounds for Graph Diameter and Eccentricities. CoRR Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein
2018	A*	`conf`	Towards tight approximation bounds for graph diameter and eccentricities. STOC Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein