1: Introduction to local certification
2: Bounded Degree Group Steiner Tree Problems
3: A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
4: Reconstruction of time-consistent species trees
5: Real-time Bidding campaigns optimization using attribute selection
6: Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-connectivity
7: Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products
8: Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
9: Derivation and Analysis of Fast Bilinear Algorithms for Convolution
10: Practical Repetition-Aware Grammar Compression
11: Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game
12: An Adaptive Step Toward the Multiphase Conjecture
13: Optimal Analysis of Subset-Selection Based L_p Low Rank Approximation
14: Solving Parity Games Using An Automata-Based Algorithm
15: Group Centrality Maximization for Large-scale Graphs
16: On a Decentralized $(\Delta{+}1)$-Graph Coloring Algorithm
17: Superset Technique for Approximate Recovery in One-Bit Compressed Sensing
18: Learning-Based Low-Rank Approximations
19: Use of R-trees to improve reconstruction time in pixel trackers
20: Improved Bounds for Track Numbers of Planar Graphs
21: Improved Local Computation Algorithm for Set Cover via Sparsification
22: Iterative Hessian Sketch in Input Sparsity Time
23: Faster Energy Maximization for Faster Maximum Flow
24: Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
25: Efficient Synthesis of Weighted Marked Graphs with Circular Reachability Graph, and Beyond
26: ALLSAT compressed with wildcards: Frequent Set Mining