Sign in
ACM Trans. Algorithms
2005
2011
2018
2024
2005
2024
Keyphrases
Publications
volume 20, number 1, 2024
Lars Gottesbüren
,
Tobias Heuer
,
Nikolai Maas
,
Peter Sanders
,
Sebastian Schlag
Scalable High-Quality Hypergraph Partitioning.
ACM Trans. Algorithms
20 (1) (2024)
Parinya Chalermsook
,
Matthias Kaul
,
Matthias Mnich
,
Joachim Spoerhase
,
Sumedha Uniyal
,
Daniel Vaz
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.
ACM Trans. Algorithms
20 (1) (2024)
Telikepalli Kavitha
Popular Matchings with One-Sided Bias.
ACM Trans. Algorithms
20 (1) (2024)
Ivona Bezáková
,
Andreas Galanis
,
Leslie Ann Goldberg
,
Daniel Stefankovic
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs.
ACM Trans. Algorithms
20 (1) (2024)
Fedor V. Fomin
,
Petr A. Golovach
,
Tuukka Korhonen
,
Daniel Lokshtanov
,
Giannos Stamoulis
Shortest Cycles with Monotone Submodular Costs.
ACM Trans. Algorithms
20 (1) (2024)
Thomas Bläsius
,
Philipp Fischbeck
On the External Validity of Average-case Analyses of Graph Algorithms.
ACM Trans. Algorithms
20 (1) (2024)
Shaohua Li
,
Marcin Pilipczuk
,
Manuel Sorge
-packings.
ACM Trans. Algorithms
20 (1) (2024)
Eden Pelleg
,
Stanislav Zivný
Additive Sparsification of CSPs.
ACM Trans. Algorithms
20 (1) (2024)
Massimo Cairo
,
Romeo Rizzi
,
Alexandru I. Tomescu
,
Elia C. Zirondelli
.
ACM Trans. Algorithms
20 (1) (2024)
Antonio Blanca
,
Sarah Cannon
,
Will Perkins
Fast and Perfect Sampling of Subgraphs and Polymer Systems.
ACM Trans. Algorithms
20 (1) (2024)
volume 19, number 1, 2023
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.
ACM Trans. Algorithms
19 (1) (2023)
Rahul Shah
,
Cheng Sheng
,
Sharma V. Thankachan
,
Jeffrey Vitter
Ranked Document Retrieval in External Memory.
ACM Trans. Algorithms
19 (1) (2023)
Nikhil Bansal
,
Marek Eliás
,
Grigorios Koumoutsos
,
Jesper Nederlof
-Server in Uniform Metrics.
ACM Trans. Algorithms
19 (1) (2023)
Amir Abboud
,
Fabrizio Grandoni
,
Virginia Vassilevska Williams
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter.
ACM Trans. Algorithms
19 (1) (2023)
Franziska Eberle
,
Nicole Megow
,
Kevin Schewior
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden.
ACM Trans. Algorithms
19 (1) (2023)
Sariel Har-Peled
,
Manor Mendel
,
Dániel Oláh
Reliable Spanners for Metric Spaces.
ACM Trans. Algorithms
19 (1) (2023)
Karl Bringmann
,
Vincent Cohen-Addad
,
Debarati Das
-Approximation for Longest Common Subsequence.
ACM Trans. Algorithms
19 (1) (2023)
Erez Kantor
,
Zvi Lotker
,
Merav Parter
,
David Peleg
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication.
ACM Trans. Algorithms
19 (1) (2023)
Lior Gishboliner
,
Yevgeny Levanzov
,
Asaf Shapira
,
Raphael Yuster
Counting Homomorphic Cycles in Degenerate Graphs.
ACM Trans. Algorithms
19 (1) (2023)
Maike Buchin
,
Anne Driemel
,
Dennis Rohde
)-Median Clustering for Polygonal Curves.
ACM Trans. Algorithms
19 (1) (2023)
volume 19, number 2, 2023
Claire Mathieu
,
Hang Zhou
A PTAS for Capacitated Vehicle Routing on Trees.
ACM Trans. Algorithms
19 (2) (2023)
Aditya Jayaprakash
,
Mohammad R. Salavatipour
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension.
ACM Trans. Algorithms
19 (2) (2023)
Arun Ganesh
,
Bruce M. Maggs
,
Debmalya Panigrahi
Robust Algorithms for TSP and Steiner Tree.
ACM Trans. Algorithms
19 (2) (2023)
Varun Kanade
,
Frederik Mallmann-Trenn
,
Thomas Sauerwald
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
ACM Trans. Algorithms
19 (2) (2023)
Kyle Fox
,
Debmalya Panigrahi
,
Fred Zhang
-Cut in Hypergraphs via Branching Contractions.
ACM Trans. Algorithms
19 (2) (2023)
Balázs F. Mezei
,
Marcin Wrochna
,
Stanislav Zivný
PTAS for Sparse General-valued CSPs.
ACM Trans. Algorithms
19 (2) (2023)
Akanksha Agrawal
,
Daniel Lokshtanov
,
Pranabendu Misra
,
Saket Saurabh
,
Meirav Zehavi
Polynomial Kernel for Interval Vertex Deletion.
ACM Trans. Algorithms
19 (2) (2023)
Arun Ganesh
,
Bruce M. Maggs
,
Debmalya Panigrahi
Universal Algorithms for Clustering Problems.
ACM Trans. Algorithms
19 (2) (2023)
Antonios Antoniadis
,
Christian Coester
,
Marek Eliás
,
Adam Polak
,
Bertrand Simon
Online Metric Algorithms with Untrusted Predictions.
ACM Trans. Algorithms
19 (2) (2023)
Carla Groenland
,
Gwenaël Joret
,
Wojciech Nadara
,
Bartosz Walczak
Approximating Pathwidth for Graphs of Small Treewidth.
ACM Trans. Algorithms
19 (2) (2023)
volume 19, number 3, 2023
Prosenjit Bose
,
Jean Cardinal
,
John Iacono
,
Grigorios Koumoutsos
,
Stefan Langerman
Competitive Online Search Trees on Trees.
ACM Trans. Algorithms
19 (3) (2023)
Marco Bressan
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs.
ACM Trans. Algorithms
19 (3) (2023)
Enoch Peserico
,
Michele Scquizzato
Matching on the Line Admits no o(√log n)-Competitive Algorithm.
ACM Trans. Algorithms
19 (3) (2023)
Stefan Walzer
Load Thresholds for Cuckoo Hashing with Overlapping Blocks.
ACM Trans. Algorithms
19 (3) (2023)
Sébastien Bouchard
,
Yoann Dieudonné
,
Arnaud Labourel
,
Andrzej Pelc
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.
ACM Trans. Algorithms
19 (3) (2023)
Petr A. Golovach
,
Giannos Stamoulis
,
Dimitrios M. Thilikos
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable.
ACM Trans. Algorithms
19 (3) (2023)
Rajesh Jayaram
,
David P. Woodruff
Towards Optimal Moment Estimation in Streaming and Distributed Models.
ACM Trans. Algorithms
19 (3) (2023)
Massimo Equi
,
Veli Mäkinen
,
Alexandru I. Tomescu
,
Roberto Grossi
On the Complexity of String Matching for Graphs.
ACM Trans. Algorithms
19 (3) (2023)
Kevin Buchin
,
Chenglin Fan
,
Maarten Löffler
,
Aleksandr Popov
,
Benjamin Raichel
,
Marcel Roeloffzen
Fréchet Distance for Uncertain Curves.
ACM Trans. Algorithms
19 (3) (2023)
Anders Aamand
,
Mikkel Abrahamsen
,
Peter M. R. Rasmussen
,
Thomas D. Ahle
Tiling with Squares and Packing Dominos in Polynomial Time.
ACM Trans. Algorithms
19 (3) (2023)
volume 19, number 4, 2023
Philip Bille
,
Inge Li Gørtz
,
Teresa Anna Steiner
String Indexing with Compressed Patterns.
ACM Trans. Algorithms
19 (4) (2023)
Surender Baswana
,
Koustav Bhanja
,
Abhyuday Pandey
)-cuts and Dual-edge Sensitivity Oracle.
ACM Trans. Algorithms
19 (4) (2023)
Yi-Jun Chang
,
Ran Duan
,
Shunhua Jiang
Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election.
ACM Trans. Algorithms
19 (4) (2023)
Arnold Filtser
,
Omrit Filtser
Static and Streaming Data Structures for Fréchet Distance Queries.
ACM Trans. Algorithms
19 (4) (2023)
Stavros Birmpilis
,
George Labahn
,
Arne Storjohann
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix.
ACM Trans. Algorithms
19 (4) (2023)
Jugal Garg
,
Pooja Kulkarni
,
Rucha Kulkarni
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings.
ACM Trans. Algorithms
19 (4) (2023)
Thomas Bläsius
,
Simon D. Fink
,
Ignaz Rutter
Synchronized Planarity with Applications to Constrained Planarity Problems.
ACM Trans. Algorithms
19 (4) (2023)
Manuel Lafond
.
ACM Trans. Algorithms
19 (4) (2023)
Argyrios Deligkas
,
Michail Fasoulakis
,
Evangelos Markakis
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games.
ACM Trans. Algorithms
19 (4) (2023)
volume 18, number 4, 2022
Gautam Kamath
,
Sepehr Assadi
,
Anne Driemel
,
Janardhan Kulkarni
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020.
ACM Trans. Algorithms
18 (4) (2022)