1: Binary Decision Diagrams for Bin Packing with Minimum Color Fragmentation
2: Semi-Online Bipartite Matching
3: Universal Streaming of Subset Norms
4: Locally Consistent Parsing for Text Indexing in Small Space
5: Link Delay Estimation Using Sparse Recovery for Dynamic Network Tomography
6: Distributed mining of time–faded heavy hitters
7: Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations
8: Analysing the Robustness of Evolutionary Algorithms to Noise: Refined Runtime Bounds and an Example Where Noise is Beneficial
9: On learning with shift-invariant structures
10: Hypergraph matching for MU-MIMO user grouping in wireless LANs
11: Online scheduling of jobs with favorite machines
12: Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring
13: Performance of the smallest-variance-first rule in appointment sequencing
14: Target Set Selection parameterized by vertex cover and more
15: A Parallel Double Greedy Algorithm for Submodular Maximization
16: Diameter Spanners, Eccentricity Spanners, and Approximating Extremal Distances
17: Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
18: Hard combinatorial problems and minor embeddings on lattice graphs
19: Improving Similarity Search with High-dimensional Locality-sensitive Hashing
20: Voting and Bribing in Single-Exponential Time
21: Correlation Clustering in Data Streams
22: Simple, Fast and Practicable Algorithms for Cholesky, LU and QR Decomposition Using Fast Rectangular Matrix Multiplication
23: Rapid mixing of path integral Monte Carlo for 1D stoquastic Hamiltonians
24: Characterization and space embedding of directed graphs and social networks through magnetic Laplacians
25: A Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals
26: A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks
27: On the Enumeration and Counting of Bicriteria Temporal Paths
28: Compression with wildcards: Abstract simplicial complexes
29: Distributed Weight Balancing in Directed Topologies
30: Confirmation Sampling for Exact Nearest Neighbor Search
31: Differentially Private Fair Learning
32: An Improved Cost Function for Hierarchical Cluster Trees
33: Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
34: Approximate Calculation of Tukey’s Depth and Median With High-dimensional Data