5 citations · 15 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro +2
A knot in a directed graph is a strongly connected subgraph of with at least two vertices, such that no vertex in is an in-neighbor of a vertex in $V(G)\setminus…
cs.DS2019★ 1 cited
Approximation results for makespan minimization with budgeted uncertainty
Marin Bougeret, Klaus Jansen, Michael Poss +1
We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the model we consider, which…