The paper “An O(m log n) algorithm for branching bisimilarity on labelled transition systems” by David Jansen, Jan Friso Groote, Jeroen Keiren and Anton Wijs has been accepted for presentation at TACAS, part of ETAPS 2020, in Dublin. An extended version including full proofs is available as technical report and on arXiv.