1: Certifying coloring algorithms for graphs without long induced paths
2: On Sampling from Massive Graph Streams
3: Exact MAP Inference by Avoiding Fractional Vertices
4: Leveraging Sparsity for Efficient Submodular Data Summarization
5: Stream Aggregation Through Order Sampling
6: MSF and Connectivity in Limited Variants of the Congested Clique
7: $K$-Best Solutions of MSO Problems on Tree-Decomposable Graphs
8: The Half-integral Erd"os-P'osa Property for Non-null Cycles
9: Constrained clustering via diagrams: A unified theory and its applications to electoral district design
10: Quickest Visibility Queries in Polygonal Domains
11: Juggling Functions Inside a Database
12: On low rank-width colorings
13: Combinatorial Auctions with Online XOS Bidders
14: Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
15: The Densest Subgraph Problem with a Convex/Concave Size Function
16: A note on approximate strengths of edges in a hypergraph
17: Markov Chain Lifting and Distributed ADMM
18: Core Maintenance in Dynamic Graphs: A Parallel Approach based on Matching
19: On Solving Travelling Salesman Problem with Vertex Requisitions
20: Toward an enumeration of unlabeled trees
21: The Weighted Matching Approach to Maximum Cardinality Matching
22: Locality-sensitive hashing of curves
23: Bernoulli Factories and Black-Box Reductions in Mechanism Design
24: Improved approximation algorithms for $k$-connected $m$-dominating set problems
25: On the Transformation Capability of Feasible Mechanisms for Programmable Matter
26: Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane