Similar Items: Faster Deterministic Streaming Vertex Coloring
- A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
- Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Node-Weighted Triangles: Faster and Simpler
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- Faster Mixing for Triangulations via Transport Flows