default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 19
Volume 19, Number 1, January 2023
- Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication. 1:1-1:45 - Lior Gishboliner
, Yevgeny Levanzov, Asaf Shapira, Raphael Yuster:
Counting Homomorphic Cycles in Degenerate Graphs. 2:1-2:22 - Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams:
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter. 3:1-3:30 - Maike Buchin, Anne Driemel, Dennis Rohde:
Approximating (k,ℓ)-Median Clustering for Polygonal Curves. 4:1-4:32 - Rahul Shah, Cheng Sheng, Sharma V. Thankachan, Jeffrey Vitter:
Ranked Document Retrieval in External Memory. 5:1-5:12 - Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki:
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams. 6:1-6:22 - Sariel Har-Peled, Manor Mendel, Dániel Oláh:
Reliable Spanners for Metric Spaces. 7:1-7:27 - Nikhil Bansal, Marek Eliás, Grigorios Koumoutsos, Jesper Nederlof:
Competitive Algorithms for Generalized k-Server in Uniform Metrics. 8:1-8:15 - Karl Bringmann, Vincent Cohen-Addad, Debarati Das:
A Linear-Time n0.4-Approximation for Longest Common Subsequence. 9:1-9:24 - Franziska Eberle, Nicole Megow, Kevin Schewior:
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden. 10:1-10:25
Volume 19, Number 2, April 2023
- Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polynomial Kernel for Interval Vertex Deletion. 11:1-11:68 - Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Robust Algorithms for TSP and Steiner Tree. 12:1-12:37 - Kyle Fox, Debmalya Panigrahi, Fred Zhang:
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions. 13:1-13:22 - Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný:
PTAS for Sparse General-valued CSPs. 14:1-14:31 - Arun Ganesh, Bruce M. Maggs, Debmalya Panigrahi:
Universal Algorithms for Clustering Problems. 15:1-15:46 - Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak:
Approximating Pathwidth for Graphs of Small Treewidth. 16:1-16:19 - Claire Mathieu, Hang Zhou:
A PTAS for Capacitated Vehicle Routing on Trees. 17:1-17:28 - Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald:
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? 18:1-18:46 - Antonios Antoniadis, Christian Coester, Marek Eliás, Adam Polak, Bertrand Simon:
Online Metric Algorithms with Untrusted Predictions. 19:1-19:34 - Aditya Jayaprakash, Mohammad R. Salavatipour:
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. 20:1-20:36
Volume 19, Number 3, July 2023
- Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu, Roberto Grossi:
On the Complexity of String Matching for Graphs. 21:1-21:25 - Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. 22:1-22:32 - Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos:
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. 23:1-23:29 - Stefan Walzer:
Load Thresholds for Cuckoo Hashing with Overlapping Blocks. 24:1-24:22 - Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. 25:1-25:19 - Marco Bressan:
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs. 26:1-26:40 - Rajesh Jayaram, David P. Woodruff:
Towards Optimal Moment Estimation in Streaming and Distributed Models. 27:1-27:35 - Enoch Peserico, Michele Scquizzato:
Matching on the Line Admits no o(√log n)-Competitive Algorithm. 28:1-28:4 - Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen:
Fréchet Distance for Uncertain Curves. 29:1-29:47 - Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. 30:1-30:28
Volume 19, Number 4, October 2023
- Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. 31:1-31:17 - Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. 32:1-32:19 - Yi-Jun Chang, Ran Duan, Shunhua Jiang:
Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election. 33:1-33:23 - Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. 34:1-34:23 - Manuel Lafond:
Recognizing k-Leaf Powers in Polynomial Time, for Constant k. 35:1-35:35 - Jugal Garg, Pooja Kulkarni, Rucha Kulkarni:
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings. 36:1-36:25 - Stavros Birmpilis, George Labahn, Arne Storjohann:
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix. 37:1-37:36 - Surender Baswana, Koustav Bhanja, Abhyuday Pandey:
Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle. 38:1-38:41 - Arnold Filtser, Omrit Filtser:
Static and Streaming Data Structures for Fréchet Distance Queries. 39:1-39:36
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-08 20:20 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:
