1Computing all maps into a sphere
11The maximum number of faces of the Minkowski sum of two convex polytopes
29Polytope Approximation and the Mahler Volume
43Dimension reduction for finite trees in l_1
51On Multiplicative λ-Approximations and some Geometric Applications
68Kernelization of Packing Problems
82Linear Kernels for (Connected) Dominating Set on H-minor-free graphs
94Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
104Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization
114Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem
123Popularity vs Maximum cardinality in the stable marriage setting
135A Matroid Approach to Stable Matchings with Lower Quotas
143On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme
157Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation
168Private Data Release Via Learning Thresholds
188Structural and Logical Approaches to the Graph Isomorphism Problem.
189Near Linear Time (1 + ε)-Approximation for Restricted Shortest Paths in Undirected Graphs
202Approximate Distance Oracles with Improved Preprocessing Time
209Exact Distance Oracles for Planar Graphs
223Single source distance oracle for planar digraphs avoiding a failed node or link
233Physarum Can Compute Shortest Paths
241The condensation transition in random hypergraph 2-coloring
251A new approach to the orientation of random hypergraphs
265The MAX-CUT of sparse random graphs
272A simple algorithm for random colouring G(n, d/n) using (2+\ε)d colours.
281The Maximum Degree of Random Planar Graphs
288Computing distance between piecewise linear bivariate functions
294Packing anchored rectangles
306Algorithms and Data Structures for the Transportation Problem in Geometric Settings
318Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts
338Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
356The Entropy Rounding Method in Approximation Algorithms
373Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies
388Polynomial integrality gaps for strong SDP relaxations of Densest k-Subgraph
406Linear Index Coding via Semidefinite Programming
420Concentration Inequalities for Nonlinear Matroid Intersection
437Concentration and Moment Inequalities for Polynomials of Independent Random Variables
447Width of Points in the Streaming Model
453The Shifting Sands Algorithm
459Analyzing Graph Structure via Linear Measurements
468On the communication and streaming complexity of maximum bipartite matching
486Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
502SINR Diagram with Interference Cancellation
516Wireless Connectivity and Capacity
541Stochastic coalescence in logarithmic time
551Towards Robust and Efficient Computation in Dynamic Peer-to-Peer Networks
570Using Hashing to Solve the Dictionary Problem (In External Memory)
583I/O-Efficient Data Structures for Colored Range and Prefix Reporting
593Confluent Persistence Revisited
615A Little Advice Can Be Very Helpful
626An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
639A Polynomial-time Approximation Scheme for Planar Multiway Cut
656Finding an induced path of given parity in planar graphs in polynomial time
671Spanning closed walks and TSP in 3-connected planar graphs
683Approximate Tree Decompositions of Planar Graphs in Linear Time
699Bypassing UGC from some Optimal Geometric Inapproximability Results
718Inapproximability Results for the Multi-level Uncapacitated Facility Location Problem
735On the hardness of pricing loss leaders
750The complexity of conservative valued CSPs
760The Set of Solutions of Random XORSAT Formulae
Belief Propagation Algorithms: From Matching to Cancer Genomics.
780Approximation Algorithms and Hardness of the k-Route Cut Problem
800Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case
811On a Linear Program for Minimum-Weight Triangulation
824Constant Factor Approximation Algorithm for the Knapsack Median Problem
833Subquadratic time approximation algorithms for the girth
846A Universally-truthful Approximation Scheme for Multi-unit Auctions
856Optimal Crowdsourcing Contests
869Sequential Auctions and Externalities
887Mechanism Designs via Consensus Estimate and Cross-Check
896Black-Box Reductions for Cost-Sharing Mechanism Design
914Counting Perfect Matchings as Fast as Ryser
922Approximate Counting via Correlation Decay in Spin Systems
941Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
954Approximating Fixation Probabilities in the Generalized Moran Process
961A Satisfiability Algorithm for AC0
973The Notion of a Rational Convex Program, and an Algorithm for the Arrow-Debreu Nash Bargaining Game
993Beyond Myopic Best Response (in Cournot Competition)
1006Metastability of Logit Dynamics for Coordination Games
1025Sketching Valuation Functions
1036Voting with Limited Information and Many Alternatives
1056Partial match queries in random quadtrees
1066Top-κ Document Retrieval in Optimal Time and Linear Space
1078LSH-Preserving Functions and Their Applications
1095A Linear Time Algorithm for Seeds Computation
1113Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
1123A Near-Optimal Sublinear-Time Algorithm for Approximating the Minimum Vertex Cover Size
1132Space-efficient Local Computation Algorithms
1140Testing Odd-Cycle-Freeness in Boolean Functions
1150Networks Cannot Compute Their Diameter in Sublinear Time
1163Parallelism and Time in Hierarchical Self-Assembly
1183Simple and Practical Algorithm for Sparse Fourier Transform
1195Sparser Johnson-Lindenstrauss Transforms
1207Optimal Column-Based Low-Rank Matrix Reconstruction
1215Sublinear Time, Measurement-Optimal, Sparse Recovery For All
1228Resource Augmentation for Weighted Flow-time explained by Dual Fitting
1242Scheduling Heterogeneous Processors Isn't As Easy As You Think
1254Online Scheduling with General Cost Functions
1266Race to Idle: New Algorithms for Speed Scaling with a Sleep State
1286A Faster Algorithm to Recognize Even-Hole-Free Graphs
1298Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
1309Global Minimum Cuts in Surface Embedded Graphs
1319Competitive Routing in the Half-θ6-Graph
1329A Near-Linear Algorithm for Projective Clustering Integer Points
1343Data reduction for weighted and outlier-resistant clustering
1355Local Homology Transfer and Stratification Learning
1371Learning k-Modal Distributions via Testing
1386An O(n2) Time Algorithm for Alternating Büchi Games
1400Efficient Algorithms for Maximum Weight Matchings in General Graphs with Small Edge Weights
1413A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs
1425List-Coloring Graphs without Subdivisions and without Immersions
1436Fast zeta transforms for point lattices
1457Constructing high order elements through subspace polynomials
1464Improved Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication
1477A Proof of the Boyd-Carr Conjecture
1487Traffic-redundancy aware network design
1499Approximating Rooted Steiner Networks
1512Matroidal Degree-Bounded Minimum Spanning Trees
1522Approximation Algorithms for Stochastic Orienteering
1539Expanders are Universal for the Class of all Spanning Trees
1552Directed Nowhere Dense Classes of Graphs
1563Bidimensionality and Geometric Graphs
1576Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling
1586Submodular Functions are Noise Stable
1593Random Walks, Electric Networks and The Transience Class problem of Sandpiles
1612Information Dissemination via Random Walks in d-Dimensional Space
1623Rumor Spreading and Vertex Expansion
1642Ultra-Fast Rumor Spreading in Social Networks
1661The mixing time of the Newman--Watts small world
1669Outperforming LRU via Competitive Analysis on Parametrized Inputs for Paging
1681An O(log k)-competitive Algorithm for Generalized Caching
1690Simultaneous Approximations for Adversarial and Stochastic Online Budgeted Allocation
1702Improved Competitive Ratio for the Matroid Secretary Problem
1713Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
1737Subexponential Parameterized Algorithm for Minimum Fill-in