1: Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
2: Improved quantum lower and upper bounds for matrix scaling
3: Inequality and Inequity in Network-based Ranking and Recommendation Algorithms
4: Near-Optimal Distance Oracles for Vertex-Labeled Planar Graphs
5: An Exact, Linear Time Barab'asi-Albert Algorithm
6: Online Primal-Dual Algorithms with Predictions for Packing Problems
7: Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
8: Adwords with Unknown Budgets and Beyond
9: Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs
10: Uniform Bounds for Scheduling with Job Size Estimates
11: Decomposing a graph into subgraphs with small components
12: Random Subgraph Detection Using Queries
13: Deterministic Algorithms for the Hidden Subgroup Problem
14: A Recursive Algorithm for Solving Simple Stochastic Games
15: Graph Generation: A New Approach to Solving Expanded Linear Programming Relaxations
16: Is this the simplest (and most surprising) sorting algorithm ever?
17: FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns
18: Clique percolation method: memory efficient almost exact communities
19: An Efficient Procedure for Mining Egocentric Temporal Motifs
20: Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games
21: Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
22: Inferring Hidden Structures in Random Graphs
23: Extensions of Karger’s Algorithm: Why They Fail in Theory and How They Are Useful in Practice
24: Label differential privacy via clustering
25: How to Query An Oracle? Efficient Strategies to Label Data
26: Approximate $\mathrm{CVP}$ in time $2^{0.802 \, n}$ – now in any norm!
27: Periodic Reranking for Online Matching of Reusable Resources
28: An Improved Approximation for Maximum $k$-Dependent Set on Bipartite Graphs
29: More on Change-Making and Related Problems
30: A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials
31: A logical approach for temporal and multiplex networks analysis
32: Profile-based optimal stable matchings in the Roommates problem
33: Towards Non-Uniform k-Center with Constant Types of Radii
34: Subquadratic-time algorithm for the diameter and all eccentricities on median graphs
35: Tight bounds for counting colorings and connected edge sets parameterized by cutwidth
36: Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
37: Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
38: Coresets for Kernel Clustering
39: Robust Generalized Method of Moments: A Finite Sample Viewpoint
40: Faster algorithm for Unique $(k,2)$-CSP
41: Optimal (Euclidean) Metric Compression
42: Coresets for Decision Trees of Signals
43: Polynomial Turing Kernels for Clique with an Optimal Number of Queries
44: Finding popular branchings in vertex-weighted digraphs