A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring. - Etsuji Tomita; Yoichi Sutani; Takanori Higashi (PDPTA, 2007)

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. - Etsuji Tomita; Yoichi Sutani; Takanori Higashi; Shinya Takahashi; Mitsuo Wakatsuki (WALCOM, 2010)

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments. - Etsuji Tomita; Yoichi Sutani; Takanori Higashi; Mitsuo Wakatsuki (IEICE Trans. Inf. Syst., 2013)