11 citations · 32 across the 21 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020
On the parameterized complexity of 2-partitions
Jonas Bamse Andersen, Jørgen Bang-Jensen, Anders Yeo
We give an FPT algorithm for deciding whether the vertex set a digraph can be partitioned into two disjoint sets such that the digraph induced by has a…
cs.CC2019
Safe sets in digraphs
Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita +1
A non-empty subset of the vertices of a digraph is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component of , there exists a…
cs.CC2019★ 1 cited
The directed 2-linkage problem with length constraints
Jørgen Bang-Jensen, Thomas Bellitto, William Lochet +1
The {\sc weak 2-linkage} problem for digraphs asks for a given digraph and vertices whether contains a pair of arc-disjoint paths such that is…