1: Bayesian Generalized Network Design
2: Approximate $\mathbb{F}_2$-Sketching of Valuation Functions
3: Exponential-time quantum algorithms for graph coloring problems
4: Learning to Link
5: Online Multidimensional Packing Problems in the Random-Order Model
6: Space-Efficient Vertex Separators for Treewidth
7: The directed 2-linkage problem with length constraints
8: Graph-based Nearest Neighbor Search: From Practice to Theory
9: Algorithms and data structures for matrix-free finite element operators with MPI-parallel sparse multi-vectors
10: Enumeration of Preferred Extensions in Almost Oriented Digraphs
11: On Slicing Sorted Integer Sequences
12: Representing fitness landscapes by valued constraints to understand the complexity of local search
13: On the VC-dimension of half-spaces with respect to convex sets
14: Geometric Crossing-Minimization – A Scalable Randomized Approach
15: A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles
16: Efficient Isomorphism for $S_d$-graphs and $T$-graphs
17: Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing
18: Learning from satisfying assignments under continuous distributions
19: Computing k-Modal Embeddings of Planar Digraphs
20: Cache-Friendly Search Trees; or, In Which Everything Beats std::set
21: Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
22: Generalized Assignment via Submodular Optimization with Reserved Capacity
23: Algorithms for Competitive Division of Chores
24: Accelerating Generative Neural Networks on Unmodified Deep Learning Processors – A Software Approach
25: Circular Pattern Matching with $k$ Mismatches
26: Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
27: Variance Reduction for Matrix Games
28: Towards Improving Christofides Algorithm on Fundamental Classes by Gluing Convex Combinations of Tours
29: Linear Size Sparsifier and the Geometry of the Operator Norm Ball
30: Optimal Decision Trees for the Algorithm Selection Problem: Integer Programming Based Approaches
31: Sampling Sketches for Concave Sublinear Functions of Frequencies
32: Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
33: Min-Cost Flow in Unit-Capacity Planar Graphs
34: The Alternating BWT: an algorithmic perspective
35: Optimal transport on large networks, a practitioner’s guide
36: Fixed-parameter tractability of counting small minimum $(S,T)$-cuts
37: Expansion Testing using Quantum Fast-Forwarding and Seed Sets
38: Locally Private k-Means Clustering
39: Optimization of Quantum Circuit Mapping using Gate Transformation and Commutation
40: HashGraph – Scalable Hash Tables Using A Sparse Graph Data Structure
41: Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
42: Improved local search for graph edit distance
43: Near-Optimal Fully Dynamic Densest Subgraph
44: Constant-Factor Approximation Algorithms for Parity-Constrained Facility Location Problems
45: Towards Testing Monotonicity of Distributions Over General Posets
46: Testing Mixtures of Discrete Distributions
47: Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm
48: Fast and Simple Edge-Coloring Algorithms
49: Bidirectional Text Compression in External Memory
50: Complexity of planar signed graph homomorphisms to cycles
51: Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour
52: Streaming 1.9 Billion Hypersparse Network Updates per Second with D4M