Scanwidth is a recently-developed measure on directed acyclic graphs, similar in spirit to treewidth but adapted for phylogenetic networks. In this talk I'll describe this measure and talk about some recent algorithmic results for networks of bounded scanwidth, including a fixed-parameter tractability result for the tree containment problem.