On the complexity of drawing trees nicely: corrigendum

Abstract.In this journal, Supowit and Reingold [1] have given a proof that it is NP-complete to decide whether a binary tree can be drawn on a grid with width 24 if certain æsthetic requirements are obeyed. We identify and repair a mistake in their proof.