Nicole Wein

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A local-to-global theorem for congested shortest paths	2025-01-06	Paper
Better lower bounds for shortcut sets and additive spanners via an improved alternation product	2024-07-19	Paper
Memoryless worker-task assignment with polylogarithmic switching cost	2024-06-24	Paper
Closing the gap between directed hopsets and shortcut sets	2024-05-14	Paper
scientific article; zbMATH DE number 7788448 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
scientific article; zbMATH DE number 7774284 (Why is no real title available?) (available as arXiv preprint)	2023-12-08	Paper
Tight conditional lower bounds for approximating diameter in directed graphs Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
A Local-to-Global Theorem for Congested Shortest Paths	2022-11-13	Paper
scientific article; zbMATH DE number 7561506 (Why is no real title available?) (available as arXiv preprint)	2022-07-21	Paper
scientific article; zbMATH DE number 7561539 (Why is no real title available?) (available as arXiv preprint)	2022-07-21	Paper
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (available as arXiv preprint)	2022-07-21	Paper
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities SIAM Journal on Computing	2021-08-06	Paper
Improved dynamic graph coloring (available as arXiv preprint)	2021-08-04	Paper
Finding cliques in social networks: a new distribution-free model	2021-07-28	Paper
Fully dynamic MIS in uniformly sparse graphs (available as arXiv preprint)	2021-07-28	Paper
Improved dynamic graph coloring ACM Transactions on Algorithms	2021-05-03	Paper
Fully dynamic MIS in uniformly sparse graphs ACM Transactions on Algorithms	2021-05-03	Paper
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	2021-01-19	Paper
Finding cliques in social networks: a new distribution-free model SIAM Journal on Computing	2020-05-28	Paper
Towards tight approximation bounds for graph diameter and eccentricities Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper

Research outcomes over time

This page was built for person: Nicole Wein