PDF Format
Plain Text
Approx-2014 Accepted Papers Computing opaque interior barriers \`{a} la Shermer
Power of Preemption on Uniform Parallel Machines
Robust Approximation of Temporal CSP
Sherali-Adams gaps, flow-cover inequalities and generalized configurations for capacity-constrained Facility Location
Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
Constrained Monotone Function Maximization and the Supermodular Degree
Reaching Consensus via non-Bayesian Asynchronous Learning in Social Networks
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion
The cover number of a matrix and its algorithmic applications
Online Set Cover with Set Requests
An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
Universal Factor Graphs for every NP-hard Boolean CSP
Lowest Degree k-Spanner: Approximation and Hardness
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching
A 9/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
Lower Bounds on Expansion of Graph Powers
Network Design with Coverage Costs
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree
Improved Approximation Algorithm for Steiner $k$-Forest with Nearly Uniform Weights
Approximate pure Nash equilibria in weighted congestion games
Approximation Algorithms for Minimum-Load $k$-Facility Location
Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture
Complexity and Approximation of the Continuous Network Design Problem
Guruswami-Sinop Rounding without Higher Level Lasserre
Gap Amplification for Small-Set Expansion via Random Walks Complexity of Certifying Restricted Isometry Property and Sparse Cheeger's Inequality
Robust appointment scheduling
Fully Dynamic All-Pairs Shortest Paths: Breaking the $O(n)$ Barrier
Discrepancy Without Partial Colorings
Parity is Positively Useless
Random-2014 Accepted Papers Smoothed analysis on connected graphs
Absorption Time of the Moran Process
On Multiple Input Problems in Property Testing
Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
List decoding group homomorphisms between solvable groups
Two Sides of the Coin Problem
It's a Small World for Random Surfers
Space Pseudorandom Generators by Communication Complexity Lower Bounds
Average case polyhedral complexity of the maximum stable set problem
Explicit rank-metric codes list-decodable with optimal redundancy
Unidirectional Input/Output Streaming Complexity of Reversal and Sorting
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Nonuniqueness Region
An approximate version of the tree packing conjecture via random embeddings
On sharp thresholds in random geometric graphs
The Complexity of Ferromagnetic Two-spin Systems with External Fields
An Optimal Algorithm for Large Frequency Moments Using O(n^1-2/k) Bits
Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power
The Power of Super-logarithmic Number of Players
Local Algorithms for Sparse Spanning Graphs
Deterministic Coupon Collection and Better Strong Dispersers
The condensation phase transition in random graph coloring
Communication Complexity of Set-Disjointness for All Probabilities
Pseudorandomness and Fourier Growth Bounds for Width 3 Branching Programs
On Reconstructing a Hidden Permutation
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
Woodruff and Grigory Yaroslavtsev . Certifying Equality With Limited Interaction
Global and Local Information in Clustering Labeled Block Models
The Information Complexity of Hamming Distance
Embedding Hard Learning Problems into Gaussian Space
Exchangeability and realizability: de Finetti theorems on graphs
|
