nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A correspondence between type checking via reduction and type checking via evaluation
|
Sergey, Ilya |
|
2012 |
112 |
1-2 |
p. 13-20 8 p. |
artikel |
2 |
An FPT algorithm for edge subset feedback edge set
|
Xiao, Mingyu |
|
2012 |
112 |
1-2 |
p. 5-9 5 p. |
artikel |
3 |
A note on “An optimal online algorithm for single machine scheduling to minimize total general completion time”
|
Yu, Sheng |
|
2012 |
112 |
1-2 |
p. 55-58 4 p. |
artikel |
4 |
A note on labeling schemes for graph connectivity
|
Izsak, Rani |
|
2012 |
112 |
1-2 |
p. 39-43 5 p. |
artikel |
5 |
A note on the Kenyon–Remila strip-packing algorithm
|
Sviridenko, Maxim |
|
2012 |
112 |
1-2 |
p. 10-12 3 p. |
artikel |
6 |
Center-based clustering under perturbation stability
|
Awasthi, Pranjal |
|
2012 |
112 |
1-2 |
p. 49-54 6 p. |
artikel |
7 |
Coloring chip configurations on graphs and digraphs
|
Borowiecki, Mieczysław |
|
2012 |
112 |
1-2 |
p. 1-4 4 p. |
artikel |
8 |
Editorial Board
|
|
|
2012 |
112 |
1-2 |
p. IFC- 1 p. |
artikel |
9 |
Havel–Hakimi residues of unigraphs
|
Barrus, Michael D. |
|
2012 |
112 |
1-2 |
p. 44-48 5 p. |
artikel |
10 |
Max-optimal and sum-optimal labelings of graphs
|
Jamison, Robert E. |
|
2012 |
112 |
1-2 |
p. 26-31 6 p. |
artikel |
11 |
Memory-restricted black-box complexity of OneMax
|
Doerr, Benjamin |
|
2012 |
112 |
1-2 |
p. 32-34 3 p. |
artikel |
12 |
Online call control in cellular networks revisited
|
Zhang, Yong |
|
2012 |
112 |
1-2 |
p. 21-25 5 p. |
artikel |
13 |
Singleton and 2-periodic attractors of sign-definite Boolean networks
|
Akutsu, Tatsuya |
|
2012 |
112 |
1-2 |
p. 35-38 4 p. |
artikel |