| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximation algorithm for uniform bounded facility location problem
|
Kerui, Weng
|
|
2012
|
26 |
2 |
p. 284-291
|
artikel
|
| 2 |
A tight analysis of Brown-Baker-Katseff sequences for online strip packing
|
Kern, W.
|
|
2012
|
26 |
2 |
p. 333-344
|
artikel
|
| 3 |
Erratum to: Tight bound for matching
|
Han, Yijie
|
|
2013
|
26 |
2 |
p. 412-414
|
artikel
|
| 4 |
L(2,1)-labelings of the edge-path-replacement of a graph
|
Damei, Lü
|
|
2012
|
26 |
2 |
p. 385-392
|
artikel
|
| 5 |
Objective functions with redundant domains
|
Affif Chaouche, Fatima
|
|
2012
|
26 |
2 |
p. 372-384
|
artikel
|
| 6 |
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
|
Birks, Martin
|
|
2012
|
26 |
2 |
p. 237-250
|
artikel
|
| 7 |
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
|
Zhang, Yong
|
|
2012
|
26 |
2 |
p. 223-236
|
artikel
|
| 8 |
On some geometric problems of color-spanning sets
|
Ju, Wenqi
|
|
2012
|
26 |
2 |
p. 266-283
|
artikel
|
| 9 |
Optimal job insertion in the no-wait job shop
|
Bürgy, Reinhard
|
|
2012
|
26 |
2 |
p. 345-371
|
artikel
|
| 10 |
Super-cyclically edge-connected regular graphs
|
Zhou, Jin-Xin
|
|
2012
|
26 |
2 |
p. 393-411
|
artikel
|
| 11 |
The k-Canadian Travelers Problem with communication
|
Zhang, Huili
|
|
2012
|
26 |
2 |
p. 251-265
|
artikel
|
| 12 |
The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
|
Brandenburg, Franz J.
|
|
2012
|
26 |
2 |
p. 310-332
|
artikel
|
| 13 |
Tight approximation bounds for combinatorial frugal coverage algorithms
|
Caragiannis, Ioannis
|
|
2012
|
26 |
2 |
p. 292-309
|
artikel
|
Tijdschrift beschrijving