1: A Unifying Model for Representing Time-Varying Graphs
2: Representative Families: A Unified Tradeoff-Based Approach
3: Tree 3-spanners of diameter at most 5
4: Local Algorithms for Sparse Spanning Graphs
5: Privately Solving Linear Programs
6: Dynamic Matching Market Design
7: Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
8: Throughput Maximization in Multiprocessor Speed-Scaling
9: Best of Two Local Models: Local Centralized and Local Distributed Algorithms
10: Testing probability distributions underlying aggregated data
11: Scalable Kernel Clustering: Approximate Kernel k-means
12: Simple parallel and distributed algorithms for spectral graph sparsification
13: Representative Sets of Product Families
14: IMRank: Influence Maximization via Finding Self-Consistent Ranking
15: Dimensionality reduction with subgaussian matrices: a unified theory
16: Near-Linear Query Complexity for Graph Inference
17: Minority Becomes Majority in Social Networks
18: Threshold and Symmetric Functions over Bitmaps
19: Energy-efficient algorithms for non-preemptive speed-scaling
20: A reclaimer scheduling problem arising in coal stockyard management
21: An Improved Algorithm for Fixed-Hub Single Allocation Problem
22: On the Hardness of Signaling
23: Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games)
24: The Complexity of Ferromagnetic Two-spin Systems with External Fields
25: Morphing Planar Graph Drawings Optimally
26: FPTAS for Weighted Fibonacci Gates and Its Applications
27: On Coloring Resilient Graphs
28: Symbiosis of Search and Heuristics for Random 3-SAT
29: Concurrent Cube-and-Conquer
30: Compressed bitmap indexes: beyond unions and intersections
31: The Power of Duples (in Self-Assembly): It’s Not So Hip To Be Square
32: Spatial Mixing of Coloring Random Graphs
33: Sparse Quantile Huber Regression for Efficient and Robust Estimation
34: Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
35: Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
36: Near-optimal-sample estimators for spherical Gaussian mixtures
37: Shortest Paths in Intersection Graphs of Unit Disks
38: Sub-Modularity of Waterfilling with Applications to Online Basestation Allocation
39: Vertex Cover Reconfiguration and Beyond
40: Arbitrary Transmission Power in the SINR Model: Local Broadcasting, Coloring and MIS
41: Beyond Geometry : Towards Fully Realistic Wireless Models
42: Distribution-Independent Reliable Learning
43: An Analysis of Rank Aggregation Algorithms
44: A Polynomial Time Solution to the Clique Problem