1: Secretary Problems with Non-Uniform Arrival Order
2: Multilayer Hadamard Decomposition of Discrete Hartley Transforms
3: On the Greedy Algorithm for Combinatorial Auctions with a Random Order
4: Querying for Paths in Graphs using Context-Free Path Queries
5: Context-free Algorithms
6: An improved lower bound for one-dimensional online unit clustering
7: Simple Distributed Delta + 1 Coloring in the SINR Model
8: A Distributed Message-Optimal Assignment on Rings
9: Derandomized Construction of Combinatorial Batch Codes
10: Dynamic DFS Tree in Undirected Graphs: breaking the $O(m)$ barrier
11: List Colouring Big Graphs On-Line
12: Fast integer multiplication using generalized Fermat primes
13: Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
14: Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments
15: Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
16: A Compressed-Gap Data-Aware Measure
17: The Hardness of Approximation of Euclidean k-means
18: Construction and impromptu repair of an MST in a distributed network with o(m) communication
19: A Fast Distributed Stateless Algorithm for $\alpha$-Fair Packing Problems
20: Locating a Tree in a Phylogenetic Network in Quadratic Time
21: Spectral Sparsification of Random-Walk Matrix Polynomials
22: Semi-dynamic connectivity in the plane
23: Reassembling trees for the traveling salesman
24: Adaptive Search over Sorted Sets
25: Communication Efficient Algorithms for Top-k Selection Problems
26: Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
27: Uniform Kernelization Complexity of Hitting Forbidden Minors
28: Near-optimal adjacency labeling scheme for power-law graphs
29: A local strategy for cleaning expanding cellular domains by simple robots
30: Parameterized Complexity of Secluded Connectivity Problems
31: Local Computation Algorithms for Graphs of Non-Constant Degrees
32: Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts