Volume 102, Number 1, April 2007
, Y. P. Luo
, S. Y. Yang
: Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm.
, Dar-Li Yang
: Single machine scheduling with past-sequence-dependent setup times and learning effects.
Yung H. Tsin
: An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity.
, Hao-Yun Yin
: Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences.
Volume 102, Numbers 2-3, April 2007
, T. C. Edwin Cheng
: An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan.
: A note on the characterization of TL[EF].
: Sweeping simple polygons with the minimum number of chain guards.
Benjamin Van Roy
: A short proof of optimality for the MIN cache replacement algorithm.
: On the context-freeness of the set of words containing overlaps.
: The 4-choosability of toroidal graphs without intersecting triangles.
Volume 102, Number 4, May 2007
: A note on secret sharing schemes with three homogeneous access structure.
: Fast and simple algorithms to count the number of vertex covers in an interval graph.
: The game chromatic number and the game colouring number of cactuses.
: Multidimensional heaps and complementary range searching.
: An in-place algorithm for Klee's measure problem in two dimensions.
Volume 102, Number 5, May 2007
Wim H. Hesselink
: A linear-time algorithm for Euclidean feature transform sets.
: Robust parametric reachability for timed automata.
: Minimum cycle bases of direct products of complete graphs.
Volume 102, Number 6, June 2007