23 citations · 60 across the 50 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 2 cited
A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
Raul Lopes, Ignasi Sau
In the Directed Disjoint Paths problem, we are given a digraph and a set of requests , and the task is to find a collection of pairwise vert…
cs.DS2019
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a fixed finite collection of graphs , the -M-DELETION problem asks, given an -vertex input graph for the minimum number of vertices that intersect a…
cs.DS2019
Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
Guilherme C. M. Gomes, Ignasi Sau
A matching cut is a partition of the vertex set of a graph into two sets and such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT p…