1: Domination above r-independence: does sparseness help?
2: Faster FPT Algorithm for 5-Path Vertex Cover
3: Multidimensional Dominance Drawings
4: $\text{#NFA}$ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes
5: Collective Mobile Sequential Recommendation: A Recommender System for Multiple Taxicabs
6: Algorithms for Similarity Search and Pseudorandomness
7: Learning partial correlation graphs and graphical models by covariance queries
8: Dynamic Maximal Independent Set
9: 2-Edge-Connectivity and 2-Vertex-Connectivity of an Asynchronous Distributed Network
10: l-path vertex cover is easier than l-hitting set for small l
11: Constant Amortized Time Enumeration of Independent Sets for Graphs with Bounded Clique Number
12: Dynamic Palindrome Detection
13: On Strong Diameter Padded Decompositions
14: Fully Dynamic Spectral Vertex Sparsifiers and Applications
15: Algorithms for deletion problems on split graphs
16: Distribution-Independent PAC Learning of Halfspaces with Massart Noise
17: Flows in Almost Linear Time via Adaptive Preconditioning
18: Quantum speedup of branch-and-bound algorithms
19: Survey of Information Encoding Techniques for DNA
20: Krivine diffusions attain the Goemans–Williamson approximation ratio
21: Complexity of Highly Parallel Non-Smooth Convex Optimization
22: Upper and Lower Bounds on Approximating Weighted Mixed Domination
23: Lawn: an Unbound Low Latency Timer Data Structure for Large Scale, High Throughput Systems
24: Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
25: Combinatorial Algorithms for String Sanitization
26: The Complexity of Helly-$B_{1}$ EPG Graph Recognition
27: Making a Sieve Random: Improved Semi-Streaming Algorithm for Submodular Maximization under a Cardinality Constraint
28: The Adversarial Robustness of Sampling
29: Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detection
30: A Tight Analysis of Greedy Yields Subexponential Time Approximation for Uniform Decision Tree
31: Vector Programming Using Generative Recursion
32: Improved Distributed Approximations for Maximum Independent Set
33: Efficient algorithms for modifying and sampling from a categorical distribution
34: The shocklet transform: A decomposition method for the identification of local, mechanism-driven dynamics in sociotechnical time series
35: K-Core Maximization through Edge Additions
36: A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint
37: Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies
38: Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond
39: Generating Normal Networks via Leaf Insertion and Nearest Neighbor Interchange
40: PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors
41: Improving and benchmarking of algorithms for decision making with lower previsions