Levit, Vadim E.; Mandrescu, Eugen On well-covered trees with unimodal independence polynomials. (English) Zbl 1032.05032 Congr. Numerantium 159, 193-202 (2002). MSC: 05C05 05C69 PDFBibTeX XMLCite \textit{V. E. Levit} and \textit{E. Mandrescu}, Congr. Numerantium 159, 193--202 (2002; Zbl 1032.05032)
Wilf, Herbert S. Algorithms and complexity. 2nd ed. (English) Zbl 1008.68057 Natick, MA: A K Peters. ix, 219 p. (2002). MSC: 68Q25 68-02 68W99 15-04 05-04 11-04 94A60 PDFBibTeX XMLCite \textit{H. S. Wilf}, Algorithms and complexity. 2nd ed. Natick, MA: A K Peters (2002; Zbl 1008.68057)
Östergård, Patric R. J. A fast algorithm for the maximum clique problem. (English) Zbl 1019.05054 Discrete Appl. Math. 120, No. 1-3, 197-207 (2002). MSC: 05C85 90C27 90C57 PDFBibTeX XMLCite \textit{P. R. J. Östergård}, Discrete Appl. Math. 120, No. 1--3, 197--207 (2002; Zbl 1019.05054) Full Text: DOI
Cheng, Eddie; de Vries, Sven Antiweb-wheel inequalities and their separation problems over the stable set polytopes. (English) Zbl 1154.90604 Math. Program. 92, No. 1 (A), 153-175 (2002). Reviewer: Fedor Fomin (Bergen) MSC: 90C35 90C57 05C69 05C85 PDFBibTeX XMLCite \textit{E. Cheng} and \textit{S. de Vries}, Math. Program. 92, No. 1 (A), 153--175 (2002; Zbl 1154.90604) Full Text: DOI