no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
|
Woeginger, Gerhard J. |
|
2009 |
109 |
7 |
p. 341-342 2 p. |
article |
2 |
A new 3-CNF transformation by parallel-serial graphs
|
Bubeck, Uwe |
|
2009 |
109 |
7 |
p. 376-379 4 p. |
article |
3 |
Approximating maximum weight K-colorable subgraphs in chordal graphs
|
Chakaravarthy, Venkatesan T. |
|
2009 |
109 |
7 |
p. 365-368 4 p. |
article |
4 |
A randomized approximation algorithm for computing bucket orders
|
Ukkonen, Antti |
|
2009 |
109 |
7 |
p. 356-359 4 p. |
article |
5 |
Edge-choosability of planar graphs without non-induced 5-cycles
|
Cai, Jiansheng |
|
2009 |
109 |
7 |
p. 343-346 4 p. |
article |
6 |
Editorial Board
|
|
|
2009 |
109 |
7 |
p. IFC- 1 p. |
article |
7 |
Fork sequential consistency is blocking
|
Cachin, Christian |
|
2009 |
109 |
7 |
p. 360-364 5 p. |
article |
8 |
Groupies in random graphs
|
de la Vega, W. Fernandez |
|
2009 |
109 |
7 |
p. 339-340 2 p. |
article |
9 |
Improved algorithms for the k simple shortest paths and the replacement paths problems
|
Gotthilf, Zvi |
|
2009 |
109 |
7 |
p. 352-355 4 p. |
article |
10 |
Preemptive stochastic online scheduling on two uniform machines
|
Gu, Manzhan |
|
2009 |
109 |
7 |
p. 369-375 7 p. |
article |
11 |
Success probability of the Hellman trade-off
|
Ma, Daegun |
|
2009 |
109 |
7 |
p. 347-351 5 p. |
article |