  Treewidth is arguably the most important structural graph parameter leading
to algorithmically beneficial graph decompositions. Triggered by a strongly
growing interest in temporal networks (graphs where edge sets change over
time), we discuss fresh algorithmic views on temporal tree decompositions and
temporal treewidth. We review and explain some of the recent work together with
some encountered pitfalls, and we point out challenges for future research.
