| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network
|
Yanovski, Vladimir
|
|
2003
|
37 |
3 |
p. 165-186
|
article
|
| 2 |
A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network
|
Yanovski, Vladimir
|
|
|
37 |
3 |
p. 165-186
|
article
|
| 3 |
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees
|
Ayala-Rincón, Mauricio
|
|
2003
|
37 |
3 |
p. 233-241
|
article
|
| 4 |
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees
|
Ayala-Rincón, Mauricio
|
|
|
37 |
3 |
p. 233-241
|
article
|
| 5 |
Approximation Algorithms for Aligning Points
|
Cabello, Sergio
|
|
2003
|
37 |
3 |
p. 211-232
|
article
|
| 6 |
Approximation Algorithms for Aligning Points
|
Cabello, Sergio
|
|
|
37 |
3 |
p. 211-232
|
article
|
| 7 |
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
|
Chin, Francis Y. L.
|
|
2003
|
37 |
3 |
p. 149-164
|
article
|
| 8 |
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
|
Chin, Francis Y. L.
|
|
|
37 |
3 |
p. 149-164
|
article
|
| 9 |
Sum Coloring Interval and k-Claw Free Graphs with Application to SchedulingDependent Jobs
|
Halldórsson, Magnús M.
|
|
2003
|
37 |
3 |
p. 187-209
|
article
|
| 10 |
Sum Coloring Interval and k-Claw Free Graphs with Application to SchedulingDependent Jobs
|
Halldórsson, Magnús M.
|
|
|
37 |
3 |
p. 187-209
|
article
|
Journal description