Similar Items: Performance bounds for nearest neighbor search with k-d trees
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- Mistake-Bounded Language Generation
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- Randomized $k$-server in polynomial time
- Upward-Planar Drawings with Bounded Span
- Nearly-Tight Bounds for Zonotope Containment and Beyond