The following pages link to Nicole Wein (Q4987443):
Displaying 17 items.
- Fully Dynamic MIS in Uniformly Sparse Graphs (Q4987444) (← links)
- Improved Dynamic Graph Coloring (Q4987463) (← links)
- (Q5002730) (← links)
- Fully dynamic MIS in uniformly sparse graphs (Q5002774) (← links)
- Improved Dynamic Graph Coloring (Q5009642) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- (Q5091161) (← links)
- (Q5091199) (← links)
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- New algorithms and hardness for incremental single-source shortest paths in directed graphs (Q5144905) (← links)
- Towards tight approximation bounds for graph diameter and eccentricities (Q5230295) (← links)
- (Q6083402) (← links)
- Closing the gap between directed hopsets and shortcut sets (Q6538532) (← links)
- Memoryless worker-task assignment with polylogarithmic switching cost (Q6560803) (← links)
- Better lower bounds for shortcut sets and additive spanners via an improved alternation product (Q6575212) (← links)
- A local-to-global theorem for congested shortest paths (Q6656946) (← links)
