Volume 131, Number 1, 6 September 2003
: The complexity of the locally connected spanning tree problem.
Gerhard J. Woeginger
: On the approximability of average completion time scheduling under precedence constraints.
Volume 131, Number 2, 12 September 200
, Satoru Iwata
: A push-relabel framework for submodular function minimization and applications to parametric optimization.
: Restricted t-matchings in bipartite graphs.
: On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks.
, Akihisa Tamura
: New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
: A note on the minimization of symmetric and general submodular functions.
Volume 131, Number 3, 28 September 2003
: Finding sharper distinctions for conditions of transitivity of the majority method.
: The maximum edge biclique problem is NP-complete.
Nicolai N. Pisaruk
: A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time.
: The commutative closure of a binary slip-language is context-free: a new proof.