We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...
Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is plac...
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...
In order to deal with the heavy trend in size increase of volumetric datasets, research in isosurface extraction has focused in the past few years on related aspects such as surfa...
Guilhem Dupuy, Bruno Jobard, Sebastien Guillon, No...