1. I. Adler. Directed tree-width examples. J. Combin. Theory Ser. B, 97(5):718–725, 2007.
2. B. Alspach. Searching and sweeping graphs: a brief survey. Matematiche (Catania), 59:5–37, 2006.
3. S. Amiri, L. Kaiser, S. Kreutzer, R. Rabinovich, and S. Siebertz. Graph searching games and width measures for directed graphs. In STACS 2015: 32nd International Symposium on Theoretical Aspects of Computer Science, volume 30 of LIPIcs, pages 34–47, 2015.
4. S. Amiri, K. Kawarabayashi, S. Kreutzer, and P. Wollan. The Erdős-Posa property for directed graphs. CoRR, arXiv:1603.02504 , 2016.
5. S. Arnborg, D. Corneil, and A. Proskurowski. Complexity of finding embeddings in a $$k$$-tree. SIAM J. Matrix Analysis Applications, 8(2):277–284, 1987.