Similar Items: A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
- Succinct Graph Representations and Algorithmic Applications
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Smallest suffixient set maintenance in near-real-time
- Nearly Optimal Attention Coresets
- On the Complexity of the Matching Problem of Regular Expressions with Backreferences