Volume 123, February 2022
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems.

Priyanka Mukhopadhyay

Coloring temporal graphs.

Andrea Marino Ana Silva

Improved distance sensitivity oracles with subcubic preprocessing time.

Hanlin Ren

Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface.

Silvia Bonomi Giuseppe Antonio Di Luna Othon Michail Leonardo Querzoni

Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents.

Hanrui Zhang

Word equations in non-deterministic linear space.

Artur Jez

Complexity of stability.

Fabian Frei Edith Hemaspaandra Jörg Rothe

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration.

Petr A. Golovach Christian Komusiewicz Dieter Kratsch Van Bang Le

A 4 + ϵ approximation for k-connected subgraphs.

Zeev Nutov

Polynomial anonymous dynamic distributed computing without a unique leader.

Dariusz R. Kowalski Miguel A. Mosteiro

An improved algorithm for the Steiner tree problem with bounded edge-length.

Chi-Yeh Chen Sun-Yuan Hsieh

Frameworks for designing in-place graph algorithms.

Sankardeep Chakraborty Anish Mukherjee Venkatesh Raman Srinivasa Rao Satti