| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A new algorithm design technique for hard problems
|
Faragó, András
|
|
|
821 |
C |
p. 45-56
|
artikel
|
| 2 |
A search game on a hypergraph with booby traps
|
Lidbetter, Thomas
|
|
|
821 |
C |
p. 57-70
|
artikel
|
| 3 |
Asymptotic growth rate of square grids dominating sets: A symbolic dynamics approach
|
Gangloff, Silvère
|
|
|
821 |
C |
p. 87-101
|
artikel
|
| 4 |
Calibration scheduling with time slot cost
|
Wang, Kai
|
|
|
821 |
C |
p. 1-14
|
artikel
|
| 5 |
Characterization of interval graphs that are unpaired 2-disjoint path coverable
|
Park, Jung-Heum
|
|
|
821 |
C |
p. 71-86
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
821 |
C |
p. ii
|
artikel
|
| 7 |
Interaction-aware influence maximization and iterated sandwich method
|
Gao, Chuangen
|
|
|
821 |
C |
p. 23-33
|
artikel
|
| 8 |
List-coloring – Parameterizing from triviality
|
Arora, Pranav
|
|
|
821 |
C |
p. 102-110
|
artikel
|
| 9 |
Makespan minimization on unrelated parallel machines with a few bags
|
Page, Daniel R.
|
|
|
821 |
C |
p. 34-44
|
artikel
|
| 10 |
Offline and online algorithms for single-minded selling problem
|
Zhang, Yong
|
|
|
821 |
C |
p. 15-22
|
artikel
|
| 11 |
Skew circuits of small width
|
Balaji, Nikhil
|
|
|
821 |
C |
p. 111-123
|
artikel
|
Tijdschrift beschrijving