Table of Contents

• Front Matter [doi]
• Approximating independent sets in sparse graphsNikhil Bansal. 1-8 [doi]
• Spider covers for prize-collecting network activation problemTakuro Fukunaga. 9-24 [doi]
• On Survivable Set ConnectivityParinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit. 25-36 [doi]
• A note on the ring loading problemMartin Skutella. 37-46 [doi]
• New Approximation Schemes for Unsplittable Flow on a PathJatin Batra, Naveen Garg, Amit Kumar 0001, Tobias Mömke, Andreas Wiese. 47-58 [doi]
• Welfare Maximization with Production Costs: A Primal Dual ApproachZhiyi Huang 0002, Anthony Kim. 59-72 [doi]
• Pricing Online Decisions: Beyond AuctionsIlan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez. 73-91 [doi]
• n-to-1 Bidder Reduction for Multi-item Auctions and its ApplicationsAndrew Chi-Chih Yao. 92-109 [doi]
• On the Complexity of Computing an Equilibrium in Combinatorial AuctionsShahar Dobzinski, Hu Fu, Robert D. Kleinberg. 110-122 [doi]
• Combinatorial Auctions via Posted PricesMichal Feldman, Nick Gravin, Brendan Lucier. 123-135 [doi]
• Minimum Forcing Sets for Miura Folding PatternsBrad Ballinger, Mirela Damian, David Eppstein, Robin Y. Flatland, Jessica Ginepro, Thomas Hull. 136-147 [doi]
• Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-AssemblySándor P. Fekete, Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller. 148-167 [doi]
• Efficient and Robust Persistent Homology for MeasuresMickaël Buchet, Frédéric Chazal, Steve Y. Oudot, Donald Sheehy. 168-180 [doi]
• Zigzag Persistence via Reflections and TranspositionsClément Maria, Steve Y. Oudot. 181-199 [doi]
• 3Saladi Rahul. 200-211 [doi]
• Speeding up the Four Russians Algorithm by About One More Logarithmic FactorTimothy M. Chan. 212-217 [doi]
• More Applications of the Polynomial Method to Algorithm DesignAmir Abboud, Richard Ryan Williams, Huacheng Yu. 218-230 [doi]
• Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit ComplexityRahul Santhanam, Richard Ryan Williams. 231-241 [doi]
• Degree-3 Treewidth SparsifiersChandra Chekuri, Julia Chuzhoy. 242-255 [doi]
• Improved Bounds for the Flat Wall TheoremJulia Chuzhoy. 256-275 [doi]
• Fast Lattice Point Enumeration with Minimal OverheadDaniele Micciancio, Michael Walter. 276-294 [doi]
• Short Paths on the Voronoi Graph and Closest Vector Problem with PreprocessingDaniel Dadush, Nicolas Bonifas. 295-314 [doi]
• On largest volume simplices and sub-determinantsMarco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer. 315-323 [doi]
• Approximating Hereditary Discrepancy via Small Width EllipsoidsAleksandar Nikolov, Kunal Talwar. 324-336 [doi]
• Approximate Nearest Line Search in High DimensionsSepideh Mahabadi. 337-354 [doi]
• (2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed SettingMichael Elkin, Seth Pettie, Hsin-Hao Su. 355-370 [doi]
• Plurality Consensus in the Gossip ModelLuca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri. 371-390 [doi]
• Distributed Computation of Large-scale Graph ProblemsHartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, Peter Robinson 0002. 391-410 [doi]
• Gossip vs. Markov Chains, and Randomness-Efficient Rumor SpreadingZeyu Guo, He Sun 0001. 411-430 [doi]
• Sequential Random Permutation, List Contraction and Tree Contraction are Highly ParallelJulian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons. 431-448 [doi]
• Robust Probabilistic InferenceYishay Mansour, Aviad Rubinstein, Moshe Tennenholtz. 449-460 [doi]
• Learning Privately with Labeled and Unlabeled ExamplesAmos Beimel, Kobbi Nissim, Uri Stemmer. 461-477 [doi]
• Learning from satisfying assignmentsAnindya De, Ilias Diakonikolas, Rocco A. Servedio. 478-497 [doi]
• Approximate resilience, monotonicity, and the complexity of agnostic learningDana Dachman-Soled, Vitaly Feldman, Li-Yang Tan, Andrew Wan, Karl Wimmer. 498-511 [doi]
• Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)Ian Post, Chaitanya Swamy. 512-531 [doi]
• Internal Pattern Matching Queries in a Text and ApplicationsTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 532-551 [doi]
• Cell-probe bounds for online edit distance and other pattern matching problemsRaphaël Clifford, Markus Jalsenius, Benjamin Sach. 552-561 [doi]
• A new characterization of maximal repetitions by Lyndon treesHideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta. 562-571 [doi]
• Wavelet Trees Meet Suffix TreesMaxim A. Babenko, Pawel Gawrychowski, Tomasz Kociumaka, Tatiana A. Starikovskaya. 572-591 [doi]
• Sharp Bounds on Formation-free SequencesSeth Pettie. 592-604 [doi]
• k-BicliqueBingkai Lin. 605-615 [doi]
• Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernelsBart M. P. Jansen, Dániel Marx. 616-629 [doi]
• d-SAT via Backdoors to Small TreewidthFedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan, Saket Saurabh. 630-641 [doi]
• An exact characterization of tractable demand patterns for maximum disjoint path problemsDániel Marx, Paul Wollan. 642-661 [doi]
• Tight lower bound for the channel assignment problemArkadiusz Socala. 662-675 [doi]
• k-Route Cut Problems (Extended Abstract)Guru Guruganesh, Laura Sanità, Chaitanya Swamy. 676-695 [doi]
• k-Median Beyond the Natural LP RelaxationShi Li. 696-707 [doi]
• Dynamic Facility Location via Exponential ClocksHyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson. 708-721 [doi]
• k-Median ProblemsJaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase. 722-736 [doi]
• k-median, and Positive Correlation in Budgeted OptimizationJaroslaw Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh. 737-756 [doi]
• The amortized cost of finding the minimumHaim Kaplan, Or Zamir, Uri Zwick. 757-768 [doi]
• Approximate Range Emptiness in Constant Time and Optimal SpaceMayank Goswami, Allan Grønlund Jørgensen, Kasper Green Larsen, Rasmus Pagh. 769-775 [doi]
• Set membership with a few bit probesMohit Garg 0003, Jaikumar Radhakrishnan. 776-784 [doi]
• Deterministic Fully Dynamic Data Structures for Vertex Cover and MatchingSayan Bhattacharya, Monika Henzinger, Giuseppe F. Italiano. 785-804 [doi]
• A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General GraphsMichael Elkin, Seth Pettie. 805-821 [doi]
• Strong Inapproximability Results on Balanced Rainbow-Colorable HypergraphsVenkatesan Guruswami, Euiwoong Lee. 822-836 [doi]
• The matching polytope does not admit fully-polynomial size relaxation schemesGábor Braun, Sebastian Pokutta. 837-846 [doi]
• Towards a Characterization of Constant-Factor Approximable Min CSPsVíctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran. 847-857 [doi]
• The Simplex Algorithm is NP-mightyYann Disser, Martin Skutella. 858-872 [doi]
• Sperner's Colorings, Hypergraph Labeling Problems and Fair DivisionMaryam Mirzakhani, Jan Vondrák. 873-886 [doi]
• Online Principal Components AnalysisChristos Boutsidis, Dan Garber, Zohar Shay Karnin, Edo Liberty. 887-901 [doi]
• Tighter Low-rank Approximation via Sampling the Leveraged ElementSrinadh Bhojanapalli, Prateek Jain 0002, Sujay Sanghavi. 902-920 [doi]
• M-Estimators: A Unified Approach to Robust RegressionKenneth L. Clarkson, David P. Woodruff. 921-939 [doi]
• The Polyhedron-Hitting ProblemVentsislav Chonev, Joël Ouaknine, James Worrell. 940-956 [doi]
• On Termination of Integer Linear LoopsJoël Ouaknine, João Sousa Pinto, James Worrell. 957-969 [doi]
• n)-time breaks the Exponential Time HypothesisMark Braverman, Young Kun-Ko, Omri Weinstein. 970-982 [doi]
• Perfect Bayesian Equilibria in Repeated SalesNikhil R. Devanur, Yuval Peres, Balasubramanian Sivan. 983-1002 [doi]
• A Stable Marriage Requires CommunicationYannai A. Gonczarowski, Noam Nisan, Rafail Ostrovsky, Will Rosenbaum. 1003-1017 [doi]
• The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff GamesKrishnendu Chatterjee, Rasmus Ibsen-Jensen. 1018-1029 [doi]
• Robust Price of Anarchy Bounds via LP and Fenchel DualityJanardhan Kulkarni, Vahab S. Mirrokni. 1030-1049 [doi]
• New Approximations for Broadcast Scheduling via Variants of α-point RoundingSungjin Im, Maxim Sviridenko. 1050-1069 [doi]
• A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng. 1070-1086 [doi]
• ∊)-Restricted Assignment Makespan MinimizationDeeparnab Chakrabarty, Sanjeev Khanna, Shi Li. 1087-1101 [doi]
• A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep StateAntonios Antoniadis, Chien-Chung Huang, Sebastian Ott. 1102-1113 [doi]
• Rejecting jobs to Minimize Load and Maximum Flow-timeAnamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar 0001. 1114-1133 [doi]
• Optimal approximation for submodular and supermodular optimization with bounded curvatureMaxim Sviridenko, Jan Vondrák, Justin Ward. 1134-1148 [doi]
• Comparing Apples and Oranges: Query Tradeoff in Submodular MaximizationNiv Buchbinder, Moran Feldman, Roy Schwartz. 1149-1168 [doi]
• K-Matching with Random Arrival OrderT.-H. Hubert Chan, Fei Chen, Shaofeng H.-C. Jiang. 1169-1188 [doi]
• O(log log(rank))-Competitive Algorithm for the Matroid Secretary ProblemMoran Feldman, Ola Svensson, Rico Zenklusen. 1189-1201 [doi]
• Online Submodular Maximization with PreemptionNiv Buchbinder, Moran Feldman, Roy Schwartz. 1202-1216 [doi]
• Streaming Algorithms for Estimating the Matching Size in Planar Graphs and BeyondHossein Esfandiari, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak. 1217-1233 [doi]
• Parameterized Streaming: Maximal Matching and Vertex CoverRajesh Hemant Chitnis, Graham Cormode, Mohammad Taghi Hajiaghayi, Morteza Monemizadeh. 1234-1251 [doi]
• A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicityTimothy Naumovitz, Michael Saks. 1252-1262 [doi]
• Streaming Lower Bounds for Approximating MAX-CUTMichael Kapralov, Sanjeev Khanna, Madhu Sudan. 1263-1282 [doi]
• Decomposing a Graph Into Expanding SubgraphsGuy Moshkovitz, Asaf Shapira. 1283-1295 [doi]
• Capacity of Interactive Communication over Erasure Channels and Channels with FeedbackRan Gelles, Bernhard Haeupler. 1296-1311 [doi]
• Limitations on Testable Affine-Invariant Codes in the High-Rate RegimeVenkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang. 1312-1325 [doi]
• LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC CodesBadih Ghazi, Euiwoong Lee. 1326-1342 [doi]
• On the Quickest Flow Problem in Dynamic Networks - A Parametric Min-Cost Flow ApproachMaokai Lin, Patrick Jaillet. 1343-1356 [doi]
• Combinatorial Algorithm for Restricted Max-Min Fair AllocationChidambaram Annamalai, Christos Kalaitzis, Ola Svensson. 1357-1372 [doi]
• Online Network Design Algorithms via Hierarchical DecompositionsSeeun Umboh. 1373-1387 [doi]
• Online Stochastic Matching with Unequal ProbabilitiesAranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam. 1388-1404 [doi]
• Fast Algorithms for Online Stochastic Convex ProgrammingShipra Agrawal, Nikhil R. Devanur. 1405-1424 [doi]
• The optimal absolute ratio for online bin packingJános Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee. 1425-1438 [doi]
• Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in ParallelZeyuan Allen Zhu, Lorenzo Orecchia. 1439-1456 [doi]
• Approximation Schemes for Partitioning: Convex Decomposition and Surface ApproximationSayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan. 1457-1470 [doi]
• A Unified Framework for Clustering Constrained Data without Locality PropertyHu Ding, Jinhui Xu. 1471-1490 [doi]
• A quasi-PTAS for the Two-Dimensional Geometric Knapsack ProblemAnna Adamaszek, Andreas Wiese. 1491-1505 [doi]
• On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed CurvesJános Pach, Natan Rubin, Gábor Tardos. 1506-1516 [doi]
• Density and regularity theorems for semi-algebraic hypergraphsJacob Fox, János Pach, Andrew Suk. 1517-1530 [doi]
• FPTAS for Counting Monotone CNFJingcheng Liu, Pinyan Lu. 1531-1548 [doi]
• Spatial mixing and the connective constant: Optimal boundsAlistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin. 1549-1563 [doi]
• The switch Markov chain for sampling irregular graphs (Extended Abstract)Catherine S. Greenhill. 1564-1572 [doi]
• Phase Transitions in Random Dyadic Tilings and Rectangular DissectionsSarah Cannon, Sarah Miracle, Dana Randall. 1573-1589 [doi]
• The Speed of EvolutionNisheeth K. Vishnoi. 1590-1601 [doi]
• Compatible Connectivity-Augmentation of Planar Disconnected GraphsGreg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin. 1602-1615 [doi]
• k Shortest PathsSylvester David Eriksson-Bique, John Hershberger, Valentin Polishchuk, Bettina Speckmann, Subhash Suri, Topi Talvitie, Kevin Verbeek, Hakan Yildiz. 1616-1625 [doi]
• Triangulation Refinement and Approximate Shortest Paths in Weighted RegionsSiu-Wing Cheng, Jiongxin Jin, Antoine Vigneron. 1626-1640 [doi]
• Optimal detection of intersections between convex polyhedraLuis Barba, Stefan Langerman. 1641-1654 [doi]
• Detecting Weakly Simple PolygonsHsien-Chih Chang, Jeff Erickson, Chao Xu. 1655-1670 [doi]
• Finding Four-Node Subgraphs in Triangle TimeVirginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu. 1671-1680 [doi]
• Subcubic Equivalences Between Graph Centrality Problems, APSP and DiameterAmir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams. 1681-1697 [doi]
• Minors and DimensionBartosz Walczak. 1698-1707 [doi]
• Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithmMathew C. Francis, Pavol Hell, Juraj Stacho. 1708-1727 [doi]
• 2, 4 minorsLino Demasi, Bojan Mohar. 1728-1742 [doi]
• extended abstractRajko Nenadov, Nemanja Skoric, Angelika Steger. 1743-1751 [doi]
• extended abstractAsaf Ferber, Rajko Nenadov, Ueli Peter, Andreas Noever, Nemanja Skoric. 1752-1758 [doi]
• Surprise probabilities in Markov chainsJames Norris, Yuval Peres, Alex Zhai. 1759-1773 [doi]
• Characterization of cutoff for reversible Markov chainsRiddhipratim Basu, Jonathan Hermon, Yuval Peres. 1774-1791 [doi]
• Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovász Local LemmaDavid G. Harris. 1792-1808 [doi]
• Property Testing on Product Distributions: Optimal Testers for Bounded Derivative PropertiesDeeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri. 1809-1828 [doi]
• Testing Poisson Binomial DistributionsJayadev Acharya, Constantinos Daskalakis. 1829-1840 [doi]
• Testing Identity of Structured DistributionsIlias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin. 1841-1854 [doi]
• The Complexity of Estimating Rényi EntropyJayadev Acharya, Alon Orlitsky, Ananda Theertha Suresh, Himanshu Tyagi. 1855-1869 [doi]
• Algorithmic regularity for polynomials and applicationsArnab Bhattacharyya, Pooya Hatami, Madhur Tulsiani. 1870-1889 [doi]
• Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)Sampath Kannan, Jamie Morgenstern, Aaron Roth, Zhiwei Steven Wu. 1890-1903 [doi]
• Robust randomized matchingsJannik Matuschke, Martin Skutella, José A. Soto. 1904-1915 [doi]
• The size of the core in assignment marketsYash Kanoria, Daniela Sabán, Jay Sethuraman. 1916-1924 [doi]
• A dynamic model of barter exchangeRoss Anderson, Itai Ashlagi, David Gamarnik, Yash Kanoria. 1925-1933 [doi]
• AlgorithmsConstantinos Daskalakis, S. Matthew Weinberg. 1934-1952 [doi]
• Contagious Sets in ExpandersAmin Coja-Oghlan, Uriel Feige, Michael Krivelevich, Daniel Reichman. 1953-1987 [doi]
• 2-Edge Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis. 1988-2005 [doi]
• Tight Bounds on Vertex Connectivity Under Vertex SamplingKeren Censor Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn. 2006-2018 [doi]
• Fast Generation of Random Spanning Trees and the Effective Resistance MetricAleksander Madry, Damian Straszak, Jakub Tarnawski. 2019-2036 [doi]
• Connectivity in Random Forests and Credit NetworksAshish Goel, Sanjeev Khanna, Sharath Raghvendra, Hongyang Zhang. 2037-2048 [doi]