![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/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
![](https://dblp.uni-trier.de/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.