Abstract is missing.
- Losing Weight by Gaining EdgesAmir Abboud, Kevin Lewi, Ryan Williams. 1-12 [doi]
- Optimal Coordination Mechanisms for Multi-job Scheduling GamesFidaa Abed, José R. Correa, Chien-Chung Huang. 13-24 [doi]
- Theory and Practice of Chunked SequencesUmut A. Acar, Arthur Charguéraud, Mike Rainey. 25-36 [doi]
- Convex Hulls under UncertaintyPankaj K. Agarwal, Sariel Har-Peled, Subhash Suri, Hakan Yildiz, Wuzhou Zhang. 37-48 [doi]
- The Space-Stretch-Time Tradeoff in Distance OraclesRachit Agarwal. 49-60 [doi]
- Distribution-Sensitive Construction of the Greedy SpannerSander P. A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink. 61-73 [doi]
- Recognizing Shrinkable Complexes Is NP-CompleteDominique Attali, Olivier Devillers, Marc Glisse, Sylvain Lazard. 74-86 [doi]
- Improved Approximation Algorithms for Box Contact RepresentationsMichael A. Bekos, Thomas C. van Dijk, Martin Fink, Philipp Kindermann, Stephen G. Kobourov, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff. 87-99 [doi]
- Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and AlgorithmsRinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis. 100-111 [doi]
- The Batched Predecessor Problem in External MemoryMichael A. Bender, Martin Farach-Colton, Mayank Goswami, Dzejla Medjedovic, Pablo Montes, Meng-Tsung Tsai. 112-124 [doi]
- Polynomial Decompositions in Polynomial TimeArnab Bhattacharyya. 125-136 [doi]
- Fault-Tolerant Approximate Shortest-Path TreesDavide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti. 137-148 [doi]
- Fast Witness Extraction Using a Decision OracleAndreas Björklund, Petteri Kaski, Lukasz Kowalik. 149-160 [doi]
- Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky ModelThomas Bläsius, Guido Brückner, Ignaz Rutter. 161-172 [doi]
- A Subexponential Parameterized Algorithm for Proper Interval CompletionIvan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. 173-184 [doi]
- Computing Persistent Homology with Various Coefficient Fields in a Single PassJean-Daniel Boissonnat, Clément Maria. 185-196 [doi]
- De-anonymization of Heterogeneous Random Graphs in Quasilinear TimeKarl Bringmann, Tobias Friedrich, Anton Krohmer. 197-208 [doi]
- Competitive Algorithms for Restricted Caching and Matroid CachingNiv Buchbinder, Shahar Chen, Joseph Naor. 209-221 [doi]
- Improved Algorithms for Resource Allocation under Varying CapacityVenkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, Yogish Sabharwal. 222-234 [doi]
- Nearly Tight Approximability Results for Minimum Biclique Cover and PartitionParinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer. 235-246 [doi]
- Succinct Indices for Path Minimum, with Applications to Path ReportingTimothy M. Chan, Meng He, J. Ian Munro, Gelin Zhou. 247-259 [doi]
- Online Bipartite Matching with Decomposable WeightsMoses Charikar, Monika Henzinger, Huy L. Nguyen. 260-271 [doi]
- A Faster Algorithm for Computing Straight SkeletonsSiu-Wing Cheng, Liam Mencel, Antoine Vigneron. 272-283 [doi]
- Optimal Time-Space Tradeoff for the 2D Convex-Hull ProblemOmar Darwish, Amr Elmasry. 284-295 [doi]
- Cache-Oblivious PersistencePooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan. 296-308 [doi]
- Lightweight Approximate SelectionBrian C. Dean, Rommel Jalasutram, Chad Waters. 309-320 [doi]
- Robust Distance Queries on Massive NetworksDaniel Delling, Andrew V. Goldberg, Thomas Pajor, Renato F. Werneck. 321-333 [doi]
- A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-DepthZdenek Dvorak, Martin Kupec, Vojtech Tuma. 334-345 [doi]
- Large Independent Sets in Triangle-Free Planar GraphsZdenek Dvorak, Matthias Mnich. 346-357 [doi]
- GRASP. Extending Graph Separators for the Single-Source Shortest-Path ProblemAlexandros Efentakis, Dieter Pfoser. 358-370 [doi]
- Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness ThresholdCharilaos Efthymiou. 371-381 [doi]
- From Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?Alina Ene, Huy L. Nguyên. 382-393 [doi]
- Deterministic Stateless Centralized Local Algorithms for Bounded Degree GraphsGuy Even, Moti Medina, Dana Ron. 394-405 [doi]
- Bicriteria Data Compression: Efficient and UsableAndrea Farruggia, Paolo Ferragina, Rossano Venturini. 406-417 [doi]
- Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected GraphsRui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot. 418-429 [doi]
- LP Approaches to Improved Approximation for Clique Transversal in Perfect GraphsSamuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman. 430-442 [doi]
- Representative Sets of Product FamiliesFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh. 443-454 [doi]
- Weighted Ancestors in Suffix TreesPawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson. 455-466 [doi]
- Improved Practical Matrix Sketching with GuaranteesMina Ghashami, Amey Desai, Jeff M. Phillips. 467-479 [doi]
- Computing Regions Decomposable into m StarsMatt Gibson, Kasturi R. Varadarajan, Xiaodong Wu. 480-491 [doi]
- The Parameterized Complexity of Graph CyclabilityPetr A. Golovach, Marcin Jakub Kaminski, Spyridon Maniatis, Dimitrios M. Thilikos. 492-504 [doi]
- Dimension Reduction via Colour RefinementMartin Grohe, Kristian Kersting, Martin Mladenov, Erkal Selman. 505-516 [doi]
- How Experts Can Solve LPs OnlineAnupam Gupta, Marco Molinaro. 517-529 [doi]
- Parameterized Complexity of the k-Arc Chinese Postman ProblemGregory Gutin, Mark Jones, Bin Sheng. 530-541 [doi]
- Approximating the Maximum Overlap of Polygons under TranslationSariel Har-Peled, Subhro Roy. 542-553 [doi]
- Ordering without Forbidden PatternsPavol Hell, Bojan Mohar, Arash Rafiey. 554-565 [doi]
- Halving Balls in Deterministic Linear TimeMichael Hoffmann, Vincent Kusters, Tillmann Miltzow. 566-578 [doi]
- Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph ClassesBart M. P. Jansen. 579-591 [doi]
- Optimal Parallel Quantum Query AlgorithmsStacey Jeffery, Frédéric Magniez, Ronald de Wolf. 592-604 [doi]
- Sublinear Space Algorithms for the Longest Common Substring ProblemTomasz Kociumaka, Tatiana A. Starikovskaya, Hjalte Wedel Vildhøj. 605-617 [doi]
- Nested Set UnionDaniel Larkin, Robert Endre Tarjan. 618-629 [doi]
- Improved Explicit Data Structures in the Bitprobe ModelMoshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman. 630-641 [doi]
- Deeper Local Search for Better Approximation on Maximum Internal Spanning TreesWenjun Li, Jianer Chen, Jianxin Wang. 642-653 [doi]
- FPTAS for Counting Weighted Edge CoversJingcheng Liu, Pinyan Lu, Chihao Zhang. 654-665 [doi]
- Solving Multicut Faster Than 2 nDaniel Lokshtanov, Saket Saurabh, Ondrej Suchý. 666-676 [doi]
- Tight Bounds for Active Self-assembly Using an Insertion PrimitiveCaleb Malchik, Andrew Winslow. 677-688 [doi]
- Trace Reconstruction RevisitedAndrew McGregor, Eric Price, Sofya Vorotnikova. 689-700 [doi]
- PReaCH: A Fast Lightweight Reachability Index Using Pruning and Contraction HierarchiesFlorian Merz, Peter Sanders. 701-712 [doi]
- Polynomial-Time Approximation Schemes for Circle Packing ProblemsFlávio Keidi Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, Maxim Sviridenko, Yoshiko Wakabayashi. 713-724 [doi]
- Document Retrieval on Repetitive CollectionsGonzalo Navarro, Simon J. Puglisi, Jouni Sirén. 725-736 [doi]
- An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic GraphsAlantha Newman. 737-749 [doi]
- The Input/Output Complexity of Sparse Matrix MultiplicationRasmus Pagh, Morten Stöckel. 750-761 [doi]
- Faster FPTASes for Counting and Random Generation of Knapsack SolutionsRomeo Rizzi, Alexandru I. Tomescu. 762-773 [doi]
- Improved Guarantees for Tree Cut SparsifiersHarald Räcke, Chintan Shah. 774-785 [doi]
- Representative Families: A Unified Tradeoff-Based ApproachHadas Shachnai, Meirav Zehavi. 786-797 [doi]
- A Branch and Price Procedure for the Container Premarshalling ProblemMartijn van Brink, Ruben van der Zwaan. 798-809 [doi]
- Space-Efficient Randomized Algorithms for K-SUMJoshua R. Wang. 810-829 [doi]
- Equivalence between Priority Queues and Sorting in External MemoryZhewei Wei, Ke Yi. 830-841 [doi]
- Amortized Bounds for Dynamic Orthogonal Range ReportingBryan T. Wilkinson. 842-856 [doi]