Similar Items: Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
- A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
- Nearly-Tight Bounds for Zonotope Containment and Beyond
- Smallest suffixient set maintenance in near-real-time
- Succinct Graph Representations and Algorithmic Applications
- Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
- Solving Hypergraph Laplacian Systems in Almost-Linear Time