pdf 
txt
Accepted Papers
Accepted Papers for Approx 2016
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One
LP-relaxations for Tree Augmentation
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy
Near-Optimal UGC-hardness of Approximating Max \(k\)-CSP\(_R\)
A Bi-Criteria Approximation Algorithm for \(k\)-Means
Hardness of Approximation for H-free Edge Modification Problems
Planar Matching in Streams Revisited
Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources
Computing approximate PSD factorizations
Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
Online Row Sampling
Proving Weak Approximability without Algorithms
Oblivious Rounding and the Integrality Gap
Online Energy Storage Management: an Algorithmic Approach
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs
A Competitive Flow Time Algorithm for Heterogeneous Clusters under Polytope Constraints
The Densest \(k\)-Subhypergraph Problem
Revisiting Connected Dominating Sets: An Optimal Local Algorithm?
Constant-distortion embeddings of Hausdorff metrics into constant-dimensional \(\ell_p\) spaces
On Approximating Target Set Selection
Accepted Papers for Random 2016
The Condensation Phase Transition in the Regular \(k\)-SAT Model
Counting Hypergraph Matchings up to Uniqueness Threshold
Sampling in Potts Model on Sparse Random Graphs
Lower Bounds on Same-Set Inner Product in Correlated Spaces
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems
On the Beck-Fiala Conjecture for Random Set Systems
An \(\tilde{O}(n)\) Queries Adaptive Tester for Unateness
Stable Matching with Evolving Preferences
Fast Synchronization of Random Automata
On Polynomial Approximations to AC\(^0\)
Bounded Independence vs Moduli
A Direct-sum Theorem for Read-Once Branching Programs
Approximating Subadditive Hadamard Functions on Implicit Matrices
Higher-order Fourier Analysis over non-prime fields
Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings
A Local Algorithm for Constructing Spanners in Minor-Free Graphs
Every Property of Outerplanar Graphs is Testable
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels
The Niceness of Unique Sink Orientations
Lower Bounds for CSP Refutation by SDP Hierarchies
A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian
Belief Propagation on Replica Symmetric Random Factor Graph Models
Local Convergence and Stability of Tight Bridge-Addable Graph Classes
On the Structure of Quintic Polynomials
Bounds on the Norms of Uniform Low Degree Graph Matrices
Estimating Parameters Associated with Monotone Properties
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem