1: Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
2: Testable Bounded Degree Graph Properties Are Random Order Streamable
3: Engineering fast multilevel support vector machines
4: Greedy Shortest Common Superstring Approximation in Compact Space
5: Many-Objective Pareto Local Search
6: Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
7: Restricted Eigenvalue from Stable Rank with Applications to Sparse Linear Regression
8: Persistent Cache-oblivious Streaming Indexes
9: Fast Label Extraction in the CDAWG
10: The 2D Tree Sliding Window Discrete Fourier Transform
11: Estimating parameters associated with monotone properties
12: A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
13: Polynomial-Time Approximation Schemes for k-Center and Bounded-Capacity Vehicle Routing in Graphs with Bounded Highway Dimension
14: A Change-Sensitive Algorithm for Maintaining Maximal Bicliques in a Dynamic Bipartite Graph
15: Practical Adversarial Combinatorial Bandit Algorithm via Compression of Decision Sets
16: MST in O(1) Rounds of the Congested Clique
17: Fast Distributed Approximation for Max-Cut
18: A Naive Algorithm for Feedback Vertex Set
19: Vertex Deletion Problems on Chordal Graphs
20: An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem
21: A Quantum Approach to Subset-Sum and Similar Problems
22: Ramsey Spanning Trees and their Applications
23: Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes
24: Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges
25: Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem