1: A k-core Decomposition Framework for Graph Clustering
2: Maximizing the Sum of Radii of Disjoint Balls or Disks
3: On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
4: A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
5: On the Complexity of Realizing Facial Cycles
6: Robust Assignments via Ear Decompositions and Randomized Rounding
7: Fine-Grained Complexity Analysis of Two Classic TSP Variants
8: Computing the atom graph of a graph and the union join graph of a hypergraph
9: Characterization and recognition of proper tagged probe interval graphs
10: Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis
11: Estimating Current-Flow Closeness Centrality with a Multigrid Laplacian Solver
12: Kernel-based methods for bandit convex optimization
13: How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods
14: A fast algorithm for identifying Friends-of-Friends halos
15: Modified LLL algorithm with shifted start column
16: Quadboost: A Scalable Concurrent Quadtree
17: Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods
18: Tight lower bounds for the complexity of multicoloring
19: LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain
20: Pseudo-Centroid Clustering
21: Fast Sampling for Strongly Rayleigh Measures with Application to Determinantal Point Processes
22: Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees
23: Improved Approximation for Weighted Tree Augmentation with Bounded Costs
24: Practical optimization of Steiner Trees via the cavity method
25: Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism
26: Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
27: Concatenated image completion via tensor augmentation and completion
28: Fast Algorithms for Segmented Regression
29: Directed Hamiltonicity and Out-Branchings via Generalized Laplacians
30: Best-Response Dynamics in Combinatorial Auctions with Item Bidding