Editorial Board
Frameworks for designing in-place graph algorithms
An improved algorithm for the Steiner tree problem with bounded edge-length
A 4 + ϵ approximation for k-connected subgraphs
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Complexity of stability
Word equations in non-deterministic linear space
Coloring temporal graphs
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
Polynomial anonymous dynamic distributed computing without a unique leader
Special issue on Algorithmic Theory of Dynamic Networks and Its Applications – Preface
Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents
Improved distance sensitivity oracles with subcubic preprocessing time