Table of Contents

• Exact Weight Subgraphs and the k-Sum ConjectureAmir Abboud, Kevin Lewi. 1-12 [doi]
• Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated MachinesS. Anand 0002, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar. 13-24 [doi]
• Tight Lower Bound for Linear Sketches of MomentsAlexandr Andoni, Huy L. Nguyên, Yury Polyanskiy, Yihong Wu. 25-32 [doi]
• Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract)Martin Aumüller, Martin Dietzfelbinger. 33-44 [doi]
• Space-Time Tradeoffs for Subset Sum: An Improved Worst Case AlgorithmPer Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä. 45-56 [doi]
• On the Extension Complexity of Combinatorial PolytopesDavid Avis, Hans Raj Tiwary. 57-68 [doi]
• Algorithms for Hub Label OptimizationMaxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan. 69-80 [doi]
• Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner ProblemsMohammadHossein Bateni, MohammadTaghi Hajiaghayi, Vahid Liaghat. 81-92 [doi]
• Search-Space Size in Contraction HierarchiesReinhard Bauer, Tobias Columbus, Ignaz Rutter, Dorothea Wagner. 93-104 [doi]
• Time-Efficient Quantum Walks for 3-DistinctnessAleksandrs Belovs, Andrew M. Childs, Stacey Jeffery, Robin Kothari, Frédéric Magniez. 105-122 [doi]
• An Algebraic Characterization of Testable Boolean CSPsArnab Bhattacharyya, Yuichi Yoshida. 123-134 [doi]
• Approximation Algorithms for the Joint Replenishment Problem with DeadlinesMarcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Neil Dobbs, Tomasz Nowicki, Maxim Sviridenko, Grzegorz Swirszcz, Neal E. Young. 135-147 [doi]
• Sparse Suffix Tree Construction in Small SpacePhilip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj. 148-159 [doi]
• Tree Compression with Top TreesPhilip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann. 160-171 [doi]
• Noncommutativity Makes Determinants HardMarkus Bläser. 172-183 [doi]
• Optimal Orthogonal Graph Drawing with Convex Bend CostsThomas Bläsius, Ignaz Rutter, Dorothea Wagner. 184-195 [doi]
• Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by TreewidthHans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof. 196-207 [doi]
• On the Complexity of Higher Order Abstract Voronoi DiagramsCecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi. 208-219 [doi]
• A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random PositionsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino. 220-231 [doi]
• Direct Product via Round-Preserving CompressionMark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff. 232-243 [doi]
• How Hard Is Counting Triangles in the Streaming Model?Vladimir Braverman, Rafail Ostrovsky, Dan Vilenchik. 244-254 [doi]
• Online Checkpointing with Improved Worst-Case GuaranteesKarl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan. 255-266 [doi]
• Exact and Efficient Generation of Geometric Random Variates and Random GraphsKarl Bringmann, Tobias Friedrich. 267-278 [doi]
• Finding Short Paths on Polytopes by the Shadow Vertex AlgorithmTobias Brunsch, Heiko Röglin. 279-290 [doi]
• On Randomized Online Labeling with Polynomially Many LabelsJan Bulánek, Michal Koucký, Michael Saks. 291-302 [doi]
• Dual Lower Bounds for Approximate Degree and Markov-Bernstein InequalitiesMark Bun, Justin Thaler. 303-314 [doi]
• New Doubling Spanners: Better and SimplerT.-H. Hubert Chan, Mingfei Li, Li Ning, Shay Solomon. 315-327 [doi]
• Maximum Edge-Disjoint Paths in k-Sums of GraphsChandra Chekuri, Guyslain Naves, F. Bruce Shepherd. 328-339 [doi]
• On Integrality Ratios for Asymmetric TSP in the Sherali-Adams HierarchyJoseph Cheriyan, Zhihan Gao, Konstantinos Georgiou, Sahil Singla. 340-351 [doi]
• Counting Matchings of Size k Is W[1]-HardRadu Curticapean. 352-363 [doi]
• Faster Exponential-Time Algorithms in Graphs of Bounded Average DegreeMarek Cygan, Marcin Pilipczuk. 364-375 [doi]
• A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional GeometryAnindya De, Ilias Diakonikolas, Rocco A. Servedio. 376-387 [doi]
• Combining Binary Search TreesErik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan. 388-399 [doi]
• The Two-Handed Tile Assembly Model Is Not Intrinsically UniversalErik D. Demaine, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Damien Woods. 400-412 [doi]
• Clustering in the Boolean Hypercube in a List Decoding RegimeIrit Dinur, Elazar Goldenberg. 413-424 [doi]
• A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu MarketRan Duan, Kurt Mehlhorn. 425-436 [doi]
• Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract)Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals. 437-448 [doi]
• On the Power of Deterministic Mechanisms for Facility Location GamesDimitris Fotakis, Christos Tzamos. 449-460 [doi]
• ℓ2/ℓ2-Foreach Sparse Recovery with Low RiskAnna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss. 461-472 [doi]
• Autoreducibility of Complete Sets for Log-Space and Polynomial-Time ReductionsChristian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek. 473-484 [doi]
• An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating SetsPetr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger. 485-496 [doi]
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-CompleteDaniel Grier. 497-503 [doi]
• Dynamic Compressed Strings with Random AccessRoberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini. 504-515 [doi]
• The Complexity of Planar Boolean #CSP with Complex WeightsHeng Guo, Tyson Williams. 516-527 [doi]
• Arthur-Merlin Streaming ComplexityTom Gur, Ran Raz. 528-539 [doi]
• Local Correctability of Expander CodesBrett Hemenway, Rafail Ostrovsky, Mary Wootters. 540-551 [doi]
• On the Complexity of Broadcast SetupMartin Hirt, Pavel Raykov. 552-563 [doi]
• On Model-Based RIP-1 MatricesPiotr Indyk, Ilya Razenshteyn. 564-575 [doi]
• Robust Pseudorandom GeneratorsYuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman. 576-588 [doi]
• A Robust AFPTAS for Online Bin Packing with Polynomial Migration, Klaus Jansen, Kim-Manuel Klein. 589-600 [doi]
• Small Stretch Pairwise SpannersTelikepalli Kavitha, Nithin M. Varma. 601-612 [doi]
• Linear Kernels and Single-Exponential Algorithms via Protrusion DecompositionsEun Jung Kim 0002, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar. 613-624 [doi]
• The Power of Linear Programming for Finite-Valued CSPs: A Constructive CharacterizationVladimir Kolmogorov. 625-636 [doi]
• Approximating Semi-matchings in Streaming and in Two-Party CommunicationChristian Konrad, Adi Rosén. 637-649 [doi]
• Full-Fledged Real-Time Indexing for Constant Size AlphabetsGregory Kucherov, Yakov Nekrich. 650-660 [doi]
• Arithmetic Circuit Lower Bounds via MaxRankMrinal Kumar, Gaurav Maheshwari, Jayalal Sarma M. N.. 661-672 [doi]
• Model Checking Lower Bounds for Simple GraphsMichael Lampis. 673-683 [doi]
• The Complexity of Proving That a Graph Is RamseyMassimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen. 684-695 [doi]
• An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, Nikos Leonardos. 696-708 [doi]
• A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded MinorReut Levi, Dana Ron. 709-720 [doi]
• Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity AugmentationDániel Marx, László A. Végh. 721-732 [doi]
• Graph Reconstruction via Distance OraclesClaire Mathieu, Hang Zhou. 733-744 [doi]
• Dual Techniques for Scheduling on a Machine with Varying SpeedNicole Megow, José Verschae. 745-756 [doi]
• Improved Space Bounds for Strongly Competitive Randomized Paging AlgorithmsGabriel Moruz, Andrei Negoescu. 757-768 [doi]
• No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman ProblemMarcin Mucha, Maxim Sviridenko. 769-779 [doi]
• A Composition Theorem for the Fourier Entropy-Influence ConjectureRyan O'Donnell, Li-Yang Tan. 780-791 [doi]
• Large Neighborhood Local Search for the Maximum Set Packing ProblemMaxim Sviridenko, Justin Ward. 792-803 [doi]
• The Complexity of Three-Element Min-Sol and Conservative Min-Cost-HomHannes Uppman. 804-815 [doi]
• The Complexity of Infinitely Repeated Alternating Move GamesYaron Velner. 816-827 [doi]
• Approximating the Diameter of Planar Graphs in Near Linear TimeOren Weimann, Raphael Yuster. 828-839 [doi]
• Testing Linear-Invariant Function IsomorphismKarl Wimmer, Yuichi Yoshida. 840-850 [doi]