Nicole Wein

Available identifiers

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
https://portal.mardi4nfdi.de/entity/Q6147366	2024-01-15	Paper
https://portal.mardi4nfdi.de/entity/Q6083402	2023-12-08	Paper
Tight conditional lower bounds for approximating diameter in directed graphs	2023-11-14	Paper
A Local-to-Global Theorem for Congested Shortest Paths	2022-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q5091161	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5091199	2022-07-21	Paper
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems	2022-07-21	Paper
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities	2021-08-06	Paper
Improved Dynamic Graph Coloring	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5002730	2021-07-28	Paper
Fully dynamic MIS in uniformly sparse graphs	2021-07-28	Paper
Fully Dynamic MIS in Uniformly Sparse Graphs	2021-05-03	Paper
Improved Dynamic Graph Coloring	2021-05-03	Paper
New algorithms and hardness for incremental single-source shortest paths in directed graphs	2021-01-19	Paper
Finding Cliques in Social Networks: A New Distribution-Free Model	2020-05-28	Paper
Towards tight approximation bounds for graph diameter and eccentricities	2019-08-22	Paper

This page was built for person: Nicole Wein