default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 17
Volume 17, Number 1, January 2021
- David G. Harris:
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma. 1:1-1:32 - Timothy M. Chan
, R. Ryan Williams:
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky. 2:1-2:14 - Antje 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. 3:1-3:58 - Heng Guo, Chao Liao, Pinyan Lu, Chihao Zhang:
Zeros of Holant Problems: Locations and Algorithms. 4:1-4:25 - Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger:
Fine-grained Complexity Analysis of Two Classic TSP Variants. 5:1-5:29 - Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh, Magnus Wahlström:
Randomized Contractions Meet Lean Decompositions. 6:1-6:30 - Nicola Prezza:
Optimal Substring Equality Queries with Applications to Sparse Text Indexing. 7:1-7:23 - Anders Roy Christiansen, Mikko Berggren Ettienne, Tomasz Kociumaka, Gonzalo Navarro, Nicola Prezza:
Optimal-Time Dictionary-Compressed Indexes. 8:1-8:39 - Sariel Har-Peled, Mitchell Jones:
Journey to the Center of the Point Set. 9:1-9:21 - Gregory Z. Gutin, Magnus Wahlström, Meirav Zehavi:
r-Simple k-Path and Related Problems Parameterized by k/r. 10:1-10:64
Volume 17, Number 2, June 2021
- Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
2-Approximating Feedback Vertex Set in Tournaments. 11:1-11:14 - Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi:
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. 12:1-12:68 - Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Finding a Shortest Odd Hole. 13:1-13:21 - Chandra Chekuri, Alina Ene, Ali Vakilian:
Node-weighted Network Design in Planar and Minor-closed Families of Graphs. 14:1-14:25 - Lucas Boczkowski, Uriel Feige, Amos Korman, Yoav Rodeh:
Navigating in Trees with Permanently Noisy Advice. 15:1-15:27 - Artur Czumaj, Peter Davies, Merav Parter:
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. 16:1-16:27 - Magnús M. Halldórsson, Tigran Tonoyan:
Sparse Backbone and Optimal Distributed SINR Algorithms. 17:1-17:34 - Omar Darwish, Amr Elmasry, Jyrki Katajainen:
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls. 18:1-18:19
Volume 17, Number 3, August 2021
- Edith Cohen:
Editorial. 19e:1 - Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran:
Improving the Smoothed Complexity of FLIP for Max Cut Problems. 19:1-19:38 - Christian Coester, Elias Koutsoupias, Philip Lazos:
The Infinite Server Problem. 20:1-20:23 - Caterina Viola, Stanislav Zivný:
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. 21:1-21:23 - Jacob Focke, Leslie Ann Goldberg, Stanislav Zivný:
The Complexity of Approximately Counting Retractions to Square-free Graphs. 22:1-22:51 - Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online Service with Delay. 23:1-23:31 - Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. 24:1-24:21 - Karl Bringmann, Marvin Künnemann, André Nusser:
Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm. 25:1-25:42 - Daniel Lokshtanov, Andreas Björklund, Saket Saurabh, Meirav Zehavi:
Approximate Counting of k-Paths: Simpler, Deterministic, and in Polynomial Space. 26:1-26:44 - Joshua Brakensiek, Venkatesan Guruswami:
The Quest for Strong Inapproximability Results with Perfect Completeness. 27:1-27:35
Volume 17, Number 4, October 2021
- Guy Even, Reut Levi, Moti Medina, Adi Rosén:
Sublinear Random Access Generators for Preferential Attachment Graphs. 28:1-28:26 - Aaron Bernstein, Sebastian Forster, Monika Henzinger:
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching. 29:1-29:51 - Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz:
Smaller Cuts, Higher Lower Bounds. 30:1-30:40 - Xiaoming Sun, David P. Woodruff, Guang Yang, Jialin Zhang:
Querying a Matrix through Matrix-Vector Products. 31:1-31:19 - Monaldo Mastrolilli:
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. 32:1-32:29 - Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese:
Approximating Geometric Knapsack via L-packings. 33:1-33:67 - Robert E. Tarjan, Caleb C. Levy, Stephen Timmel:
Zip Trees. 34:1-34:12 - Hyung-Chan An, Robert Kleinberg, David B. Shmoys:
Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem. 35:1-35:12 - Greg Bodwin, Virginia Vassilevska Williams:
Better Distance Preservers and Additive Spanners. 36:1-36:24
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-04 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
