Abstract is missing.
- Front Matter [doi]
- Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor SearchSariel Har-Peled, Sepideh Mahabadi. 1-15 [doi]
- r-netsGeorgia Avarikioti, Ioannis Z. Emiris, Loukas Kavouras, Ioannis Psarros. 16-30 [doi]
- A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive FilteringTobias Christiani. 31-46 [doi]
- Optimal Hashing-based Time-Space Trade-offs for Approximate Near NeighborsAlexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten. 47-66 [doi]
- LSH Forest: Practical Algorithms Made TheoreticalAlexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki. 67-78 [doi]
- Faster approximation schemes for the two-dimensional knapsack problemSandy Heydrich, Andreas Wiese. 79-98 [doi]
- Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case DensitySebastian Morr. 99-109 [doi]
- j-Flat-Center ProblemsLingxiao Huang, Jian Li. 110-129 [doi]
- Local Search for Max-Sum DiversificationAlfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen. 130-142 [doi]
- Maximum Scatter TSP in Doubling MetricsLászló Kozma 0002, Tobias Mömke. 143-153 [doi]
- p Norms: Bounding the Convergence Rate of Osborne's IterationRafail Ostrovsky, Yuval Rabani, Arman Yousefi. 154-169 [doi]
- Decidability of the Membership Problem for 2 × 2 integer matricesIgor Potapov, Pavel Semukhin. 170-186 [doi]
- 2(ℤ) is NP-completePaul C. Bell, Mika Hirvensalo, Igor Potapov. 187-206 [doi]
- Exploring an Infinite Space with Finite Memory ScoutsLihi Cohen, Yuval Emek, Oren Louidor, Jara Uitto. 207-224 [doi]
- Universal Shape Replicators via Self-Assembly with Attractive and Repulsive ForcesCameron T. Chalk, Erik D. Demaine, Martin L. Demaine, Eric Martinez, Robert T. Schweller, Luis Vega, Tim Wylie. 225-238 [doi]
- Parameter-free Locality Sensitive Hashing for Spherical Range ReportingThomas D. Ahle, Martin Aumüller, Rasmus Pagh. 239-256 [doi]
- Distance Sensitive Bloom Filters Without False NegativesMayank Goswami, Rasmus Pagh, Francesco Silvestri 0001, Johan Sivertsen. 257-269 [doi]
- Optimal Approximate Polytope MembershipSunil Arya, Guilherme Dias da Fonseca, David M. Mount. 270-288 [doi]
- Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the HypercubePaul Beame, Cyrus Rashtchian. 289-306 [doi]
- Even Delta-Matroids and the Complexity of Planar Boolean CSPsAlexandr Kazda, Vladimir Kolmogorov, Michal Rolínek. 307-326 [doi]
- Linear Diophantine Equations, Group CSPs, and Graph IsomorphismChristoph Berkholz, Martin Grohe. 327-339 [doi]
- Robust algorithms with polynomial loss for near-unanimity CSPsVíctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal. 340-357 [doi]
- Parameterized Algorithms for Constraint Satisfaction Problems Above Average with Global Cardinality ConstraintsXue Chen, Yuan Zhou. 358-377 [doi]
- Hardness of Permutation Pattern MatchingVít Jelínek, Jan Kyncl. 378-396 [doi]
- pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related ProblemsArnab Ganguly 0002, Rahul Shah, Sharma V. Thankachan. 397-407 [doi]
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear TimeJ. Ian Munro, Gonzalo Navarro, Yakov Nekrich. 408-424 [doi]
- Sparse Suffix Tree Construction in Optimal Time and SpacePawel Gawrychowski, Tomasz Kociumaka. 425-439 [doi]
- Fully dynamic all-pairs shortest paths with worst-case update-time revisitedIttai Abraham, Shiri Chechik, Sebastian Krinninger. 440-452 [doi]
- Deterministic Partially Dynamic Single Source Shortest Paths for Sparse GraphsAaron Bernstein, Shiri Chechik. 453-469 [doi]
- n) Worst Case Update TimeSayan Bhattacharya, Monika Henzinger, Danupon Nanongkai. 470-489 [doi]
- Connectivity Oracles for Graphs Subject to Vertex FailuresRan Duan, Seth Pettie. 490-509 [doi]
- 2) Amortized Expected TimeShang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie. 510-520 [doi]
- Best-Response Dynamics in Combinatorial Auctions with Item BiddingPaul Dütting, Thomas Kesselheim. 521-533 [doi]
- Approximating Spanners and Directed Steiner Forest: Upper and Lower BoundsEden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit. 534-553 [doi]
- Convergence of Incentive-Driven Dynamics in Fisher MarketsKrishnamurthy Dvijotham, Yuval Rabani, Leonard J. Schulman. 554-567 [doi]
- A Hierarchy of Lower Bounds for Sublinear Additive SpannersAmir Abboud, Greg Bodwin, Seth Pettie. 568-576 [doi]
- Totally Unimodular Congestion GamesAlberto Del Pia, Michael Ferris, Carla Michini. 577-588 [doi]
- LAST but not Least: Online Spanners for Buy-at-BulkAnupam Gupta, R. Ravi 0001, Kunal Talwar, Seeun William Umboh. 589-599 [doi]
- Linear Size Distance PreserversGreg Bodwin. 600-615 [doi]
- Playing Anonymous Games using Simple StrategiesYu Cheng, Ilias Diakonikolas, Alistair Stewart. 616-631 [doi]
- Computing Walrasian Equilibria: Fast Algorithms and Structural PropertiesRenato Paes Leme, Sam Chiu-wai Wong. 632-651 [doi]
- Efficient Algorithms for Constructing Very Sparse Spanners and EmulatorsMichael Elkin, Ofer Neiman. 652-669 [doi]
- Metric embeddings with outliersAnastasios Sidiropoulos, DingKang Wang, Yusu Wang. 670-689 [doi]
- Probabilistic clustering of high dimensional normsAssaf Naor. 690-709 [doi]
- Near-Optimal (Euclidean) Metric CompressionPiotr Indyk, Tal Wagner. 710-723 [doi]
- A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth GraphsAmir Nayyeri, Benjamin Raichel. 724-736 [doi]
- Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth GraphsParinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz. 737-751 [doi]
- W) Time (Extended Abstract)Michael B. Cohen, Aleksander Madry, Piotr Sankowski, Adrian Vladu. 752-771 [doi]
- Generalized Preconditioning and Undirected Minimum-Cost FlowJonah Sherman. 772-780 [doi]
- Scaling Algorithms for Weighted Matching in General GraphsRan Duan, Seth Pettie, Hsin-Hao Su. 781-800 [doi]
- Near-Linear Time Approximation Schemes for some Implicit Fractional Packing ProblemsChandra Chekuri, Kent Quanrud. 801-820 [doi]
- Fast and Memory-Efficient Algorithms for Evacuation ProblemsMiriam Schlöter, Martin Skutella. 821-840 [doi]
- Approximate Hierarchical Clustering via Sparsest Cut and Spreading MetricsMoses Charikar, Vaggos Chatziafratis. 841-854 [doi]
- Approximating Multicut and the Demand GraphChandra Chekuri, Vivek Madan. 855-874 [doi]
- Minimum Fill-In: Inapproximability and Almost Tight Lower BoundsYixin Cao 0001, R. B. Sandeep. 875-880 [doi]
- Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex ExpansionEden Chlamtác, Michael Dinitz, Yury Makarychev. 881-899 [doi]
- Approximation Algorithms for Label Cover and The Log-Density ThresholdEden Chlamtác, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan. 900-919 [doi]
- An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of GraphsMichele Borassi, Pierluigi Crescenzi, Luca Trevisan. 920-939 [doi]
- Find Your Place: Simple Distributed Algorithms for Community DetectionLuca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan. 940-959 [doi]
- Sorting from Noisier SamplesAviad Rubinstein, Shai Vardi. 960-972 [doi]
- Sampling on the Sphere by Mutually Orthogonal SubspacesUri Grupel. 973-983 [doi]
- Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant IndividualsNicole Immorlica, Robert Kleinberg, Brendan Lucier, Morteza Zadomighaddam. 984-993 [doi]
- Tight Bounds for Online TSP on the LineAntje Bjelde, Yann Disser, Jan Hackfeld, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Kevin Schewior, Miriam Schlöter, Leen Stougie. 994-1005 [doi]
- An Improved Upper Bound for the Universal TSP on the GridGeorge Christodoulou 0001, Alkmini Sgouritsa. 1006-1021 [doi]
- k)-Server Problem on Bounded Depth TreesNikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos. 1022-1037 [doi]
- Online Lower Bounds via DualityYossi Azar, Ilan Reuven Cohen, Alan Roytman. 1038-1050 [doi]
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with DelaysYossi Azar, Ashish Chiplunkar, Haim Kaplan. 1051-1061 [doi]
- A Faster Pseudopolynomial Time Algorithm for Subset SumKonstantinos Koiliaris, Chao Xu. 1062-1072 [doi]
- A Near-Linear Pseudopolynomial Time Algorithm for Subset SumKarl Bringmann. 1073-1084 [doi]
- Computing minimum cuts in hypergraphsChandra Chekuri, Chao Xu. 1085-1100 [doi]
- Random Contractions and Sampling for Hypergraph and Hedge ConnectivityMohsen Ghaffari, David R. Karger, Debmalya Panigrahi. 1101-1114 [doi]
- Sandpile prediction on a tree in near linear timeAkshay Ramachandran, Aaron Schild. 1115-1131 [doi]
- Explicit Resilient Functions Matching Ajtai-LinialRaghu Meka. 1132-1148 [doi]
- Optimal induced universal graphs for bounded-degree graphsNoga Alon, Rajko Nenadov. 1149-1157 [doi]
- Approximation Algorithms for Finding Maximum Induced ExpandersShayan Oveis Gharan, Alireza Rezaei. 1158-1169 [doi]
- Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGsBernhard Haeupler, David G. Harris. 1170-1187 [doi]
- Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local LemmaDavid G. Harris. 1188-1203 [doi]
- Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition MatroidsT.-H. Hubert Chan, Zhiyi Huang 0002, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang. 1204-1223 [doi]
- Reordering Buffers with Logarithmic Diameter Dependency for TreesMatthias Englert, Harald Räcke. 1224-1234 [doi]
- O(depth)-Competitive Algorithm for Online Multi-level AggregationNiv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon. 1235-1244 [doi]
- K ranking problemXi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider. 1245-1264 [doi]
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex OptimizationVitaly Feldman, Cristobal Guzman, Santosh Vempala. 1265-1277 [doi]
- Sample-Optimal Density Estimation in Nearly-Linear TimeJayadev Acharya, Ilias Diakonikolas, Jerry Li 0001, Ludwig Schmidt. 1278-1289 [doi]
- On Rationality of Nonnegative Matrix FactorizationDmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell. 1290-1305 [doi]
- Make Up Your Mind: The Price of Online Queries in Differential PrivacyMark Bun, Thomas Steinke, Jonathan Ullman. 1306-1325 [doi]
- k-Subgraph with Perfect CompletenessMark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein. 1326-1341 [doi]
- The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with ApplicationsFrédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik Stein. 1342-1351 [doi]
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower BoundsPavel Hubácek, Eylon Yogev. 1352-1371 [doi]
- LP Relaxations of Some NP-Hard Problems Are as Hard as Any LPDaniel Prusa, Tomás Werner. 1372-1382 [doi]
- Feedback Vertex Set Inspired Kernel for Chordal Vertex DeletionAkanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi. 1383-1398 [doi]
- Approximation and Kernelization for Chordal Vertex DeletionBart M. P. Jansen, Marcin Pilipczuk. 1399-1418 [doi]
- Fully polynomial-time parameterized computations for graphs and matrices of low treewidthFedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh, Marcin Wrochna. 1419-1432 [doi]
- Spanning Circuits in Regular MatroidsFedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh. 1433-1441 [doi]
- Algorithmic and Hardness Results for the Hub Labeling ProblemHaris Angelidakis, Yury Makarychev, Vsevolod Oparin. 1442-1461 [doi]
- Beyond Highway Dimension: Small Distance Labels Using Tree SkeletonsAdrian Kosowski, Laurent Viennot. 1462-1478 [doi]
- f-Sensitive Distance OraclesShiri Chechik, Sarel Cohen, Amos Fiat, Haim Kaplan. 1479-1496 [doi]
- On the insertion time of random walk cuckoo hashingAlan M. Frieze, Tony Johansson. 1497-1502 [doi]
- File Maintenance: When in Doubt, Change the Layout!Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes. 1503-1522 [doi]
- Cross-Referenced Dictionaries and the Limits of Write OptimizationPeyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai. 1523-1532 [doi]
- Polynomial Kernels and Wideness Properties of Nowhere Dense Graph ClassesStephan Kreutzer, Roman Rabinovich, Sebastian Siebertz. 1533-1545 [doi]
- Partitioning a Graph into Small Pieces with Applications to Path TransversalEuiwoong Lee. 1546-1558 [doi]
- LP-branching algorithms based on biased graphsMagnus Wahlström. 1559-1570 [doi]
- About the Structure of the Integer Cone and its Application to Bin PackingKlaus Jansen, Kim-Manuel Klein. 1571-1581 [doi]
- Testing for Forbidden Order Patterns in an ArrayIlan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler. 1582-1597 [doi]
- Sequential measurements, disturbance and property testingAram Wettroth Harrow, Cedric Yen-Yu Lin, Ashley Montanaro. 1598-1611 [doi]
- A tight bound for Green's arithmetic triangle removal lemma in vector spacesJacob Fox, László Miklós Lovász. 1612-1617 [doi]
- Permutation Property Testing under Different Metrics with Low Query ComplexityJacob Fox, Fan Wei. 1618-1637 [doi]
- Online and Random-order Load Balancing SimultaneouslyMarco Molinaro. 1638-1650 [doi]
- Building a Good Team: Secretary Problems and the Supermodular DegreeMoran Feldman, Rani Izsak. 1651-1670 [doi]
- Combinatorial Prophet InequalitiesAviad Rubinstein, Sahil Singla. 1671-1687 [doi]
- Adaptivity Gaps for Stochastic Probing: Submodular and XOS FunctionsAnupam Gupta, Viswanath Nagarajan, Sahil Singla. 1688-1702 [doi]
- (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear SpaceMichael Kapralov, Sanjeev Khanna, Madhu Sudan, Ameya Velingker. 1703-1722 [doi]
- On Estimating Maximum Matching Size in Graph StreamsSepehr Assadi, Sanjeev Khanna, Yang Li. 1723-1742 [doi]
- Faster Sublinear Algorithms using Conditional SamplingThemistoklis Gouleakis, Christos Tzamos, Manolis Zampetakis. 1743-1757 [doi]
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score SamplingMichael B. Cohen, Cameron Musco, Christopher Musco. 1758-1777 [doi]
- A Hybrid Sampling Scheme for Triangle CountingJohn Kallaugher, Eric Price. 1778-1797 [doi]
- An FPTAS for Counting Proper Four-Colorings on Cubic GraphsPinyan Lu, Kuan Yang, Chihao Zhang, Minshen Zhu. 1798-1817 [doi]
- Random cluster dynamics for the Ising model is rapidly mixingHeng Guo, Mark Jerrum. 1818-1827 [doi]
- Approximately Sampling Elements with Fixed Rank in Graded PosetsPrateek Bhakta, Ben Cousins, Matthew Fahrbach, Dana Randall. 1828-1838 [doi]
- 2) Cover TimeRoee David, Uriel Feige. 1839-1848 [doi]
- Random Walks and Evolving Sets: Faster Convergences and LimitationsSiu On Chan, Tsz Chiu Kwok, Lap Chi Lau. 1849-1865 [doi]
- nm) time algorithm for finding the min length directed cycle in a graphJames B. Orlin, Antonio Sedeño-Noda. 1866-1879 [doi]
- Strong Connectivity in Directed Graphs under Failures, with ApplicationsLoukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. 1880-1899 [doi]
- Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed GraphsShiri Chechik, Thomas Dueholm Hansen, Giuseppe F. Italiano, Veronika Loitzenbauer, Nikos Parotsidis. 1900-1918 [doi]
- Local Flow Partitioning for Faster Edge ConnectivityMonika Henzinger, Satish Rao, Di Wang. 1919-1938 [doi]
- Doubly Balanced Connected Graph PartitioningSaleh Soltan, Mihalis Yannakakis, Gil Zussman. 1939-1950 [doi]
- Three Colors Suffice: Conflict-Free Coloring of Planar GraphsZachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer. 1951-1963 [doi]
- LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth GraphsNikhil Bansal, Daniel Reichman 0001, Seeun William Umboh. 1964-1979 [doi]
- LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar GraphsFabrizio Frati, Maurizio Patrignani, Vincenzo Roselli. 1980-1999 [doi]
- Partial and Constrained Level PlanarityGuido Brückner, Ignaz Rutter. 2000-2011 [doi]
- Accurate and Nearly Optimal Sublinear Approximations to Ulam DistanceTimothy Naumovitz, Michael E. Saks, C. Seshadhri. 2012-2031 [doi]
- A Framework for Analyzing Resparsification AlgorithmsRasmus Kyng, Jakub Pachocki, Richard Peng, Sushant Sachdeva. 2032-2043 [doi]
- Adaptive Matrix Vector ProductSantosh Srinivas Vempala, David P. Woodruff. 2044-2060 [doi]
- Low-Rank PSD Approximation in Input-Sparsity TimeKenneth L. Clarkson, David P. Woodruff. 2061-2072 [doi]
- Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov BoundSivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf. 2073-2091 [doi]
- Maximally Recoverable Codes for Grid-like TopologiesParikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin. 2092-2108 [doi]
- MDS Code Constructions with Small Sub-packetization and Near-optimal Repair BandwidthVenkatesan Guruswami, Ankit Singh Rawat. 2109-2122 [doi]
- Bridging the Capacity Gap Between Interactive and One-Way CommunicationBernhard Haeupler, Ameya Velingker. 2123-2142 [doi]
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar GraphsSergio Cabello. 2143-2152 [doi]
- A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming ModelAmi Paz, Gregory Schwartzman. 2153-2161 [doi]
- Completeness for First-Order Properties on Sparse Structures with Algorithmic ApplicationsJiawei Gao, Russell Impagliazzo, Antonina Kolokolova, R. Ryan Williams. 2162-2181 [doi]
- Faster Online Matrix-Vector MultiplicationKasper Green Larsen, R. Ryan Williams. 2182-2189 [doi]
- Beating Brute Force for Systems of Polynomial Equations over Finite FieldsDaniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu. 2190-2202 [doi]
- The Complexity of Simulation and Matrix MultiplicationMassimo Cairo, Romeo Rizzi. 2203-2214 [doi]
- Better Approximations for Tree Sparsity in Nearly-Linear TimeArturs Backurs, Piotr Indyk, Ludwig Schmidt. 2215-2229 [doi]
- Counting matchings in irregular bipartite graphs and random liftsMarc Lelarge. 2230-2237 [doi]
- A constant-time algorithm for middle levels Gray codesTorsten Mütze, Jerri Nummenpalo. 2238-2253 [doi]
- On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbersChaya Keller, Shakhar Smorodinsky, Gábor Tardos. 2254-2263 [doi]
- Core congestion is inherent in hyperbolic networksVictor Chepoi, Feodor F. Dragan, Yann Vaxès. 2264-2279 [doi]
- Better upper bounds on the Füredi-Hajnal limits of permutationsJosef Cibulka, Jan Kyncl. 2280-2293 [doi]
- Popularity, Mixed Matchings, and Self-dualityChien-Chung Huang, Telikepalli Kavitha. 2294-2310 [doi]
- Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering InequalitiesShi Li. 2311-2325 [doi]
- Small Extended Formulation for Knapsack Cover Inequalities from Monotone CircuitsAbbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson. 2326-2341 [doi]
- Extension Complexity Lower Bounds for Mixed-Integer Extended FormulationsRobert Hildebrand, Robert Weismantel, Rico Zenklusen. 2342-2350 [doi]
- Opting Into Optimal MatchingsAvrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia, Eviatar B. Procaccia, Rohit Vaish. 2351-2363 [doi]
- Firefighting on Trees Beyond Integrality GapsDavid Adjiashvili, Andrea Baggio, Rico Zenklusen. 2364-2383 [doi]
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded CostsDavid Adjiashvili. 2384-2399 [doi]
- Simplex Transformations and the Multiway Cut ProblemNiv Buchbinder, Roy Schwartz, Baruch Weizman. 2400-2410 [doi]
- To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating SlackFabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou 0001. 2411-2422 [doi]
- Optimization of Bootstrapping in CircuitsFabrice Benhamouda, Tancrède Lepoint, Claire Mathieu, Hang Zhou 0001. 2423-2433 [doi]
- Geodesic Spanners for Points on a Polyhedral TerrainMohammad Ali Abam, Mark de Berg, Mohammad Javad Rezaei Seraji. 2434-2442 [doi]
- Computing the Fréchet Distance between Real-Valued SurfacesKevin Buchin, Tim Ophelders, Bettina Speckmann. 2443-2455 [doi]
- Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distancesMicha Sharir, Noam Solomon. 2456-2475 [doi]
- Eliminating Depth Cycles among Triangles in Three DimensionsBoris Aronov, Edward Y. Miller, Micha Sharir. 2476-2494 [doi]
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic ApplicationsHaim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir. 2495-2504 [doi]
- Distributed Degree Splitting, Edge Coloring, and OrientationsMohsen Ghaffari, Hsin-Hao Su. 2505-2523 [doi]
- Tight Network Topology Dependent Bounds on Rounds of CommunicationArkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra. 2524-2539 [doi]
- Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bitsLucas Boczkowski, Amos Korman, Emanuele Natale. 2540-2559 [doi]
- Time-Space Trade-offs in Population ProtocolsDan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, Ronald L. Rivest. 2560-2579 [doi]
- Fair Coin Flipping: Tighter Analysis and the Many-Party CaseNiv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia. 2580-2600 [doi]
- Fair Scheduling via Iterative Quasi-Uniform SamplingSungjin Im, Benjamin Moseley. 2601-2615 [doi]
- A Logarithmic Additive Integrality Gap for Bin PackingRebecca Hoberg, Thomas Rothvoss. 2616-2625 [doi]
- Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and HypergraphsSam Chiu-wai Wong. 2626-2637 [doi]
- Iterative Partial Rounding for Vertex Cover with Hard CapacitiesMong-Jen Kao. 2638-2653 [doi]
- Unrelated Machine Scheduling of Jobs with Uniform Smith RatiosChristos Kalaitzis, Ola Svensson, Jakub Tarnawski. 2654-2669 [doi]
- On the Configuration-LP of the Restricted Assignment ProblemKlaus Jansen, Lars Rohwedder. 2670-2678 [doi]
- When and Why the Topological Coverage Criterion WorksNicholas J. Cavanna, Kirk P. Gardner, Donald R. Sheehy. 2679-2690 [doi]
- Deciding Contractibility of a Non-Simple Curve on the Boundary of a 3-ManifoldÉric Colin de Verdière, Salman Parsa. 2691-2704 [doi]
- An Efficient Representation for Filtrations of Simplicial ComplexesJean-Daniel Boissonnat, Karthik C. S.. 2705-2720 [doi]
- A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti numberClément Maria, Jonathan Spreer. 2721-2732 [doi]
- Parameter-free Topology Inference and Sparsification for Data on ManifoldsTamal K. Dey, Zhe Dong, Yusu Wang. 2733-2747 [doi]