Runlength-limited (d,k) constraints and codes are widely used in digital data recording and transmission applications. Generalizations of runlength constraints to two dimension are of potential interest in page-oriented information storage systems. However, in contrast to the one-dimensional case, little is known about the information-theoretic properties of two-dimensional constraints or the design of practical, efficient codes for them. In this paper, we consider coding schemes that map unconstrained binary sequences into two- dimensional, runlength-limited (d, (infinity) ) constrained binary arrays, in which 1's are followed by at least d 0's in both the horizontal and vertical dimensions. We review the derivation of a lower bound on the capacity of two-dimensional (d, (infinity) ) constraints, for d greater than or equal to 1, obtained by bounding the average information rate of a variable-to-fixed rate encoding scheme, based upon a 'bit- stuffing' technique. For the special case of the two- dimensional (1, (infinity) ) constraint, upper and lower bounds on the capacity that are very close to being tight are known. For this constraint, we determine the exact average information rate of the bit-stuffing encoder, which turns out to be within 1% of the capacity of the constraint. We then present a fixed- rate, row-by-row encoding scheme for the two-dimensional (1, (infinity) ) constraint, somewhat akin to permutation coding, in which the rows of the code arrays represent 'typical' rows for the constraint. It is shown that, for sufficiently long rows, the rate of this encoding technique can almost achieve that of the variable-rate, bit-stuffing scheme.