55 citations · 136 across the 10 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.CC2014★ 4 cited
Scheduling with two non-unit task lengths is NP-complete
Jan Elffers, Mathijs de Weerdt
The non-preemptive job scheduling problem with release times and deadlines on a single machine is fundamental to many scheduling problems. We parameterize this problem by the set o…
cs.DS2014★ 55 cited
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
Léon R. Planken, Mathijs M. de Weerdt, Roman P. J. van der Krogt
We present two new and efficient algorithms for computing all-pairs shortest paths. The algorithms operate on directed graphs with real (possibly negative) weights. They make use o…