| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
About the minimum mean cycle-canceling algorithm
|
Gauthier, Jean Bertrand
|
|
2015
|
196 |
C |
p. 115-134
20 p.
|
article
|
| 2 |
Advances in Combinatorial Optimization
|
Martello, Silvano
|
|
2015
|
196 |
C |
p. 1-3
3 p.
|
article
|
| 3 |
Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
|
Zinder, Y.
|
|
2015
|
196 |
C |
p. 28-53
26 p.
|
article
|
| 4 |
A study of scheduling problems with preemptions on multi-core computers with GPU accelerators
|
Błażewicz, Jacek
|
|
2015
|
196 |
C |
p. 72-82
11 p.
|
article
|
| 5 |
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
|
Gimadi, E.Kh.
|
|
2015
|
196 |
C |
p. 54-61
8 p.
|
article
|
| 6 |
Contents
|
|
|
2015
|
196 |
C |
p. v-
1 p.
|
article
|
| 7 |
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
|
Barketau, Maksim
|
|
2015
|
196 |
C |
p. 4-19
16 p.
|
article
|
| 8 |
New results on ptolemaic graphs
|
Markenzon, Lilian
|
|
2015
|
196 |
C |
p. 135-140
6 p.
|
article
|
| 9 |
On the max min vertex cover problem
|
Boria, Nicolas
|
|
2015
|
196 |
C |
p. 62-71
10 p.
|
article
|
| 10 |
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
|
Dürr, Christoph
|
|
2015
|
196 |
C |
p. 20-27
8 p.
|
article
|
| 11 |
Using dual feasible functions to construct fast lower bounds for routing and location problems
|
Porumbel, Daniel
|
|
2015
|
196 |
C |
p. 83-99
17 p.
|
article
|
| 12 |
Web services composition: Complexity and models
|
Gabrel, V.
|
|
2015
|
196 |
C |
p. 100-114
15 p.
|
article
|
Journal description