nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
|
Tian, Ji |
|
2011 |
111 |
21-22 |
p. 1048-1053 6 p. |
artikel |
2 |
A note on relaxed equitable coloring of graphs
|
Fan, Hao |
|
2011 |
111 |
21-22 |
p. 1062-1066 5 p. |
artikel |
3 |
A shortest cycle for each vertex of a graph
|
Yuster, Raphael |
|
2011 |
111 |
21-22 |
p. 1057-1061 5 p. |
artikel |
4 |
A simple division-free algorithm for computing determinants
|
Bird, Richard S. |
|
2011 |
111 |
21-22 |
p. 1072-1074 3 p. |
artikel |
5 |
Computing minimum diameter color-spanning sets is hard
|
Fleischer, Rudolf |
|
2011 |
111 |
21-22 |
p. 1054-1056 3 p. |
artikel |
6 |
Conditional fault tolerance of arrangement graphs
|
Zhou, Shuming |
|
2011 |
111 |
21-22 |
p. 1037-1043 7 p. |
artikel |
7 |
Covering and packing in linear space
|
Björklund, Andreas |
|
2011 |
111 |
21-22 |
p. 1033-1036 4 p. |
artikel |
8 |
Editorial Board
|
|
|
2011 |
111 |
21-22 |
p. IFC- 1 p. |
artikel |
9 |
Faster algorithm for optimum Steiner trees
|
Vygen, Jens |
|
2011 |
111 |
21-22 |
p. 1075-1079 5 p. |
artikel |
10 |
Multiplexer implementation of low-complexity polynomial basis multiplier in GF ( 2 m ) using all one polynomial
|
Chiou, Che Wun |
|
2011 |
111 |
21-22 |
p. 1044-1047 4 p. |
artikel |
11 |
Two-dimensional homing sort
|
Wang, Bo-Yi |
|
2011 |
111 |
21-22 |
p. 1067-1071 5 p. |
artikel |