1. Amiri, S.A., Kreutzer, S., Rabinovich, R.: DAG-width is PSPACE-complete. Theoret. Comput. Sci. 655, 78–89 (2016)
2. Amiri, S.A., Kaiser, L., Kreutzer, S., Rabinovich, R., Siebertz, S.: Graph searching games and width measures for directed graphs. In: 32nd International Symposium on Theoretical Aspects of Computer Science (STACS), volume 30 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 34–47. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)
3. Springer Monographs in Mathematics,2018
4. Lecture Notes in Computer Science;D Berwanger,2006
5. Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S., Obdrzálek, J.: The DAG-width of directed graphs. J. Comb. Theory Ser. B 102(4), 900–923 (2012)