46 citations · 217 across the 25 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020
Constructing Tree Decompositions of Graphs with Bounded Gonality
Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt +1
In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a…
cs.DM2018★ 2 cited
Parallel Machine Scheduling with a Single Resource per Job
T. Janssen, C. Swennenhuis, A. Bitar +5
We study the problem of scheduling jobs on parallel machines minimizing the total completion time, with each job using exactly one resource. First, we derive fundamental properties…