1

Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning
Top-K ranking with a monotone adversary
Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering
Alternating Randomized Block Coordinate Descent
On Acceleration with Noise-Corrupted Gradients
Connected Subgraph Detection with Mirror Descent on SDPs
Expanders via Local Edge Flips