Volume 74, Numbers 1-2, April 2000
: On bounded occurrence constraint satisfaction.
: A force-directed algorithm that preserves edge-crossing properties.
: Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order.
: The forall-exists2 fragment of the first-order theory of atomic set constraints is Pi01-hard.
Volume 74, Numbers 3-4, 31 May 2000
: Worst case examples for operations on OBDDs.
Harold N. Gabow
: Path-based depth-first search for strong and biconnected components.
Stavros D. Nikolopoulos
: Recognizing cographs and threshold graphs through a classification of their edges.
Markus Schneider II
: On distribution properties of sequences with perfect linear complexity profile.
Volume 74, Numbers 5-6, 30 June 2000
: A note on the spectral characterization of correlation immune Boolean functions.
: A note on the use of determinant for proving lower bounds on the size of linear circuits.
Jae Dong Yang
: A concept-based query evaluation with indefinite fuzzy triples.
: An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph.
: Addendum to "An O(|V|2) algorithm for single connectedness".