- Pratibha Choudhary. Polynomial Time Algorithms for Tracking Path Problems. Algorithmica, 84(6):1548-1570, 2022.
- Zeev Nutov. Approximating k-Connected m-Dominating Sets. Algorithmica, 84(6):1511-1525, 2022.
- Julian Dörfler, Marc Roth, Johannes Schmitt 0002, Philip Wellnitz. Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness. Algorithmica, 84(2):379-404, 2022.
- Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Michael Lampis, Hirotaka Ono, Yota Otachi. Parameterized Complexity of (A, ℓ )-Path Packing. Algorithmica, 84(4):871-895, 2022.
- Hao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane. Approximating Dynamic Weighted Vertex Cover with Soft Capacities. Algorithmica, 84(1):124-149, 2022.
- Paniz Abedin, Sahar Hooshmand, Arnab Ganguly 0002, Sharma V. Thankachan. The Heaviest Induced Ancestors Problem: Better Data Structures and Applications. Algorithmica, 84(7):2088-2105, 2022.
- Saket Saurabh 0001, Prafullkumar Tale. On the Parameterized Complexity of Maximum Degree Contraction Problem. Algorithmica, 84(2):405-435, 2022.
- Stéphane Devismes, David Ilcinkas, Colette Johnen. Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica, 84(1):85-123, 2022.
- Boris Klemz, Günter Rote. Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. Algorithmica, 84(4):1064-1080, 2022.
- Oleg Merkurev, Arseny M. Shur. Computing The Maximum Exponent in a Stream. Algorithmica, 84(3):742-756, 2022.