| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Adversarial Model for Scheduling with Testing
|
Dürr, Christoph
|
|
|
82 |
12 |
p. 3630-3675
|
artikel
|
| 2 |
Dynamic and Internal Longest Common Substring
|
Amir, Amihood
|
|
|
82 |
12 |
p. 3707-3743
|
artikel
|
| 3 |
Enumerating k-Arc-Connected Orientations
|
Blind, Sarah
|
|
|
82 |
12 |
p. 3588-3603
|
artikel
|
| 4 |
Fault Tolerant Approximate BFS Structures with Additive Stretch
|
Parter, Merav
|
|
|
82 |
12 |
p. 3458-3491
|
artikel
|
| 5 |
Non-preemptive Scheduling in a Smart Grid Model and Its Implications on Machine Minimization
|
Liu, Fu-Hong
|
|
|
82 |
12 |
p. 3415-3457
|
artikel
|
| 6 |
On Scheduling Coflows
|
Ahmadi, Saba
|
|
|
82 |
12 |
p. 3604-3629
|
artikel
|
| 7 |
On the Benefits of Populations for the Exploitation Speed of Standard Steady-State Genetic Algorithms
|
Corus, Dogan
|
|
|
82 |
12 |
p. 3676-3706
|
artikel
|
| 8 |
Subgraph Isomorphism on Graph Classes that Exclude a Substructure
|
Bodlaender, Hans L.
|
|
|
82 |
12 |
p. 3566-3587
|
artikel
|
| 9 |
The Power of Linear-Time Data Reduction for Maximum Matching
|
Mertzios, George B.
|
|
|
82 |
12 |
p. 3521-3565
|
artikel
|
| 10 |
Using a Min-Cut Generalisation to Go Beyond Boolean Surjective VCSPs
|
Matl, Gregor
|
|
|
82 |
12 |
p. 3492-3520
|
artikel
|
Tijdschrift beschrijving