default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 18
Volume 18, Number 1, January 2022
- Alessandra Graf, David G. Harris, Penny Haxell:
Algorithms for Weighted Independent Transversals and Strong Colouring. 1:1-1:16 - Marek Chrobak, Mordecai J. Golin
, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. 2:1-2:11 - Siu-Wing Cheng, Man-Kit Lau:
Dynamic Distribution-Sensitive Point Location. 3:1-3:63
- Martin Hoefer, Tsvi Kopelowitz:
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue. 4e:1-4e:2 - Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. 4:1-4:57 - Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang:
I/O-Efficient Algorithms for Topological Sort and Related Problems. 5:1-5:24 - Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-based Lower Bounds for Subset Sum and Bicriteria Path. 6:1-6:22 - Alexander Wei:
Optimal Las Vegas Approximate Near Neighbors in ℓp. 7:1-7:27 - Ruosong Wang, David P. Woodruff:
Tight Bounds for ℓ1 Oblivious Subspace Embeddings. 8:1-8:32 - Yipu Wang:
Max Flows in Planar Graphs with Vertex Capacities. 9:1-9:27
Volume 18, Number 2, April 2022
- Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. 10:1-10:25 - Édouard Bonnet:
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n4/3. 11:1-11:14 - John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. 12:1-12:30 - Dániel Marx, Michal Pilipczuk:
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. 13:1-13:64 - Sergio Cabello:
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth. 14:1-14:26 - Magnus Wahlström:
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. 15:1-15:19 - Monika Henzinger, Pan Peng:
Constant-time Dynamic (Δ +1)-Coloring. 16:1-16:21 - Marek 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. 17:1-17:31 - Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka:
Exact Distance Oracles for Planar Graphs with Failing Vertices. 18:1-18:23 - Thomas Bläsius, Cedric Freiberger, Tobias Friedrich, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry:
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry. 19:1-19:32
Volume 18, Number 3, July 2022
- Joachim Gudmundsson, Sampson Wong:
Improving the Dilation of a Metric Graph by Adding Edges. 20:1-20:20 - Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. 21:1-21:30 - Pak Hay Chan, Lap Chi Lau, Aaron Schild, Sam Chiu-wai Wong, Hong Zhou:
Network Design for s-t Effective Resistance. 22:1-22:45 - John Fearnley, Dömötör Pálvölgyi, Rahul Savani:
A Faster Algorithm for Finding Tarski Fixed Points. 23:1-23:23 - Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra:
A Learned Approach to Design Compressed Rank/Select Data Structures. 24:1-24:28 - Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. 25:1-25:33 - Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. 26:1-26:27 - Daniel Neuen:
Hypergraph Isomorphism for Groups with Restricted Composition Factors. 27:1-27:50 - Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang:
Rapid Mixing from Spectral Independence beyond the Boolean Domain. 28:1-28:32 - Kai Jin, Siu-Wing Cheng, Man-Kwun Chiu, Man Ting Wong:
A Generalization of Self-Improving Algorithms. 29:1-29:32
Volume 18, Number 4, October 2022
- Gautam Kamath, Sepehr Assadi, Anne Driemel, Janardhan Kulkarni:
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020. 30:1-30:2 - Xi Chen, Tim Randolph, Rocco A. Servedio, Timothy Sun:
A Lower Bound on Cycle-Finding in Sparse Digraphs. 31:1-31:23 - Matthew Joseph, Jieming Mao, Aaron Roth:
Exponential Separations in Local Privacy. 32:1-32:17 - Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. 33:1-33:50 - Jason Li, Jesper Nederlof:
Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time. 34:1-34:26 - Rahul Arya, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount:
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes. 35:1-35:29 - Hsien-Chih Chang, Arnaud de Mesmay:
Tightening Curves on Surfaces Monotonically with Applications. 36:1-36:32
- Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Tolerant Testers of Image Properties. 37:1-37:39 - Saladi Rahul, Yufei Tao:
Generic Techniques for Building Top-k Structures. 38:1-38:23 - Zhihao Jiang, Debmalya Panigrahi, Kevin Sun:
Online Algorithms for Weighted Paging with Predictions. 39:1-39:27 - Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic Geometric Set Cover and Hitting Set. 40:1-40:37
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 2025-11-04 00:42 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:
