Anders Yeo

activity

20042021

most citedSimultaneously Satisfying Linear Equations Over

F_{2}

: MaxLin2 and Max-

r

-Lin2 Parameterized Above Average

15 citations · 56 across the 27 of their papers we have counts for

collaborators

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 $D$ can be partitioned into two disjoint sets $V_{1}, V_{2}$ such that the digraph $D [V_{1}]$ induced by $V_{1}$ has a…

cs.CC2019

Safe sets in digraphs

Yandong Bai, Jørgen Bang-Jensen, Shinya Fujita +1

A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component $M$ of $D - S$ , 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 $s_{1}, s_{2}, t_{1}, t_{2}$ whether $D$ contains a pair of arc-disjoint paths $P_{1}, P_{2}$ such that $P_{i}$ is…