1: A note on hierarchical hubbing for a generalization of the VPN problem
2: Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
3: Suffix Arrays for Spaced-SNP Databases
4: No small nondeterministic read-once branching programs for CNFs of bounded treewidth
5: Sublinear Space Algorithms for the Longest Common Substring Problem
6: Exact and approximate algorithms for movement problems on (special classes of) graphs
7: Fault-Tolerant Approximate Shortest-Path Trees
8: Enumeration of Spanning Trees Using Edge Exchange with Minimal Partitioning
9: A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State
10: On the Average-case Complexity of Pattern Matching with Wildcards
11: Transpose on vertex symmetric digraphs
12: An Enhanced Multiway Sorting Network Based on n-Sorters
13: Why do simple algorithms for triangle enumeration work in the real world?
14: Frugal Streaming for Estimating Quantiles:One (or two) memory suffices
15: Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game
16: A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph
17: Single Pass Spectral Sparsification in Dynamic Streams
18: Fast Rendezvous with Advice
19: KMC 2: Fast and resource-frugal $k$-mer counting
20: Information Gathering in Ad-Hoc Radio Networks with Tree Topology
21: Computing the flip distance between triangulations
22: Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
23: Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
24: Private Multiplicative Weights Beyond Linear Queries
25: Sampling in Space Restricted Settings
26: Improved FPT algorithms for weighted independent set in bull-free graphs