1: Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation
2: A General Algorithm for Solving Rank-one Matrix Sensing
3: Critical Relaxed Stable Matchings with Two-Sided Ties
4: Leximin Approximation: From Single-Objective to Multi-Objective
5: Degree Sequence Optimization in Bounded Treewidth
6: Almost-Optimal Sublinear Additive Spanners
7: Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
8: Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization
9: Parameterized Algorithms for Topological Indices in Chemistry
10: Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
11: The limited-memory recursive variational Gaussian approximation (L-RVGA)
12: Differentially Private Synthetic Control
13: Distributed Silhouette Algorithm: Evaluating Clustering on Big Data
14: Exact Short Products From Truncated Multipliers
15: Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood
16: A Survey on the Densest Subgraph Problem and Its Variants
17: Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More
18: The Subspace Flatness Conjecture and Faster Integer Programming
19: Analysis of DNA sequences through local distribution of nucleotides in strategic neighborhoods
20: Online $k$-Median with Consistent Clusters
21: Faster Isomorphism for $p$-Groups of Class 2 and Exponent $p$
22: Randomized rounding algorithms for large scale unsplittable flow problems
23: On de novo Bridging Paired-end RNA-seq Data
24: Overcoming Probabilistic Faults in Disoriented Linear Search
25: Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model
26: Algorithms for subgraph complementation to some classes of graphs
27: Lifting uniform learners via distributional decomposition