Volume 20, Number 1, 2006
: Avoiding Patterns in Matrices Via a Small Number of Changes.
: M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem.
Volume 20, Number 2, 2006
: A Dichotomy Theorem on Fixed Points of Several Nonexpansive Mappings.
Paul W. Goldberg
: A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment.
, Daniel K. Ford
: Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection.
: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph.
Volume 20, Number 3, 2006
: Shortest Paths in the Tower of Hanoi Graph and Finite Automata.
: A Combinatorial Interpretation of the Chebyshev Polynomials.
: The Channel Assignment Problem with Variable Weights.
Volume 20, Number 4, 2006
Manuel E. Lladser
: Uniform Formulae for Coefficients of Meromorphic Functions in Two Variables. Part I.
: 0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets.
: Factoring Finite Abelian Groups by Subsets with Maximal Span.
: On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings.
: Online Bin Packing with Cardinality Constraints.