Table of Contents

• Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Sub-Constant ErrorT. S. Jayram, David P. Woodruff. 1-10 [doi]
• The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other ProblemsElad Verbin, Wei Yu. 11-25 [doi]
• Streaming k-means on Well-Clusterable DataVladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, Michael Shindler, Brian Tagiku. 26-40 [doi]
• Efficient Sketches for the Set Query ProblemEric Price. 41-56 [doi]
• Exponential Time Improvement for min-wise Based AlgorithmsGuy Feigenblat, Ely Porat, Ariel Shiftan. 57-66 [doi]
• A simple and fast 2-approximation algorithms for the one-warehouse multi-retailers problemGautier Stauffer, Guillaume Massonet, Christophe Rapine, Jean-Philippe Gayon. 67-79 [doi]
• Generalized Machine Activation ProblemsJian Li, Samir Khuller. 80-94 [doi]
• Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated MachinesSungjin Im, Benjamin Moseley. 95-108 [doi]
• Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of WorkJeff Edmonds, Sungjin Im, Benjamin Moseley. 109-119 [doi]
• Online Scheduling on Identical Machines using SRPTKyle Fox, Benjamin Moseley. 120-128 [doi]
• A complete resolution of the Keller maximum clique problemJennifer Debroni, John D. Eblen, Michael A. Langston, Wendy Myrvold, Peter W. Shor, Dinesh Weerapurage. 129-135 [doi]
• On independent sets in random graphsAmin Coja-Oghlan, Charilaos Efthymiou. 136-144 [doi]
• Coloring random graphs online without creating monochromatic subgraphsTorsten Mütze, Thomas Rast, Reto Spöhel. 145-158 [doi]
• The maximum size of a Sidon set contained in a sparse random set of integersYoshiharu Kohayakawa, Sangjune Lee, Vojtech Rödl. 159-171 [doi]
• On Buffon Machines and NumbersPhilippe Flajolet, Maryse Pelletier, Michèle Soria. 172-183 [doi]
• Graph Coloring via The Probabilistic MethodBruce Reed. 184-184 [doi]
• An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss TransformNir Ailon, Edo Liberty. 185-191 [doi]
• A Stackelberg Strategy for Routing Flow over TimeUmang Bhaskar, Lisa Fleischer, Elliot Anshelevich. 192-201 [doi]
• A subexponential lower bound for the Random Facet algorithm for Parity GamesOliver Friedmann, Thomas Dueholm Hansen, Uri Zwick. 202-216 [doi]
• On Minmax Theorems for Multiplayer GamesYang Cai, Constantinos Daskalakis. 217-234 [doi]
• Near-Optimal No-Regret Algorithms for Zero-Sum GamesConstantinos Daskalakis, Alan Deckelbaum, Anthony Kim. 235-254 [doi]
• Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion GamesTim Roughgarden, Florian Schoppmann. 255-267 [doi]
• I/O-Efficient Contour Queries on TerrainsPankaj K. Agarwal, Thomas Mølhave, Bardia Sadri. 268-284 [doi]
• Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage StructuresMark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis. 285-296 [doi]
• Shortest Non-Crossing Walks in the PlaneJeff Erickson, Amir Nayyeri. 297-208 [doi]
• Computing Shortest Paths amid PseudodisksDanny Z. Chen, Haitao Wang. 309-226 [doi]
• On the Complexity of Time-Dependent Shortest PathsLuca Foschini, John Hershberger, Subhash Suri. 327-341 [doi]
• A Master Theorem for Discrete Divide and Conquer RecurrencesMichael Drmota, Wojciech Szpankowski. 342-361 [doi]
• Optimal pattern matching in LZW compressed stringsPawel Gawrychowski. 362-372 [doi]
• Random Access to grammar-Compressed StringsPhilip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann. 373-389 [doi]
• Ordered and Unordered Top-K Range Reporting in Large Data SetsPeyman Afshani, Gerth Stølting Brodal, Norbert Zeh. 390-400 [doi]
• Top-K Color Queries for Document RetrievalMarek Karpinski, Yakov Nekrich. 401-411 [doi]
• Mobile Geometric Graphs: Detection, Coverage and PercolationYuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer. 412-428 [doi]
• Randomized Diffusion for Indivisible LoadsPetra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald. 429-439 [doi]
• Fast Information Spreading in Graphs with Large Weak ConductanceKeren Censor Hillel, Hadas Shachnai. 440-448 [doi]
• On the Randomness Requirements of Rumor SpreadingGeorge Giakkoupis, Philipp Woelfel. 449-461 [doi]
• Rumor Spreading and Vertex Expansion on Regular GraphsThomas Sauerwald, Alexandre Stauffer. 462-475 [doi]
• Bin Packing via Discrepancy of PermutationsFriedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß. 476-481 [doi]
• Algorithms and Hardness for Subspace ApproximationAmit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi. 482-496 [doi]
• Approximating Matrix p-normsAditya Bhaskara, Aravindan Vijayaraghavan. 497-511 [doi]
• Subsampling Mathematical Relaxations and Average-case ComplexityBoaz Barak, Moritz Hardt, Thomas Holenstein, David Steurer. 512-531 [doi]
• Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and DecompositionLorenzo Orecchia, Nisheeth K. Vishnoi. 532-545 [doi]
• Faster quantum algorithm for evaluating game treesBen Reichardt. 546-559 [doi]
• Reflections for quantum query algorithmsBen Reichardt. 560-569 [doi]
• Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2DMatthew Cook, Yunhui Fu, Robert T. Schweller. 570-589 [doi]
• The Power of Nondeterminism in Self-AssemblyNathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki. 590-602 [doi]
• CollapseGünter Rote, Uri Zwick. 603-613 [doi]
• Algorithms for Implicit Hitting Set ProblemsKarthekeyan Chandrasekaran, Richard Karp, Erick Moreno-Centeno, Santosh Vempala. 614-629 [doi]
• An algorithmic decomposition of claw-free graphs leading to an O(n:::3:::)-algorithm for the weighted stable set problemYuri Faenza, Gianpaolo Oriolo, Gautier Stauffer. 630-646 [doi]
• Randomized greedy: new variants of some classic approximation algorithmsKevin P. Costello, Asaf Shapira, Prasad Tetali. 647-655 [doi]
• Randomized Variants of Johnson’s Algorithm for MAX SATMatthias Poloczek, Georg Schnitger. 656-663 [doi]
• The Local Lemma is Tight for SATHeidi Gebauer, Tibor Szabó, Gábor Tardos. 664-674 [doi]
• Pricing on Paths: A PTAS for the Highway ProblemFabrizio Grandoni, Thomas Rothvoß. 675-684 [doi]
• Welfare Guarantees for Combinatorial Auctions with Item BiddingKshipra Bhawalkar, Tim Roughgarden. 700-709 [doi]
• Mechanism Design via Correlation GapQiqi Yan. 710-719 [doi]
• Bayesian Incentive Compatibility via Fractional AssignmentsXiaohui Bei, Zhiyi Huang. 720-733 [doi]
• Bayesian Incentive Compatibility via MatchingsJason D. Hartline, Robert Kleinberg, Azarakhsh Malekian. 734-747 [doi]
• Bidimensionality and EPTASFedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh. 748-759 [doi]
• Slightly Superexponential Parameterized ProblemsDaniel Lokshtanov, Dániel Marx, Saket Saurabh. 760-776 [doi]
• Known Algorithms on Graphs on Bounded Treewidth are Probably OptimalDaniel Lokshtanov, Dániel Marx, Saket Saurabh. 777-789 [doi]
• Continuous Local SearchConstantinos Daskalakis, Christos H. Papadimitriou. 790-804 [doi]
• Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data StructuresAllan Grønlund Jørgensen, Kasper Green Larsen. 805-813 [doi]
• Where computer vision needs help from computer scienceWilliam T. Freeman. 814-819 [doi]
• An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny DiameterShay Solomon. 820-839 [doi]
• Fast, precise and dynamic distance queriesYair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty. 840-853 [doi]
• Approximate Nearest Neighbor Search for Low Dimensional QueriesSariel Har-Peled, Nirman Kumar. 854-867 [doi]
• Dimensionality reduction: Beyond the Johnson-Lindenstrauss boundYair Bartal, Ben Recht, Leonard J. Schulman. 868-887 [doi]
• A Nonlinear Approach to Dimension ReductionLee-Ad Gottlieb, Robert Krauthgamer. 888-899 [doi]
• Hitting time results for Maker-Breaker gamesSonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael Krivelevich. 900-912 [doi]
• Packing tight Hamilton cycles in 3-uniform hypergraphsAlan M. Frieze, Michael Krivelevich, Po-Shen Loh. 913-932 [doi]
• Networks of random cyclesColin Cooper, Martin E. Dyer, Andrew J. Handley. 933-944 [doi]
• Phase Transition for Glauber Dynamics for Independent Sets on Regular TreesRicardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang. 945-956 [doi]
• On Belief Propagation Guided Decimation for Random k-SATAmin Coja-Oghlan. 957-966 [doi]
• The Asymmetric Traveling Salesman Problem on Graphs with Bounded GenusShayan Oveis Gharan, Amin Saberi. 967-975 [doi]
• Capacitated Metric LabelingMatthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra. 976-995 [doi]
• Multicommodity Facility Location under Group Steiner Access CostLaura J. Poplawski, Rajmohan Rajaraman. 996-1013 [doi]
• Survivable Network Design Problems in Wireless NetworksDebmalya Panigrahi. 1014-1027 [doi]
• Prize-collecting Steiner Problems on Planar GraphsMohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx. 1028-1049 [doi]
• On Graph Crossing Number and Edge PlanarizationJulia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos. 1050-1069 [doi]
• Ranking with Submodular ValuationsYossi Azar, Iftah Gamzu. 1070-1079 [doi]
• Multi-budgeted Matchings and Matroid Intersection via Dependent RoundingChandra Chekuri, Jan Vondrák, Rico Zenklusen. 1080-1097 [doi]
• Submodular Maximization by Simulated AnnealingShayan Oveis Gharan, Jan Vondrák. 1098-1116 [doi]
• The Matroid Median ProblemRavishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha. 1117-1130 [doi]
• New Approximation Algorithms for Minimum Enclosing Convex ShapesAnkan Saha, S. V. N. Vishwanathan, Xinhua Zhang. 1146-1160 [doi]
• Computing the Independence Number of Intersection GraphsJacob Fox, János Pach. 1161-1165 [doi]
• Minimum Cuts and Shortest Non-Separating Cycles via Homology CoversJeff Erickson, Amir Nayyeri. 1166-1176 [doi]
• Embedding Stacked Polytopes on a Polynomial-Size GridErik D. Demaine, André Schulz. 1177-1187 [doi]
• Overlap properties of geometric expandersJacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach. 1188-1197 [doi]
• On the Degree Distribution of Random Planar GraphsKonstantinos Panagiotou, Angelika Steger. 1198-1210 [doi]
• Component structure of the vacant set induced by a random walk on a random graphColin Cooper, Alan M. Frieze. 1211-1221 [doi]
• The Multiple-Orientability Thresholds for Random HypergraphsNikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou. 1222-1236 [doi]
• The Rigidity Transition in Random GraphsShiva Prasad Kasiviswanathan, Cristopher Moore, Louis Theran. 1237-1252 [doi]
• Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted AllocationsGagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta. 1253-1264 [doi]
• Secretary Problems: Laminar Matroid and Interval SchedulingSungjin Im, Yajun Wang. 1265-1274 [doi]
• Matroid Secretary Problem in the Random Assignment ModelJosé A. Soto. 1275-1284 [doi]
• Online Stochastic Matching: Online Actions Based on Offline StatisticsVahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi. 1285-1294 [doi]
• An Optimal Lower Bound for Buffer Management in Multi-Queue SwitchesMarcin Bienkowski. 1295-1305 [doi]
• An Intersection Model for Multitolerance Graphs: Efficient Algorithms and HierarchyGeorge B. Mertzios. 1306-1317 [doi]
• Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic VerificationKrishnendu Chatterjee, Monika Henzinger. 1318-1336 [doi]
• Faster Replacement PathsVirginia Vassilevska Williams. 1337-1346 [doi]
• Computing Replacement Paths in Surface Embedded GraphsJeff Erickson, Amir Nayyeri. 1347-1354 [doi]
• Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under DeletionsAaron Bernstein, Liam Roditty. 1355-1365 [doi]
• Algebraic Algorithms for Linear Matroid Parity ProblemsHo Yee Cheung, Lap Chi Lau, Kai Man Leung. 1366-1382 [doi]
• On Parity Check (0, 1)-Matrix over Z:::p:::Nader H. Bshouty, Hanna Mazzawi. 1383-1394 [doi]
• Code Equivalence and Group IsomorphismLászló Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao. 1395-1408 [doi]
• Efficient algorithms for some special cases of the polynomial equivalence problemNeeraj Kayal. 1409-1421 [doi]
• Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix MultiplicationAvner Magen, Anastasios Zouzias. 1422-1436 [doi]
• Computational Geometry for Non-Geometers: Recent Developments on Some Classical ProblemsTimothy Chan. 1437-1437 [doi]
• Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected ComponentsJakub Lacki. 1438-1445 [doi]
• Approximating the GirthLiam Roditty, Roei Tov. 1446-1454 [doi]
• Approximating the Statistics of various Properties in Randomly Weighted GraphsYuval Emek, Amos Korman, Yuval Shavitt. 1455-1467 [doi]
• Counting and detecting small subgraphs via equations and matrix multiplicationMiroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. 1468-1476 [doi]
• On Succinct Convex Greedy Drawing of 3-Connected Plane GraphsXin He, Huaming Zhang. 1477-1486 [doi]
• Distributed Selfish Load Balancing on NetworksPetra Berenbrink, Martin Hoefer, Thomas Sauerwald. 1487-1497 [doi]
• On the Complexity of Approximating a Nash EquilibriumConstantinos Daskalakis. 1498-1517 [doi]
• Fast Convergence of Natural Bargaining Dynamics in Exchange NetworksYashodhan Kanoria, Mohsen Bayati, Christian Borgs, Jennifer T. Chayes, Andrea Montanari. 1518-1537 [doi]
• Wireless Capacity with Oblivious Power in General MetricsMagnús M. Halldórsson, Pradipta Mitra. 1538-1548 [doi]
• A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR ModelThomas Kesselheim. 1549-1559 [doi]
• On LP-Based Approximability for Strict CSPsAmit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi. 1560-1573 [doi]
• Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting SetVenkatesan Guruswami, Yuan Zhou. 1574-1589 [doi]
• Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold FunctionsIlias Diakonikolas, Ryan O Donnell, Rocco A. Servedio, Yi Wu. 1590-1606 [doi]
• Tight Hardness Results for Minimizing DiscrepancyMoses Charikar, Alantha Newman, Aleksandar Nikolov. 1607-1614 [doi]
• The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic numberVenkatesan Guruswami, Ali Kemal Sinop. 1615-1626 [doi]
• Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box DistributionsChaitanya Swamy. 1627-1646 [doi]
• Improved Approximation Results for Stochastic Knapsack ProblemsAnand Bhalgat, Ashish Goel, Sanjeev Khanna. 1647-1665 [doi]
• The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem)Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 1666-1674 [doi]
• Approximate Dynamic Programming using Halfspace Queries and Multiscale Monge DecompositionGary L. Miller, Richard Peng, Russell Schwartz, Charalampos E. Tsourakakis. 1675-1682 [doi]
• Nearly Tight Bounds for Testing Function IsomorphismSourav Chakraborty, David García-Soriano, Arie Matsliah. 1683-1702 [doi]
• The Dichotomy of List Homomorphisms for DigraphsPavol Hell, Arash Rafiey. 1703-1713 [doi]
• Dichotomy for Holant* Problems of Boolean DomainJin-yi Cai, Pinyan Lu, Mingji Xia. 1714-1728 [doi]
• Bounding the Randomized Decision Tree Complexity of Read-Once Boolean FunctionsKazuyuki Amano. 1729-1744 [doi]
• Improved Space Bounds for Cache-Oblivious Range ReportingPeyman Afshani, Norbert Zeh. 1745-1758 [doi]
• Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are EquivalentMaarten Löffler, Wolfgang Mulzer. 1759-1777 [doi]
• Improved Bound for the Union of Fat TrianglesEsther Ezra, Boris Aronov, Micha Sharir. 1778-1785 [doi]