- Talya Eden, Reut Levi, Dana Ron:
Testing Bounded Arboricity. ACM Trans. Algorithms 16(2): 18:1-18:22 (2020) - Eduard Eiben, Iyad Kanj:
A Colored Path Problem and Its Applications. ACM Trans. Algorithms 16(4): 47:1-47:48 (2020) - Friedrich Eisenbrand, Robert Weismantel:
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Trans. Algorithms 16(1): 5:1-5:14 (2020) - Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms 16(4): 50:1-50:53 (2020) - Manuela Fischer, Andreas Noever:
Tight Analysis of Parallel Randomized Greedy MIS. ACM Trans. Algorithms 16(1): 6:1-6:13 (2020) - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Trans. Algorithms 16(1): 12:1-12:39 (2020) - Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Trans. Algorithms 16(2): 21:1-21:37 (2020) - Waldo Gálvez, José A. Soto, José Verschae:
Symmetry Exploitation for Online Machine Covering with Bounded Migration. ACM Trans. Algorithms 16(4): 43:1-43:22 (2020) - Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Trans. Algorithms 16(2): 16:1-16:24 (2020) - Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16(3): 34:1-34:31 (2020) - Chloe Ching-Yun Hsu, Chris Umans:
A New Algorithm for Fast Generalized DFTs. ACM Trans. Algorithms 16(1): 4:1-4:20 (2020) - Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. ACM Trans. Algorithms 16(3): 28:1-28:30 (2020) - Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear-Time Algorithm for Seeds Computation. ACM Trans. Algorithms 16(2): 27:1-27:23 (2020) - Yin Tat Lee, Marcin Pilipczuk, David P. Woodruff:
Introduction to the Special Issue on SODA'18. ACM Trans. Algorithms 16(1): 1:1-1:2 (2020) - Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-arrival Model. ACM Trans. Algorithms 16(4): 49:1-49:31 (2020) - Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16(3): 32:1-32:31 (2020) - Rodrigo S. V. Martins, Daniel Panario, Claudio M. Qureshi, Eric Schmutz:
Periods of Iterations of Functions with Restricted Preimage Sizes. ACM Trans. Algorithms 16(3): 30:1-30:28 (2020) - Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. ACM Trans. Algorithms 16(2): 26:1-26:19 (2020) - Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. ACM Trans. Algorithms 16(1): 13:1-13:27 (2020) - Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. ACM Trans. Algorithms 16(3): 40:1-40:28 (2020) - Joe Sawada, Aaron Williams:
Solving the Sigma-Tau Problem. ACM Trans. Algorithms 16(1): 11:1-11:17 (2020) - Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. ACM Trans. Algorithms 16(3): 41:1-41:24 (2020) - Saleh Soltan, Mihalis Yannakakis, Gil Zussman:
Doubly Balanced Connected Graph Partitioning. ACM Trans. Algorithms 16(2): 20:1-20:24 (2020) - Clifford Stein, Mingxian Zhong:
Scheduling When You Do Not Know the Number of Machines. ACM Trans. Algorithms 16(1): 9:1-9:20 (2020)