External Links

    Journal: ACM Transactions on Algorithms

    Volume 17, Issue 4

    0 -- 0Xiaoming Sun, David P. Woodruff, Guang Yang, Jialin Zhang 0001. Querying a Matrix through Matrix-Vector Products
    0 -- 0Waldo Gálvez, Fabrizio Grandoni 0001, Salvatore Ingala, Sandy Heydrich, Arindam Khan 0001, Andreas Wiese. Approximating Geometric Knapsack via L-packings
    0 -- 0Amir Abboud, Keren Censor Hillel, Seri Khoury, Ami Paz. Smaller Cuts, Higher Lower Bounds
    0 -- 0Guy Even, Reut Levi, Moti Medina, Adi Rosén. Sublinear Random Access Generators for Preferential Attachment Graphs
    0 -- 0Greg Bodwin, Virginia Vassilevska Williams. Better Distance Preservers and Additive Spanners
    0 -- 0Hyung-Chan An, Robert Kleinberg, David B. Shmoys. Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    0 -- 0Monaldo Mastrolilli. The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
    0 -- 0Robert E. Tarjan, Caleb C. Levy, Stephen Timmel. Zip Trees
    0 -- 0Aaron Bernstein, Sebastian Forster, Monika Henzinger. A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching

    Volume 17, Issue 3

    0 -- 0Karl Bringmann, Marvin Künnemann, André Nusser. Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm
    0 -- 0Christian Coester, Elias Koutsoupias, Philip Lazos. The Infinite Server Problem
    0 -- 0Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi. Online Service with Delay
    0 -- 0Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran. Improving the Smoothed Complexity of FLIP for Max Cut Problems
    0 -- 0Joshua Brakensiek, Venkatesan Guruswami. The Quest for Strong Inapproximability Results with Perfect Completeness
    0 -- 0Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný. The Complexity of Approximately Counting Retractions to Square-free Graphs
    0 -- 0Edith Cohen. Editorial
    0 -- 0Daniel Lokshtanov, Andreas Björklund, Saket Saurabh 0001, Meirav Zehavi. k-Paths: Simpler, Deterministic, and in Polynomial Space
    0 -- 0Caterina Viola, Stanislav Zivný. The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains
    0 -- 0Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton. On β-Plurality Points in Spatial Voting Games

    Volume 17, Issue 2

    0 -- 0Artur Czumaj, Peter Davies, Merav Parter. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
    0 -- 0Maria Chudnovsky, Alex Scott 0001, Paul D. Seymour. Finding a Shortest Odd Hole
    0 -- 0Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi. Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
    0 -- 0Magnús M. Halldórsson, Tigran Tonoyan. Sparse Backbone and Optimal Distributed SINR Algorithms
    0 -- 0Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001. 2-Approximating Feedback Vertex Set in Tournaments
    0 -- 0Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh. Navigating in Trees with Permanently Noisy Advice
    0 -- 0Chandra Chekuri, Alina Ene, Ali Vakilian. Node-weighted Network Design in Planar and Minor-closed Families of Graphs
    0 -- 0Omar Darwish, Amr Elmasry, Jyrki Katajainen. Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls

    Volume 17, Issue 1

    0 -- 0Nicola Prezza. Optimal Substring Equality Queries with Applications to Sparse Text Indexing
    0 -- 0Timothy M. Chan, R. Ryan Williams. Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
    0 -- 0Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza. Optimal-Time Dictionary-Compressed Indexes
    0 -- 0Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi. r
    0 -- 0Antje Bjelde, Jan Hackfeld, Yann Disser, Christoph Hansknecht, Maarten Lipmann, Julie Meißner, Miriam Schlöter, Kevin Schewior, Leen Stougie. Tight Bounds for Online TSP on the Line
    0 -- 0Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001, Magnus Wahlström. Randomized Contractions Meet Lean Decompositions
    0 -- 0Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger. Fine-grained Complexity Analysis of Two Classic TSP Variants
    0 -- 0Sariel Har-Peled, Mitchell Jones. Journey to the Center of the Point Set
    0 -- 0Heng Guo 0001, Chao Liao, Pinyan Lu, Chihao Zhang 0001. Zeros of Holant Problems: Locations and Algorithms
    0 -- 0David G. Harris. Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma
    runs on