1. On a pattern sequencing problem to minimize the maximum number of open stacks;Yanasse;European Journal of Operational Research,1997
2. Algorithmic graph theory and perfect graphs.;Golumbic,1980
3. Fixed-parameter tractability and completeness. 1. Basic results;Downey;SIAM Journal on Computing,1995
4. Applications of modern heuristic search methods to pattern sequencing problems;Fink;Computers & Operations Research,1999
5. Kashiwabara T, Fujisawa T. NP-completeness of the problem of finding a minimum clique number interval graph containing a given graph as a subgraph. Proceedings of the 1979 IEEE International Symposium on Circuits and Systems, Tokyo, Japan, July 1979. p. 657–60.