Abstract is missing.
- Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors [doi]
- On Guillotine Cutting SequencesFidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese. 1-19 [doi]
- Approximate Nearest Neighbor Search in Metrics of Planar GraphsIttai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder. 20-42 [doi]
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via ShrinkingAnna Adamaszek, Parinya Chalermsook, Andreas Wiese. 43-60 [doi]
- Non-Uniform Robust Network Design in Planar GraphsDavid Adjiashvili. 61-77 [doi]
- Large Supports are Required for Well-Supported Nash EquilibriaYogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu. 78-84 [doi]
- Minimizing Maximum Flow-time on Related MachinesNikhil Bansal, Bouke Cloostermans. 85-95 [doi]
- A 2-Competitive Algorithm For Online Convex Optimization With Switching CostsNikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, Clifford Stein. 96-109 [doi]
- Beating the Random Assignment on Constraint Satisfaction Problems of Bounded DegreeBoaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright. 110-123 [doi]
- Improved Bounds in Stochastic Matching and OptimizationAlok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu. 124-134 [doi]
- Fully Dynamic Bin Packing Revisited Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein. 135-151 [doi]
- Approximate Hypergraph Coloring under Low-discrepancy and Related PromisesVijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee. 152-174 [doi]
- Stochastic and Robust Scheduling in the CloudLin Chen, Nicole Megow, Roman Rischke, Leen Stougie. 175-186 [doi]
- On Approximating Node-Disjoint Paths in GridsJulia Chuzhoy, David H. K. Kim. 187-211 [doi]
- Approximating Upper Degree-Constrained Partial OrientationsMarek Cygan, Tomasz Kociumaka. 212-224 [doi]
- Approximating Hit Rate Curves using Streaming AlgorithmsZachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, Jake Wires. 225-241 [doi]
- Terminal EmbeddingsMichael Elkin, Arnold Filtser, Ofer Neiman. 242-264 [doi]
- On Linear Programming Relaxations for Unsplittable Flow in TreesZachary Friggstad, Zhihan Gao. 265-283 [doi]
- Inapproximability of H-Transversal/PackingVenkatesan Guruswami, Euiwoong Lee. 284-304 [doi]
- Towards a Characterization of Approximation Resistance for Symmetric CSPsVenkatesan Guruswami, Euiwoong Lee. 305-322 [doi]
- Sequential Importance Sampling Algorithms for Estimating the All-Terminal Reliability Polynomial of Sparse GraphsDavid G. Harris, Francis Sullivan. 323-340 [doi]
- Improved NP-Inapproximability for 2-Variable Linear EquationsJohan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright. 341-360 [doi]
- A Tight Approximation Bound for the Stable Marriage Problem with Restricted TiesChien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. 361-380 [doi]
- Designing Overlapping Networks for Publish-Subscribe SystemsJennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram. 381-395 [doi]
- Approximating Dense Max 2-CSPsPasin Manurangsi, Dana Moshkovitz. 396-415 [doi]
- The Container Selection ProblemViswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf. 416-434 [doi]
- Tight Bounds for Graph Problems in Insertion StreamsXiaoming Sun, David P. Woodruff. 435-448 [doi]
- A Chasm Between Identity and Equivalence Testing with Conditional QueriesJayadev Acharya, Clément L. Canonne, Gautam Kamath. 449-466 [doi]
- Harnessing the Bethe Free EnergyVictor Bapst, Amin Coja-Oghlan. 467-480 [doi]
- Internal Compression of Protocols to EntropyBalthazar Bauer, Shay Moran, Amir Yehudayoff. 481-496 [doi]
- On Fortification of Projection GamesAmey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat. 497-511 [doi]
- Learning Circuits with few NegationsEric Blais, Clément L. Canonne, Igor Carboni Oliveira, Rocco A. Servedio, Li-Yang Tan. 512-527 [doi]
- Dynamics for the Mean-field Random-cluster ModelAntonio Blanca, Alistair Sinclair. 528-543 [doi]
- Correlation in Hard Distributions in Communication ComplexityRalph Bottesch, Dmitry Gavinsky, Hartmut Klauck. 544-572 [doi]
- Zero-One Laws for Sliding Windows and Universal SketchesVladimir Braverman, Rafail Ostrovsky, Alan Roytman. 573-590 [doi]
- Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming SumsVladimir Braverman, Stephen R. Chestnut. 591-605 [doi]
- Dependent Random Graphs and Multi-Party Pointer JumpingJoshua Brody, Mario Sanchez. 606-624 [doi]
- Weighted Polynomial Approximations: Limits for Learning and PseudorandomnessMark Bun, Thomas Steinke. 625-644 [doi]
- Tighter Connections between Derandomization and Circuit Lower BoundsMarco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova. 645-658 [doi]
- Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical GuaranteesShiri Chechik, Edith Cohen, Haim Kaplan. 659-679 [doi]
- Two Structural Results for Low Degree Polynomials and ApplicationsGil Cohen, Avishay Tal. 680-709 [doi]
- The Minimum Bisection in the Planted Bisection ModelAmin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch. 710-725 [doi]
- Local Convergence of Random Graph ColoringsAmin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari. 726-737 [doi]
- Towards Resistance SparsifiersMichael Dinitz, Robert Krauthgamer, Tal Wagner. 738-755 [doi]
- Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson TreesCharilaos Efthymiou. 756-774 [doi]
- A Randomized Online Quantile Summary in O(1/epsilon * log(1/epsilon)) WordsDavid Felber, Rafail Ostrovsky. 775-785 [doi]
- On Constant-Size Graphs That Preserve the Local Structure of High-Girth GraphsHendrik Fichtenberger, Pan Peng, Christian Sohler. 786-799 [doi]
- Dimension Expanders via Rank CondensersMichael A. Forbes, Venkatesan Guruswami. 800-814 [doi]
- Swendsen-Wang Algorithm on the Mean-Field Potts ModelAndreas Galanis, Daniel Stefankovic, Eric Vigoda. 815-828 [doi]
- Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares AlgorithmsRong Ge, Tengyu Ma. 829-849 [doi]
- Negation-Limited FormulasSiyao Guo, Ilan Komargodski. 850-866 [doi]
- Deletion Codes in the High-noise and High-rate RegimesVenkatesan Guruswami, Carol Wang. 867-880 [doi]
- Communication with Partial Noiseless FeedbackBernhard Haeupler, Pritish Kamath, Ameya Velingker. 881-897 [doi]
- Spectral Norm of Random Kernel Matrices with Applications to PrivacyShiva Prasad Kasiviswanathan, Mark Rudelson. 898-914 [doi]
- Separating Decision Tree Complexity from Subcube Partition ComplexityRobin Kothari, David Racicot-Desloges, Miklos Santha. 915-930 [doi]
- Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the CoalescentElchanan Mossel, Sébastien Roch. 931-942 [doi]
- Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate PolynomialsIlya Volkovich. 943-958 [doi]