- Jason Li, Jesper Nederlof
:
Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time. ACM Trans. Algorithms 18(4): 34:1-34:26 (2022) - Dániel Marx, Michal Pilipczuk:
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams. ACM Trans. Algorithms 18(2): 13:1-13:64 (2022) - Avery Miller, Andrzej Pelc, Ram Narayan Yadav:
Deterministic Leader Election in Anonymous Radio Networks. ACM Trans. Algorithms 18(3): 25:1-25:33 (2022) - Daniel Neuen:
Hypergraph Isomorphism for Groups with Restricted Composition Factors. ACM Trans. Algorithms 18(3): 27:1-27:50 (2022) - Saladi Rahul, Yufei Tao:
Generic Techniques for Building Top-k Structures. ACM Trans. Algorithms 18(4): 38:1-38:23 (2022) - Ignasi Sau, Giannos Stamoulis, Dimitrios M. Thilikos:
k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms. ACM Trans. Algorithms 18(3): 21:1-21:30 (2022) - Magnus Wahlström:
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems. ACM Trans. Algorithms 18(2): 15:1-15:19 (2022) - Yipu Wang:
Max Flows in Planar Graphs with Vertex Capacities. ACM Trans. Algorithms 18(1): 9:1-9:27 (2022) - Ruosong Wang, David P. Woodruff:
Tight Bounds for ℓ1 Oblivious Subspace Embeddings. ACM Trans. Algorithms 18(1): 8:1-8:32 (2022) - Alexander Wei:
Optimal Las Vegas Approximate Near Neighbors in ℓp. ACM Trans. Algorithms 18(1): 7:1-7:27 (2022) - Sepehr Abbasi Zadeh, Nikhil Bansal, Guru Guruganesh, Aleksandar Nikolov, Roy Schwartz, Mohit Singh:
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems. ACM Trans. Algorithms 18(4): 33:1-33:50 (2022)
