DAG-width is PSPACE-complete

In the second part we use our construction to prove that deciding whether the DAG-width of a given graph is at most a given value is PSpace-complete.