1: Robust low-rank multilinear tensor approximation for a joint estimation of the multilinear rank and the loading matrices
2: A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest
3: Faster manipulation of large quantum circuits using wire label reference diagrams
4: Incentivizing Exploration with Selective Data Disclosure
5: Communication-Optimal Distributed Dynamic Graph Clustering
6: Prophet Inequalities for I.I.D. Random Variables from an Unknown Distribution
7: Vectorized Character Counting for Faster Pattern Matching
8: Computing Quartet Distance is Equivalent to Counting 4-Cycles
9: Secretary Ranking with Minimal Inversions
10: Large-Scale Distributed Algorithms for Facility Location with Outliers
11: Unconstrained Submodular Maximization with Constant Adaptive Complexity
12: Robust recoverable 0-1 optimization problems under polyhedral uncertainty
13: Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
14: A Constructive Arboricity Approximation Scheme
15: Nearly ETH-Tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
16: A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
17: Efficient Construction of a Complete Index for Pan-Genomics Read Alignment
18: How many matchings cover the nodes of a graph?
19: Dynamic Flows with Adaptive Route Choice
20: The Preemptive Resource Allocation Problem
21: Sorting permutations with a transposition tree
22: Testing local properties of arrays
23: Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint
24: Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols
25: Approximate Eigenvalue Decompositions of Linear Transformations with a Few Householder Reflectors
26: Fast submodular maximization subject to k-extendible system constraints
27: How to Use Heuristics for Differential Privacy
28: Experimental Evaluation of Parameterized Algorithms for Graph Separation Problems: Half-Integral Relaxations and Matroid-based Kernelization
29: A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
30: Efficient random graph matching via degree profiles
31: Experimental evaluation of kernelization algorithms to Dominating Set
32: Non-submodular Function Maximization subject to a Matroid Constraint, with Applications
33: Private Selection from Private Candidates
34: Improved Quantum Multicollision-Finding Algorithm
35: Approximation Algorithm for the Partial Set Multi-Cover Problem
36: Simulating Random Walks on Graphs in the Streaming Model
37: A general framework for handling commitment in online throughput maximization
38: On a hypergraph probabilistic graphical model
39: Gen-Oja: A Two-time-scale approach for Streaming CCA
40: Tight Approximation Ratio for Minimum Maximal Matching
41: On compact representations of Voronoi cells of lattices
42: Breaking symmetries to rescue Sum of Squares in the case of makespan scheduling