Nicole Wein
Orcid: 0000000327922374Affiliations:
 University of Michigan, USA
 Massachusetts Institute of Technology, Cambridge, MA, USA (former)
 Rutgers University, USA (former)
According to our database^{1},
Nicole Wein
authored at least 25 papers
between 2018 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
2023
Proceedings of the 2023 ACMSIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Dagstuhl Reports, November, 2022
Better Lower Bounds for Shortcut Sets and Additive Spanners via an Improved Alternation Product.
Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Approximation Algorithms and Hardness for nPairs Shortest Paths and AllNodes Shortest Cycles.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the 30th Annual European Symposium on Algorithms, 2022
2021
PhD thesis, 2021
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
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 2021 ACMSIAM Symposium on Discrete Algorithms, 2021
2020
ACM Trans. Algorithms, 2020
ACM Trans. Algorithms, 2020
SIAM J. Comput., 2020
CoRR, 2020
New algorithms and hardness for incremental singlesource shortest paths in directed graphs.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
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
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018