- Online First™
Models for the single-vehicle preemptive pickup and delivery problem
H. L. M. Kerivin, M. Lacroix and A. R. Mahjoub
Online First™, 28 August 2010
- Online First™
An optimal online algorithm for single machine scheduling to minimize total general completion time
Ming Liu, Chengbin Chu, Yinfeng Xu and Jiazhen Huo
Online First™, 17 August 2010
- Online First™
The max quasi-independent set problem
N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis and V. T. Paschos, et al.
Online First™, 14 August 2010
- Online First™
Packing cycles exactly in polynomial time
Qin Chen and Xujin Chen
Online First™, 14 August 2010
- Online First™
On the construction of k-connected m-dominating sets in wireless networks
Yingshu Li, Yiwei Wu, Chunyu Ai and Raheem Beyah
Online First™, 11 August 2010
- Online First™
Improving an upper bound on the size of k-regular induced subgraphs
Carlos J. Luz
Online First™, 7 August 2010
- Online First™
On backbone coloring of graphs
Weifan Wang, Yuehua Bu, Mickaël Montassier and André Raspaud
Online First™, 4 August 2010
- Online First™
Optimal algorithms for online time series search and one-way trading with interrelated prices
Wenming Zhang, Yinfeng Xu, Feifeng Zheng and Yucheng Dong
Online First™, 3 August 2010
- Online First™
Combinatorial algorithms for the maximum k-plex problem
Benjamin McClosky and Illya V. Hicks
Online First™, 3 August 2010
- Online First™
A new approach to solve open-partition problems
Huilan Chang, Frank K. Hwang and Uriel G. Rothblum
Online First™, 3 August 2010