1 citations · 1 across the 1 of their papers we have counts for
1 paper
Raphael Steiner, Sebastian Wiederrecht
Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DA…