Login / Signup
ACM Trans. Algorithms
2005
2011
2017
2024
2005
2024
Keyphrases
Publications
volume 20, number 1, 2024
Shaohua Li
,
Marcin Pilipczuk
,
Manuel Sorge
-packings.
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)
Massimo Cairo
,
Romeo Rizzi
,
Alexandru I. Tomescu
,
Elia C. Zirondelli
.
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)
Antonio Blanca
,
Sarah Cannon
,
Will Perkins
Fast and Perfect Sampling of Subgraphs and Polymer Systems.
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)
Fedor V. Fomin
,
Petr A. Golovach
,
Tuukka Korhonen
,
Daniel Lokshtanov
,
Giannos Stamoulis
Shortest Cycles with Monotone Submodular Costs.
ACM Trans. Algorithms
20 (1) (2024)
Eden Pelleg
,
Stanislav Zivný
Additive Sparsification of CSPs.
ACM Trans. Algorithms
20 (1) (2024)
Lars Gottesbüren
,
Tobias Heuer
,
Nikolai Maas
,
Peter Sanders
,
Sebastian Schlag
Scalable High-Quality Hypergraph Partitioning.
ACM Trans. Algorithms
20 (1) (2024)
volume 20, number 2, 2024
Eun Jung Kim
,
Stefan Kratsch
,
Marcin Pilipczuk
,
Magnus Wahlström
Flow-augmentation II: Undirected Graphs.
ACM Trans. Algorithms
20 (2) (2024)
Niclas Boehmer
,
Tomohiro Koana
The Complexity of Finding Fair Many-to-One Matchings.
ACM Trans. Algorithms
20 (2) (2024)
Joachim Gudmundsson
,
Martin P. Seybold
,
Sampson Wong
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance.
ACM Trans. Algorithms
20 (2) (2024)
Fahad Panolan
,
Saket Saurabh
,
Meirav Zehavi
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity.
ACM Trans. Algorithms
20 (2) (2024)
Jannik Olbrich
,
Enno Ohlebusch
,
Thomas Büchler
Generic Non-recursive Suffix Array Construction.
ACM Trans. Algorithms
20 (2) (2024)
Manuel Cáceres
,
Massimo Cairo
,
Andreas Grigorjew
,
Shahbaz Khan
,
Brendan Mumey
,
Romeo Rizzi
,
Alexandru I. Tomescu
,
Lucia Williams
Width Helps and Hinders Splitting Flows.
ACM Trans. Algorithms
20 (2) (2024)
Jacob Focke
,
Dániel Marx
,
Pawel Rzazewski
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds.
ACM Trans. Algorithms
20 (2) (2024)
Arturo Merino
,
Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons.
ACM Trans. Algorithms
20 (2) (2024)
volume 20, number 3, 2024
Robert Ganian
,
Thekla Hamm
,
Viktoriia Korchemna
,
Karolina Okrasa
,
Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
ACM Trans. Algorithms
20 (3) (2024)
Sayan Bandyapadhyay
,
William Lochet
,
Daniel Lokshtanov
,
Saket Saurabh
,
Jie Xue
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs.
ACM Trans. Algorithms
20 (3) (2024)
Daniel Neuen
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs.
ACM Trans. Algorithms
20 (3) (2024)
Daniel Dadush
,
Martin Milanic
,
Tami Tamir
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue.
ACM Trans. Algorithms
20 (3) (2024)
Lorenzo Beretta
,
Jakub Tetek
Better Sum Estimation via Weighted Sampling.
ACM Trans. Algorithms
20 (3) (2024)
Timothy M. Chan
,
Da Wei Zheng
Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees.
ACM Trans. Algorithms
20 (3) (2024)
Kim-Manuel Klein
,
Janina Reuter
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs.
ACM Trans. Algorithms
20 (3) (2024)
Hung Le
,
Cuong Than
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators.
ACM Trans. Algorithms
20 (3) (2024)
Dvir Fried
,
Shay Golan
,
Tomasz Kociumaka
,
Tsvi Kopelowitz
,
Ely Porat
,
Tatiana Starikovskaya
-Dyck Edit Distance Problem.
ACM Trans. Algorithms
20 (3) (2024)
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)
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)
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)
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)
volume 19, number 4, 2023
Surender Baswana
,
Koustav Bhanja
,
Abhyuday Pandey
)-cuts and Dual-edge Sensitivity Oracle.
ACM Trans. Algorithms
19 (4) (2023)
Philip Bille
,
Inge Li Gørtz
,
Teresa Anna Steiner
String Indexing with Compressed Patterns.
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)
Jugal Garg
,
Pooja Kulkarni
,
Rucha Kulkarni
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings.
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)
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)