1: Computing the rearrangement distance of natural genomes
2: Data Structure Primitives on Persistent Memory: An Evaluation
3: Equivalence Classes and Conditional Hardness in Massively Parallel Computations
4: Induced odd cycle packing number, independent sets, and chromatic number
5: Easy Capacitated Facility Location Problems, with Connections to Lot-Sizing
6: Hypergraph Cuts with General Splitting Functions
7: Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets
8: Improved Analysis of Higher Order Random Walks and Applications
9: Achieving Competitiveness in Online Problems
10: Maximizing diversity over clustered data
11: Parameterized Complexity of Geodetic Set
12: Online Minimum Cost Matching on the Line with Recourse
13: Forming Compatible Teams in Signed Networks
14: Age-Partitioned Bloom Filters
15: Improved Kernels for Tracking Path Problem
16: Assignment-based Path Choice Estimation for Metro Systems Using Smart Card Data
17: On Polynomial Modular Number Systems over $\mathbb{Z}/p\mathbb{Z}$
18: Accelerating Forward and Backward Private Searchable Encryption Using Trusted Execution
19: Minimum $2$-vertex-twinless connected spanning subgraph problem
20: Grundy Coloring & friends, Half-Graphs, Bicliques
21: Exploiting Database Management Systems and Treewidth for Counting
22: Structural Decompositions of Epistemic Logic Programs
23: Universal Algorithms for Parity Games and Nested Fixpoints
24: Backward Feature Correction: How Deep Learning Performs Deep (Hierarchical) Learning
25: Scattering and Sparse Partitions, and their Applications
26: Fast Generation of Big Random Binary Trees
27: Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
28: Optimal Approximate Sampling from Discrete Probability Distributions
29: Online Scheduling with Makespan Minimization: State of the Art Results, Research Challenges and Open Problems
30: Simulation computation in grammar-compressed graphs
31: How fast do quantum walks mix?