Volume 108, Number 1, September 2008
Volume 108, Number 2, September 2008
: Approximation algorithms for restricted Bayesian network structures.
: Descriptional complexity of multi-parallel grammars.
: A note on cycle embedding in folded hypercubes with faulty elements.
Volume 108, Number 3, October 2008
, Jixiang Meng
: Super-connected and super-arc-connected Cartesian product of digraphs.
: A note on regular Petri nets.
: Managing module dependencies to facilitate continuous testing.
: Quick encoding of plane graphs in log214 bits per edge.
: Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring Z.
Volume 108, Number 4, October 2008
, T. C. Edwin Cheng
: An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan.
: A conceptual model for negotiating in service-oriented environments.
Stanley P. Y. Fung
: Lower bounds on online deadline scheduling with preemption penalties.
: On the Positive-Negative Partial Set Cover problem.
: Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees.
: Faster algorithms for guided tree edit distance.
Volume 108, Number 5, November 2008
: Fault-free cycles in folded hypercubes with more faulty elements.
: A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL.
: Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching.
: A note on the inapproximability of correlation clustering.
Volume 108, Number 6, November 2008
, Ye Du
: The computation of approximate competitive equilibrium is PPAD-hard.
: Approximating nearest neighbor among triangles in convex position.
Ariel D. Procaccia
: A note on the query complexity of the Condorcet winner problem.