![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
ACM Transactions on Algorithms, Volume 20
Volume 20, Number 1, January 2024
- Eden Pelleg
, Stanislav Zivný
:
Additive Sparsification of CSPs. 1:1-1:18 - Fedor V. Fomin
, Petr A. Golovach
, Tuukka Korhonen
, Daniel Lokshtanov
, Giannos Stamoulis
:
Shortest Cycles with Monotone Submodular Costs. 2:1-2:16 - Shaohua Li
, Marcin Pilipczuk
, Manuel Sorge
:
Cluster Editing Parameterized above Modification-disjoint P3-packings. 3:1-3:43 - Massimo Cairo
, Romeo Rizzi
, Alexandru I. Tomescu
, Elia C. Zirondelli
:
Genome Assembly, from Practice to Theory: Safe, Complete and Linear-Time. 4:1-4:26 - Antonio Blanca
, Sarah Cannon
, Will Perkins
:
Fast and Perfect Sampling of Subgraphs and Polymer Systems. 5:1-5:30 - Parinya Chalermsook
, Matthias Kaul
, Matthias Mnich
, Joachim Spoerhase
, Sumedha Uniyal
, Daniel Vaz
:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. 6:1-6:20 - Ivona Bezáková
, Andreas Galanis
, Leslie Ann Goldberg
, Daniel Stefankovic
:
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. 7:1-7:26 - Telikepalli Kavitha
:
Popular Matchings with One-Sided Bias. 8:1-8:22
- Lars Gottesbüren
, Tobias Heuer
, Nikolai Maas
, Peter Sanders
, Sebastian Schlag
:
Scalable High-Quality Hypergraph Partitioning. 9:1-9:54 - Thomas Bläsius
, Philipp Fischbeck
:
On the External Validity of Average-case Analyses of Graph Algorithms. 10:1-10:42
Volume 20, Number 2, April 2024
- Jacob Focke
, Dániel Marx
, Pawel Rzazewski
:
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds. 11 - Eun Jung Kim
, Stefan Kratsch
, Marcin Pilipczuk
, Magnus Wahlström
:
Flow-augmentation II: Undirected Graphs. 12 - Manuel Cáceres
, Massimo Cairo
, Andreas Grigorjew
, Shahbaz Khan
, Brendan Mumey
, Romeo Rizzi
, Alexandru I. Tomescu
, Lucia Williams
:
Width Helps and Hinders Splitting Flows. 13 - Joachim Gudmundsson
, Martin P. Seybold
, Sampson Wong
:
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance. 14 - Fahad Panolan, Saket Saurabh, Meirav Zehavi:
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity. 15 - Arturo Merino
, Andreas Wiese
:
On the Two-Dimensional Knapsack Problem for Convex Polygons. 16 - Niclas Boehmer
, Tomohiro Koana
:
The Complexity of Finding Fair Many-to-One Matchings. 17 - Jannik Olbrich
, Enno Ohlebusch
, Thomas Büchler
:
Generic Non-recursive Suffix Array Construction. 18
Volume 20, Number 3, July 2024
- Robert Ganian
, Thekla Hamm
, Viktoriia Korchemna
, Karolina Okrasa
, Kirill Simonov
:
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. 19 - Sayan Bandyapadhyay
, William Lochet
, Daniel Lokshtanov
, Saket Saurabh
, Jie Xue
:
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs. 20
- Daniel Dadush
, Martin Milanic
, Tami Tamir
:
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue. 21 - Kim-Manuel Klein
, Janina Reuter
:
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. 22 - Hung Le
, Cuong Than
:
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators. 23 - Timothy M. Chan
, Da Wei Zheng
:
Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees. 24 - Daniel Neuen
:
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. 25 - Dvir Fried
, Shay Golan
, Tomasz Kociumaka
, Tsvi Kopelowitz
, Ely Porat
, Tatiana Starikovskaya
:
An Improved Algorithm for The k-Dyck Edit Distance Problem. 26 - Lorenzo Beretta
, Jakub Tetek
:
Better Sum Estimation via Weighted Sampling. 27
![](https://dblp.org/img/cog.dark.24x24.png)
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.