1: Proportional Representation in Vote Streams
2: Binary Search in Graphs Revisited
3: Defective Coloring on Classes of Perfect Graphs
4: On the Power of Learning from $k$-Wise Queries
5: Algorithms and Bounds for Very Strong Rainbow Coloring
6: Fast k-Nearest Neighbour Search via Prioritized DCI
7: Truth and Regret in Online Scheduling
8: On the NP-hardness of scheduling with time restrictions
9: Faster truncated integer multiplication
10: A resource-frugal probabilistic dictionary and applications in bioinformatics
11: Even faster sorting of (not only) integers
12: Exact algorithms for the order picking problem
13: Robust Communication-Optimal Distributed Clustering Algorithms
14: Being Robust (in High Dimensions) Can Be Practical
15: Improved Deterministic Distributed Matching via Rounding
16: On the Fine-grained Complexity of One-Dimensional Dynamic Programming
17: Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets
18: When Hashes Met Wedges: A Distributed Algorithm for Finding High Similarity Vectors
19: Give Me Some Slack: Efficient Network Measurements
20: Sharp bounds for population recovery
21: 4/3 Rectangle Tiling lower bound
22: Machine Learning Friendly Set Version of Johnson-Lindenstrauss Lemma
23: Using Matching to Detect Infeasibility of Some Integer Programs
24: Distributed Partial Clustering
25: Greed Works – Online Algorithms For Unrelated Machine Stochastic Scheduling
26: Conditional Hardness for Sensitivity Problems
27: Approximation algorithms for TSP with neighborhoods in the plane
28: Parameterized complexity of finding a spanning tree with minimum reload cost diameter
29: Frequent Query Matching in Dynamic Data Warehousing
30: Decomposable Submodular Function Minimization: Discrete and Continuous
31: Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem
32: A randomized, efficient algorithm for 3SAT
33: Near-Optimal Closeness Testing of Discrete Histogram Distributions
34: Distributed Exact Shortest Paths in Sublinear Time
35: Cheshire: An Online Algorithm for Activity Maximization in Social Networks
36: Guarantees for Greedy Maximization of Non-submodular Functions with Applications
37: Space-efficient K-MER algorithm for generalized suffix tree
38: Graph sketching-based Space-efficient Data Clustering
39: A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities