1: Superconcentration on a Pair of Butterflies
2: Minimizing Flow-Time on Unrelated Machines
3: How Best to Handle a Dicey Situation
4: A Comparative Study on String Matching Algorithm of Biological Sequences
5: GPU-Accelerated BWT Construction for Large Collection of Short Reads
6: Space-efficient Verifiable Secret Sharing Using Polynomial Interpolation
7: A Faster Parameterized Algorithm for Treedepth
8: Experimental Evaluation of Algorithms for the Food-Selection Problem
9: Linear-Time Algorithms for the Paired-Domination Problem in Interval Graphs and Circular-Arc Graphs
10: A New Approach to Analyzing Robin Hood Hashing
11: Graph matching: relax or not?
12: Powers of Tensors and Fast Matrix Multiplication
13: ReducedCBT and SuperCBT, Two New and Improved Complete Binary Tree Structures
14: Increasing precision of uniform pseudorandom number generators
15: Balancing lists: a proof pearl
16: Loopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation
17: How to Influence People with Partial Incentives
18: An exact column-generation approach for the lot-type design problem – extended abstract
19: Shortest node-disjoint paths on random graphs
20: Competitive learning of monotone Boolean functions