Nicole Wein

According to our database1, Nicole Wein authored at least 14 papers between 2018 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Hardness of Token Swapping on Trees.
CoRR, 2021

Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs.
CoRR, 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

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs.
CoRR, 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 Proccedings 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...