1: Maximum Cut Parameterized by Crossing Number
2: Modified log-Sobolev inequalities for strongly log-concave distributions
3: The Parameterized Position Heap of a Trie
4: Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
5: Subset Selection for Matrices with Fixed Blocks
6: Deterministic Approximation of Random Walks in Small Space
7: A Faster Algorithm Enumerating Relevant Features over Finite Fields
8: scaleBF: A High Scalable Membership Filter using 3D Bloom Filter
9: Proportionally dense subgraph of maximum size: complexity and approximation
10: Dynamic Planar Point Location in External Memory
11: On-Line Balancing of Random Inputs
12: k-Means Clustering of Lines for Big Data
13: HexaShrink, an exact scalable framework for hexahedral meshes with attributes and discontinuities: multiresolution rendering and storage of geoscience models
14: Token Swapping on Trees
15: Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
16: The Norms of Graph Spanners
17: Quadratic speedup for finding marked vertices by quantum walks
18: Shed More Light on Bloom Filter’s Variants
19: Counting independent sets and colorings on random regular bipartite graphs
20: Morphing Contact Representations of Graphs
21: QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations
22: A Truthful Cardinal Mechanism for One-Sided Matching
23: How Hard Is Robust Mean Estimation?
24: Upward Book Embeddings of st-Graphs
25: A New Lower Bound for Semigroup Orthogonal Range Searching
26: Independent Range Sampling, Revisited Again
27: The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs
28: Faster Algorithms for the Geometric Transportation Problem
29: A Novel Dynamic Programming Approach to the Train Marshalling Problem
30: RAIRE: Risk-Limiting Audits for IRV Elections
31: Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices
32: Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
33: Parallel Batch-Dynamic Graph Connectivity
34: An empirical analysis of exact algorithms for the unbounded knapsack problem