CFP.pdf 
CFP.docAccepted Papers
RANDOM 2017 Accepted Papers
The string of diamonds is tight for rumor spreading
Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic Tilings
Traveling in randomly embedded random graphs
Continuous monitoring of $\ell_p$ norms in data streams
Communication Complexity of Statistical Distance
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere
On the Expansion of Group–based Lifts
Charting the replica symmetric phase
Vertex Isoperimetry and Independent Set Stability for Tensor Powers of Cliques
Locality via partially lifted codes
Efficient Removal Lemmas for Matrices
Adaptivity is exponentially powerful for testing monotonicity of halfspaces
On some Computations on Sparse Polynomials
The Minrank of Random Graphs
Efficiently decodable codes for the binary deletion channel
Agnostic Learning from Tolerant Natural Proofs
Probabilistic logarithmic-space algorithms for Laplacian solvers
On Axis-Parallel Tests for Tensor Product Codes
Lower bounds for 2-query LCCs over large alphabet
Cutoff for a stratified random walk on the hypercube
On the Complexity of Constrained Determinantal Point Processes
Sample-based high-dimensional convexity testing
Streaming Periodicity with Mismatches
The Lovasz Theta Function for Random Regular Graphs and Community Detection in the Hard Regime
Sharper Bounds for Regularized Data Fitting
Glauber Dynamics for Ising Model on Convergent Dense Graph Sequence
Testing Hereditary Properties of Sequences
APPROX 2017 Accepted Papers
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
Approximating Unique Games Using Low Diameter Graph Decompositions
The Quest for Strong Inapproximability Results with Perfect Completeness
Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
A PTAS for Three-Edge Connectivity in Planar Graphs
Greedy Minimization of Weakly Supermodular Set Functions
Stochastic Unsplittable Flows
A Lottery Model for Center-type Problems With Outliers
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces
Renyi Entropy Estimation Revisited
Online Strip Packing with Polynomial Migration
Scheduling Problems over Network of Machines
Global and Fixed-Terminal Cuts in Digraphs
When Are Welfare Guarantees Robust?
Symmetric Interdiction for Matching Problems
Lower Bounds and Two-Sided Markets in Min-Cost Perfect Matching with Delays
On the Integrality Gap of the Prize-Collecting Steiner Forest LP
Fractional Set Cover in the Streaming Model
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
Approximating Incremental Combinatorial Optimization Problems
Density Independent Algorithms for Sparsifying $k$-Step Random Walks