| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A compact data structure for representing a dynamic multiset
|
Katajainen, Jyrki
|
|
2010
|
110 |
23 |
p. 1061-1066
6 p.
|
artikel
|
| 2 |
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
|
Beyersdorff, Olaf
|
|
2010
|
110 |
23 |
p. 1074-1077
4 p.
|
artikel
|
| 3 |
Conditional connectivity of Cayley graphs generated by transposition trees
|
Yang, Weihua
|
|
2010
|
110 |
23 |
p. 1027-1030
4 p.
|
artikel
|
| 4 |
Dynamic bin packing with unit fraction items revisited
|
Han, Xin
|
|
2010
|
110 |
23 |
p. 1049-1054
6 p.
|
artikel
|
| 5 |
Editorial Board
|
|
|
2010
|
110 |
23 |
p. IFC-
1 p.
|
artikel
|
| 6 |
Highly-fair bakery algorithm using symmetric tokens
|
Aravind, Alex A.
|
|
2010
|
110 |
23 |
p. 1055-1060
6 p.
|
artikel
|
| 7 |
Locally connected spanning trees in cographs, complements of bipartite graphs and doubly chordal graphs
|
Panda, B.S.
|
|
2010
|
110 |
23 |
p. 1067-1073
7 p.
|
artikel
|
| 8 |
Locating a tree in a phylogenetic network
|
van Iersel, Leo
|
|
2010
|
110 |
23 |
p. 1037-1043
7 p.
|
artikel
|
| 9 |
Non-contractible non-edges in 2-connected graphs
|
Das, Anita
|
|
2010
|
110 |
23 |
p. 1044-1048
5 p.
|
artikel
|
| 10 |
On spectral windows in supervised learning from data
|
Gnecco, Giorgio
|
|
2010
|
110 |
23 |
p. 1031-1036
6 p.
|
artikel
|
Tijdschrift beschrijving