Nicole Wein

Orcid: 0000-0003-2792-2374

Affiliations:
  • University of Michigan, USA
  • Massachusetts Institute of Technology, Cambridge, MA, USA (former)
  • Rutgers University, USA (former)


According to our database1, Nicole Wein authored at least 25 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights?
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Closing the Gap Between Directed Hopsets and Shortcut Sets.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A Local-To-Global Theorem for Congested Shortest Paths.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Dynamic Graph Algorithms (Dagstuhl Seminar 22461).
Dagstuhl Reports, November, 2022

Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Online List Labeling: Breaking the log<sup>2</sup>n Barrier.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Hardness of Token Swapping on Trees.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Algorithms and Hardness for Approximating the Diameter of a Graph.
PhD thesis, 2021

Toward Tight Approximation Bounds for Graph Diameter and Eccentricities.
SIAM J. Comput., 2021

Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs.
CoRR, 2021

Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

Tight conditional lower bounds for approximating diameter in directed graphs.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
Improved Dynamic Graph Coloring.
ACM Trans. Algorithms, 2020

Fully Dynamic MIS in Uniformly Sparse Graphs.
ACM Trans. Algorithms, 2020

Finding Cliques in Social Networks: A New Distribution-Free Model.
SIAM J. Comput., 2020

Algorithms and Lower Bounds for the Worker-Task Assignment Problem.
CoRR, 2020

New algorithms and hardness for incremental single-source shortest paths in directed graphs.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Lower Bounds for Dynamic Distributed Task Allocation.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Approximation Algorithms for Min-Distance Problems.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Algorithms and Hardness for Diameter in Dynamic Graphs.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Towards tight approximation bounds for graph diameter and eccentricities.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018


  Loading...