Table of Contents

• k-MedianMohammadTaghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha. 1-12 [doi]
• Improved Approximation Algorithm for Two-Dimensional Bin PackingNikhil Bansal, Arindam Khan. 13-25 [doi]
• ∊ Approximation for Unsplittable Flow on a PathAris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese. 26-41 [doi]
• Better Approximation Bounds for the Joint Replenishment ProblemMarcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall. 42-54 [doi]
• Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy ApproachNikhil Bansal, Moses Charikar, Ravishankar Krishnaswamy, Shi Li. 55-71 [doi]
• An Excluded Grid Theorem for Digraphs with Forbidden MinorsKen-ichi Kawarabayashi, Stephan Kreutzer. 72-81 [doi]
• Finding small patterns in permutations in linear timeSylvain Guillemot, Dániel Marx. 82-101 [doi]
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter TractableLaurent Bulteau, Christian Komusiewicz. 102-121 [doi]
• Interval Deletion is Fixed-Parameter TractableYixin Cao, Dániel Marx. 122-141 [doi]
• Efficient Computation of Representative Sets with Applications in Parameterized and Exact AlgorithmsFedor V. Fomin, Daniel Lokshtanov, Saket Saurabh. 142-151 [doi]
• On the Computational Complexity of Betti Numbers: Reductions from Matrix RankHerbert Edelsbrunner, Salman Parsa. 152-160 [doi]
• Implicit Manifold ReconstructionSiu-Wing Cheng, Man-Kwun Chiu. 161-173 [doi]
• Approximating Local Homology from SamplesPrimoz Skraba, Bei Wang. 174-192 [doi]
• Robust Satisfiability of Systems of EquationsPeter Franek, Marek Krcál. 193-203 [doi]
• Solving 1-Laplacians in Nearly Linear Time: Collapsing and Expanding a Topological BallMichael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Richard Peng, Noel Walkington. 204-216 [doi]
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity GeneralizationsJonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, Aaron Sidford. 217-226 [doi]
• Computing Cut-Based Hierarchical Decompositions in Almost Linear TimeHarald Räcke, Chintan Shah, Hanjo Täubig. 227-238 [doi]
• Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite GraphsKook Jin Ahn, Sudipto Guha. 239-258 [doi]
• Improved bounds and algorithms for graph cuts and network reliabilityDavid G. Harris, Aravind Srinivasan. 259-278 [doi]
• ∊)-Approximate Flow SparsifiersAlexandr Andoni, Anupam Gupta, Robert Krauthgamer. 279-293 [doi]
• Uniform random sampling of simple branched coverings of the sphere by itselfEnrica Duchi, Dominique Poulalhon, Gilles Schaeffer. 294-304 [doi]
• n) near uniqueness thresholdCharilaos Efthymiou. 305-316 [doi]
• Arboricity and spanning-tree packing in random graphs with an application to load balancingPu Gao, Xavier Pérez-Giménez, Cristiane M. Sato. 317-326 [doi]
• 2Prateek Bhakta, Sarah Miracle, Dana Randall. 327-340 [doi]
• A Simple FPTAS for Counting Edge CoversChengyu Lin, Jingcheng Liu, Pinyan Lu. 341-348 [doi]
• H-colouring: a dichotomyLászló Egri, Pavol Hell, Benoit Larose, Arash Rafiey. 349-365 [doi]
• Positivity Problems for Low-Order Linear Recurrence SequencesJoël Ouaknine, James Worrell. 366-379 [doi]
• Polynomial Solvability of Variants of the Trust-Region SubproblemDaniel Bienstock, Alexander Michalka. 380-390 [doi]
• On the Lattice Isomorphism ProblemIshay Haviv, Oded Regev. 391-404 [doi]
• The Complexity of Order Type IsomorphismGreg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer. 405-415 [doi]
• Dynamic Task Allocation in Asynchronous Shared MemoryDan Alistarh, James Aspnes, Michael A. Bender, Rati Gelashvili, Seth Gilbert. 416-435 [doi]
• Competitive Analysis via RegularizationNiv Buchbinder, Shahar Chen, Joseph Naor. 436-444 [doi]
• First Come First Served for Online Slot Allocation and Huffman CodingMonik Khare, Claire Mathieu, Neal E. Young. 445-454 [doi]
• Online Steiner Tree with DeletionsAnupam Gupta, Amit Kumar. 455-467 [doi]
• Maintaining Assignments Online: Matching, Scheduling, and FlowsAnupam Gupta, Amit Kumar, Cliff Stein. 468-479 [doi]
• (Nearly) Sample-Optimal Sparse Fourier TransformPiotr Indyk, Michael Kapralov, Eric Price. 480-499 [doi]
• Learning Sparse Polynomial FunctionsAlexandr Andoni, Rina Panigrahy, Gregory Valiant, Li Zhang 0001. 500-510 [doi]
• Learning Entangled Single-Sample GaussiansFlavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi. 511-522 [doi]
• Exploiting Metric Structure for Efficient Private Query ReleaseZhiyi Huang, Aaron Roth. 523-534 [doi]
• On the compatibility of quartet treesNoga Alon, Sagi Snir, Raphael Yuster. 535-545 [doi]
• A New Perspective on Vertex ConnectivityKeren Censor Hillel, Mohsen Ghaffari, Fabian Kuhn. 546-561 [doi]
• A-paths in Group-Labelled Graphs via Linear Matroid ParityYutaro Yamaguchi. 562-569 [doi]
• 5-Free Graphs in Polynomial TimeDaniel Lokshantov, Martin Vatshelle, Yngve Villanger. 570-581 [doi]
• Large induced subgraphs via triangulations and CMSOFedor V. Fomin, Ioan Todinca, Yngve Villanger. 582-583 [doi]
• Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle TimeAndreas Björklund, Petteri Kaski, Lukasz Kowalik. 594-603 [doi]
• Polynomial time approximation schemes for the traveling repairman and other minimum latency problemsRené Sitters. 604-616 [doi]
• k-center in planar graphsDavid Eisenstat, Philip N. Klein, Claire Mathieu. 617-627 [doi]
• A Polynomial-time Approximation Scheme for Fault-tolerant Distributed StorageConstantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio. 628-644 [doi]
• A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many VerticesAnna Adamaszek, Andreas Wiese. 645-656 [doi]
• On the optimality of approximation schemes for the classical scheduling problemLin Chen, Klaus Jansen, Guochuan Zhang. 657-668 [doi]
• Improved Concentration Bounds for Count-SketchGregory T. Minton, Eric Price. 669-686 [doi]
• Annotations for Sparse Data StreamsAmit Chakrabarti, Graham Cormode, Navin Goyal, Justin Thaler. 687-706 [doi]
• Relative Errors for Deterministic Low-Rank Matrix ApproximationsMina Ghashami, Jeff M. Phillips. 707-717 [doi]
• An Optimal Lower Bound for Distinct Elements in the Message Passing ModelDavid P. Woodruff, Qin Zhang. 718-733 [doi]
• Approximating matching size from random streamsMichael Kapralov, Sanjeev Khanna, Madhu Sudan. 734-751 [doi]
• Intrinsic universality in tile self-assembly requires cooperationPierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods. 752-771 [doi]
• Timing in chemical reaction networksDavid Doty. 772-784 [doi]
• Faster Agreement via a Spectral Method for Detecting Malicious BehaviorValerie King, Jared Saia. 785-800 [doi]
• Tight Bounds for Rumor Spreading with Vertex ExpansionGeorge Giakkoupis. 801-815 [doi]
• Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World GridsMartin Dietzfelbinger, Philipp Woelfel. 816-829 [doi]
• Polynomiality for Bin Packing with a Constant Number of Item TypesMichel X. Goemans, Thomas Rothvoß. 830-839 [doi]
• Integer quadratic programming in the planeAlberto Del Pia, Robert Weismantel. 840-846 [doi]
• Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cyclesThomas Dueholm Hansen, Haim Kaplan, Uri Zwick. 847-860 [doi]
• Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré RecurrenceGeorgios Piliouras, Jeff S. Shamma. 861-873 [doi]
• Improved upper bounds for Random-Edge and Random-Jump on abstract cubesThomas Dueholm Hansen, Mike Paterson, Uri Zwick. 874-881 [doi]
• Smoothed Analysis of Local Search for the Maximum-Cut ProblemMichael Etscheid, Heiko Röglin. 882-889 [doi]
• Bilu-Linial Stable Instances of Max Cut and Minimum Multiway CutKonstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan. 890-906 [doi]
• A constructive algorithm for the Lovász Local Lemma on permutationsDavid G. Harris, Aravind Srinivasan. 907-925 [doi]
• Pipage Rounding, Pessimistic Estimators and Matrix ConcentrationNicholas J. A. Harvey, Neil Olver. 926-945 [doi]
• Maximizing Social Influence in Nearly Optimal TimeChristian Borgs, Michael Brautbar, Jennifer T. Chayes, Brendan Lucier. 946-957 [doi]
• Cache-Adaptive AlgorithmsMichael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley. 958-971 [doi]
• Near-optimal labeling schemes for nearest common ancestorsStephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen. 972-982 [doi]
• Concurrent Range Reporting in Two-Dimensional SpacePeyman Afshani, Cheng Sheng, Yufei Tao, Bryan T. Wilkinson. 983-994 [doi]
• Selection and Sorting in the "Restore" ModelTimothy M. Chan, J. Ian Munro, Venkatesh Raman. 995-1004 [doi]
• Disjoint Set Union with Randomized LinkingAshish Goel, Sanjeev Khanna, Daniel Larkin, Robert Endre Tarjan. 1005-1017 [doi]
• Beyond Locality-Sensitive HashingAlexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya Razenshteyn. 1018-1028 [doi]
• Cutting corners cheaply, or how to remove Steiner pointsLior Kamma, Robert Krauthgamer, Huy L. Nguyen. 1029-1040 [doi]
• Better Approximation Algorithms for the Graph DiameterShiri Chechik, Daniel Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, Virginia Vassilevska Williams. 1041-1052 [doi]
• A Subquadratic-Time Algorithm for Decremental Single-Source Shortest PathsMonika Henzinger, Sebastian Krinninger, Danupon Nanongkai. 1053-1072 [doi]
• Fault Tolerant Approximate BFS StructuresMerav Parter, David Peleg. 1073-1092 [doi]
• New Approximations for Reordering Buffer ManagementSungjin Im, Benjamin Moseley. 1093-1111 [doi]
• Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition ConstraintsT.-H. Hubert Chan, Fei Chen, Xiaowei Wu, Zhichao Zhao. 1112-1122 [doi]
• Primal Dual Gives Almost Optimal Energy Efficient Online AlgorithmsNikhil R. Devanur, Zhiyi Huang 0002. 1123-1140 [doi]
• Hallucination Helps: Energy Efficient Virtual Circuit RoutingAntonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein. 1141-1153 [doi]
• Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended AbstractWill Ma. 1154-1163 [doi]
• Hereditary properties of permutations are strongly testableTereza Klimosova, Daniel Král'. 1164-1173 [doi]
• Testing equivalence between distributions using conditional samplesClément L. Canonne, Dana Ron, Rocco A. Servedio. 1174-1192 [doi]
• Optimal Algorithms for Testing Closeness of Discrete DistributionsSiu On Chan, Ilias Diakonikolas, Paul Valiant, Gregory Valiant. 1193-1203 [doi]
• Testing Surface AreaPravesh Kothari, Amir Nayyeri, Ryan O'Donnell, Chenggang Wu. 1204-1214 [doi]
• A Cubic Algorithm for Computing Gaussian VolumeBen Cousins, Santosh Vempala. 1215-1228 [doi]
• Non-Uniform Graph PartitioningRobert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar. 1229-1243 [doi]
• k-PartitioningAnand Louis, Konstantin Makarychev. 1244-1255 [doi]
• Partitioning into ExpandersShayan Oveis Gharan, Luca Trevisan. 1256-1266 [doi]
• Flow-Based Algorithms for Local Graph ClusteringLorenzo Orecchia, Zeyuan Allen Zhu. 1267-1286 [doi]
• Streaming Balanced Graph Partitioning Algorithms for Random GraphsIsabelle Stanton. 1287-1301 [doi]
• The Complexity of Optimal Mechanism DesignConstantinos Daskalakis, Alan Deckelbaum, Christos Tzamos. 1302-1318 [doi]
• The Complexity of Optimal Multidimensional PricingXi Chen, Ilias Diakonikolas, Dimitris Paparas, Xiaorui Sun, Mihalis Yannakakis. 1319-1328 [doi]
• On Computability of Equilibria in Markets with ProductionJugal Garg, Vijay V. Vazirani. 1329-1340 [doi]
• Constrained Signaling in Auction DesignShaddin Dughmi, Nicole Immorlica, Aaron Roth. 1341-1357 [doi]
• Prophet Inequalities with Limited InformationPablo Daniel Azar, Robert Kleinberg, S. Matthew Weinberg. 1358-1377 [doi]
• A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter DimensionEsther Ezra. 1378-1388 [doi]
• Optimal Deterministic Shallow Cuttings for 3D Dominance RangesPeyman Afshani, Konstantinos Tsakalidis. 1389-1398 [doi]
• Four Soviets Walk the Dog - with an Application to Alt's ConjectureKevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer. 1399-1413 [doi]
• Fast Computation of Output-Sensitive Maxima in a Word RAMPeyman Afshani. 1414-1423 [doi]
• Making Octants Colorful and Related Covering Decomposition ProblemsJean Cardinal, Kolja B. Knauer, Piotr Micek, Torsten Ueckerdt. 1424-1432 [doi]
• Submodular Maximization with Cardinality ConstraintsNiv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz. 1433-1452 [doi]
• Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set CoverAmol Deshpande, Lisa Hellerstein, Devorah Kletenik. 1453-1466 [doi]
• k-Submodular FunctionsJustin Ward, Stanislav Zivny. 1468-1481 [doi]
• Influence Maximization in Undirected NetworksSanjeev Khanna, Brendan Lucier. 1482-1496 [doi]
• Fast algorithms for maximizing submodular functionsAshwinkumar Badanidiyuru, Jan Vondrák. 1497-1514 [doi]
• New constructions of RIP matrices with fast multiplication and fewer rowsJelani Nelson, Eric Price, Mary Wootters. 1515-1528 [doi]
• Model-based Sketching and Recovery with ExpandersBubacarr Bah, Luca Baldassarre, Volkan Cevher. 1529-1543 [doi]
• Approximation-Tolerant Model-Based Compressive SensingChinmay Hegde, Piotr Indyk, Ludwig Schmidt. 1544-1561 [doi]
• On Sketching Matrix Norms and the Top Singular VectorYi Li, Huy L. Nguyen, David P. Woodruff. 1562-1581 [doi]
• Bicriteria data compressionAndrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini. 1582-1595 [doi]
• Point Line Cover: The Easy Kernel is Essentially TightStefan Kratsch, Geevarghese Philip, Saurabh Ray. 1596-1606 [doi]
• Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable HypergraphsSubhash Khot, Rishi Saket. 1607-1625 [doi]
• Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity ProblemsBundit Laekhanukit. 1626-1643 [doi]
• Hypercontractive inequalities via SOS, and the Frankl-Rödl graphManuel Kauers, Ryan O'Donnell, Li-Yang Tan, Yuan Zhou. 1644-1658 [doi]
• Hardness of Robust Graph Isomorphism, Lasserre Gaps, and Asymmetry of Random GraphsRyan O'Donnell, John Wright, Chenggang Wu, Yuan Zhou. 1659-1677 [doi]
• The Generalized Terminal Backup ProblemAttila Bernáth, Yusuke Kobayashi. 1678-1686 [doi]
• Approximating Minimum Cost Connectivity Orientation and AugmentationMohit Singh, László A. Végh. 1687-1701 [doi]
• Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set ProblemsSamir Khuller, Manish Purohit, Kanthi K. Sarpatwar. 1702-1713 [doi]
• Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and HypergraphsWang Chi Cheung, Michel X. Goemans, Sam Chiu-wai Wong. 1714-1726 [doi]
• d-dimensional arrangement with fixed pointsAnupam Gupta, Anastasios Sidiropoulos. 1727-1738 [doi]
• Linear Time Parameterized Algorithms via Skew-Symmetric MulticutsM. S. Ramanujan, Saket Saurabh. 1739-1748 [doi]
• Linear-Time FPT Algorithms via Network FlowYoichi Iwata, Keigo Oka, Yuichi Yoshida. 1749-1761 [doi]
• Half-integrality, LP-branching and FPT AlgorithmsMagnus Wahlström. 1762-1781 [doi]
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Dániel Marx. 1782-1801 [doi]
• A Near-Optimal Planarization AlgorithmBart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh. 1802-1811 [doi]
• A subexponential parameterized algorithm for Subset TSP on planar graphsPhilip N. Klein, Dániel Marx. 1812-1830 [doi]
• Broadcast Throughput in Radio Networks: Routing vs. Network CodingNoga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian. 1831-1843 [doi]
• Causal Erasure ChannelsRaef Bassily, Adam Smith. 1844-1857 [doi]
• Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabetsVenkatesan Guruswami, Chaoping Xing. 1858-1866 [doi]
• Finding orthogonal vectors in discrete structuresRyan Williams, Huacheng Yu. 1867-1877 [doi]
• Efficient quantum protocols for XOR functionsShengyu Zhang. 1878-1885 [doi]