Journal: ACM Transactions on Algorithms

Volume 18, Issue 4

0 -- 0Zhihao Jiang, Debmalya Panigrahi, Kevin Sun 0001. Online Algorithms for Weighted Paging with Predictions
0 -- 0Jason Li 0006, Jesper Nederlof. k) Time
0 -- 0Gautam Kamath 0001, Sepehr Assadi, Anne Driemel, Janardhan Kulkarni. Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020
0 -- 0Matthew Joseph, Jieming Mao, Aaron Roth 0001. Exponential Separations in Local Privacy
0 -- 0Sepehr Abbasi Zadeh, Nikhil Bansal 0001, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz 0002, Mohit Singh. Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
0 -- 0Xi Chen 0001, Tim Randolph 0001, Rocco A. Servedio, Timothy Sun. A Lower Bound on Cycle-Finding in Sparse Digraphs
0 -- 0Hsien-Chih Chang, Arnaud de Mesmay. Tightening Curves on Surfaces Monotonically with Applications
0 -- 0Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. Tolerant Testers of Image Properties
0 -- 0Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount. Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
0 -- 0Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue 0003. Dynamic Geometric Set Cover and Hitting Set
0 -- 0Saladi Rahul, Yufei Tao 0001. k Structures

Volume 18, Issue 3

0 -- 0Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra. A Learned Approach to Design Compressed Rank/Select Data Structures
0 -- 0Joachim Gudmundsson, Sampson Wong. Improving the Dilation of a Metric Graph by Adding Edges
0 -- 0Kai Jin, Siu-Wing Cheng, Man-Kwun Chiu, Man Ting Wong. A Generalization of Self-Improving Algorithms
0 -- 0Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou 0001. t Effective Resistance
0 -- 0Weiming Feng 0001, Heng Guo 0001, Yitong Yin, Chihao Zhang 0001. Rapid Mixing from Spectral Independence beyond the Boolean Domain
0 -- 0Daniel Neuen. Hypergraph Isomorphism for Groups with Restricted Composition Factors
0 -- 0John Fearnley, Dömötör Pálvölgyi, Rahul Savani. A Faster Algorithm for Finding Tarski Fixed Points
0 -- 0Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos. k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms
0 -- 0Avery Miller, Andrzej Pelc, Ram Narayan Yadav. Deterministic Leader Election in Anonymous Radio Networks
0 -- 0Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer. Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

Volume 18, Issue 2

0 -- 0Dániel Marx, Michal Pilipczuk. Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
0 -- 0Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk. Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
0 -- 0Édouard Bonnet. 4/3
0 -- 0John Haslegrave, Thomas Sauerwald, John Sylvester 0001. Time Dependent Biased Random Walks
0 -- 0Sayan Bhattacharya, Fabrizio Grandoni 0001, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon. O(1) Update Time
0 -- 0Magnus Wahlström. Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
0 -- 0Monika Henzinger, Pan Peng 0001. Constant-time Dynamic (Δ +1)-Coloring
0 -- 0Sergio Cabello. Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
0 -- 0Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka. Exact Distance Oracles for Planar Graphs with Failing Vertices
0 -- 0Thomas Bläsius, Cedric Freiberger, Tobias Friedrich 0001, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry. Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry

Volume 18, Issue 1

0 -- 0Alessandra Graf, David G. Harris 0001, Penny Haxell. Algorithms for Weighted Independent Transversals and Strong Colouring
0 -- 0Martin Hoefer 0001, Tsvi Kopelowitz. Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue
0 -- 0Yipu Wang. Max Flows in Planar Graphs with Vertex Capacities
0 -- 0Alexander Wei. p
0 -- 0Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk. 6-free Graphs
0 -- 0Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young. A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
0 -- 0Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang. I/O-Efficient Algorithms for Topological Sort and Related Problems
0 -- 0Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay. SETH-based Lower Bounds for Subset Sum and Bicriteria Path
0 -- 0Ruosong Wang, David P. Woodruff. 1 Oblivious Subspace Embeddings
0 -- 0Siu-Wing Cheng, Man-Kit Lau. Dynamic Distribution-Sensitive Point Location