restricting the graph constraints to special sets of digraphs. We discuss directed co-graphs, minimal series-parallel digraphs …

}$$\end{document}-hard on series-parallel digraphs by providing a reduction from Partition. If in addition the number of scenarios is constant …, we propose a pseudo-polynomial algorithm based on dynamic programming. Finally, we present a special case on series-parallel … digraphs for which we can solve the RobMCF≡\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage …

. We show that both problems are NP-hard even on oriented co-graphs and minimal series-parallel digraphs. Further, we … provide pseudo-polynomial solutions for SSG and SSGW with digraph constraints given by directed co-graphs and series-parallel … digraphs. …