1. Extended Skolem sequences;Baker;J. Combin. Des.,1995
2. m-fold and extended m-fold Skolem sequences;Baker;Utilitas Math.,1994
3. The complexity of completing partial latin squares;Colbourn;Discrete Appl. Math.,1984
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Optimization and approximation in deterministic sequencing and scheduling: A survey;Graham;Ann. Discrete Math.,1979