1: $k$-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits
2: Generic Partition Refinement and Weighted Tree Automata
3: Dispersing obnoxious facilities on a graph
4: Approximate Multi-Matroid Intersection via Iterative Refinement
5: Tight Approximation for Unconstrained XOS Maximization
6: Utilizing Dynamic Properties of Sharing Bits and Registers to Estimate User Cardinalities over Time
7: REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
8: Better Bounds for Online Line Chasing
9: High-Dimensional Robust Mean Estimation in Nearly-Linear Time
10: Your Rugby Mates Don’t Need to Know your Colleagues: Triadic Closure with Edge Colors
11: What is known about Vertex Cover Kernelization?
12: A lower bound for online rectangle packing
13: MEMOIR: Multi-class Extreme Classification with Inexact Margin
14: Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
15: Parallel approach to sliding window sums
16: FPTAS for barrier covering problem with equal circles in 2D
17: On the cost of essentially fair clusterings
18: Clustering Residential Electricity Load Curves via Community Detection in Network
19: $HS^2$: Active Learning over Hypergraphs
20: Analysis of large sparse graphs using regular decomposition of graph distance matrices
21: An optimized Parallel Failure-less Aho-Corasick algorithm for DNA sequence matching
22: Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations
23: The Batched Set Cover Problem
24: A Schur Complement Cheeger Inequality
25: Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression
26: An Optimal Space Lower Bound for Approximating MAX-CUT
27: Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem
28: Systematic Exploration of the High Likelihood Set of Phylogenetic Tree Topologies
29: An Analytical Approach to Improving Time Warping on Multidimensional Time Series
30: The Structure of Optimal Private Tests for Simple Hypotheses
31: Node Diversification in Complex Networks by Decentralized Coloring
32: A Note on Random Sampling for Matrix Multiplication
33: Scaling Configuration of Energy Harvesting Sensors with Reinforcement Learning
34: Attendance Maximization for Successful Social Event Planning
35: Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems
36: Efficient Measuring of Congruence on High Dimensional Time Series