Computing the bump number is easy Michel HabibRolf H. MöhringGeorge Steiner OriginalPaper Pages: 107 - 129
Computing the bump number with techniques from two-processor scheduling Alejandro A. SchäfferBarbara B. Simons OriginalPaper Pages: 131 - 141
Lexicographic matchings cannot form Hamiltonian cycles Dwight DuffusBill SandsRobert Woodrow OriginalPaper Pages: 149 - 161
Explicit matchings in the middle levels of the Boolean lattice H. A. KiersteadW. T. Trotter OriginalPaper Pages: 163 - 171