| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Computing simple-path convex hulls in hypergraphs
|
Malvestuto, Francesco M.
|
|
2011
|
111 |
5 |
p. 231-234
4 p.
|
artikel
|
| 2 |
Editorial Board
|
|
|
2011
|
111 |
5 |
p. IFC-
1 p.
|
artikel
|
| 3 |
Improved approximation algorithms for minimum AND-circuits problem via k-set cover
|
Morizumi, Hiroki
|
|
2011
|
111 |
5 |
p. 218-221
4 p.
|
artikel
|
| 4 |
On-line construction of parameterized suffix trees for large alphabets
|
Lee, Taehyung
|
|
2011
|
111 |
5 |
p. 201-207
7 p.
|
artikel
|
| 5 |
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
|
Chen, Xie-Bin
|
|
2011
|
111 |
5 |
p. 235-238
4 p.
|
artikel
|
| 6 |
Quasi-random rumor spreading: Reducing randomness can be costly
|
Doerr, Benjamin
|
|
2011
|
111 |
5 |
p. 227-230
4 p.
|
artikel
|
| 7 |
Smooth movement and Manhattan path based Random Waypoint mobility
|
Crescenzi, Pilu
|
|
2011
|
111 |
5 |
p. 239-246
8 p.
|
artikel
|
| 8 |
The game chromatic number and the game colouring number of classes of oriented cactuses
|
Andres, Stephan Dominique
|
|
2011
|
111 |
5 |
p. 222-226
5 p.
|
artikel
|
| 9 |
The size and depth of layered Boolean circuits
|
Gál, Anna
|
|
2011
|
111 |
5 |
p. 213-217
5 p.
|
artikel
|
| 10 |
Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type
|
Lin, Bertrand M.T.
|
|
2011
|
111 |
5 |
p. 208-212
5 p.
|
artikel
|
| 11 |
Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions
|
Gupta, Kishan Chand
|
|
2011
|
111 |
5 |
p. 247-249
3 p.
|
artikel
|
Tijdschrift beschrijving