Theoretical Computer Science Top Cited Article 2005-2010,
TCS Top Cited Article 2006 (in TCS Top Cited Articles 1975-2014)
for the paper:
Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, "
The worst-case time complexity for generating all maximal cliques and computational experiments , "
Theoretical Computer Science, vol. 363, pp.28-42 (2006)
(An invited paper for the special issue on COCOON 2004.)
This paper is surveyed in detail in the following articles et al.:
Etsuji Tomita, "Clique Enumeration," in Ming-Yang Kao (Ed.), "Encyclopedia of Algorithms, 2nd Edition," Springer (2016)
Etsuji Tomita, "Efficient algorithms for finding maximum and maximal cliques,"   Invited Talk at International Spring School on Algorithms and Applications (ISSAA 2015) (A WALCOM Pre-Workshop School), BUET, Dhaka (2015)
Hiro Ito " Clique enumerations: Algorithms and lower bound , " Special issue in the Journal of IEICE, vol.95, pp.484-489 (In Japanese) (2012)
Takeaki Uno " High speed clique/dense subgraph mining algorithms, " Special issue in the Journal of JSAI, vol.27, pp.246-251 (In Japanese) (2012)
Etsuji Tomita, Tatsuya Akutsu, Tsutomu Matsunaga,
" Efficient algorithms for finding maximum and maximal cliques: Effective tools for bioinformatics "
in "Biomedical Engineering, Trends in Electronics, Communications and Software," A. N. Laskovski (Ed.),
ISBN: 978-953-307-475-7, InTech, pp.625-640 (2011).
( Downloaded over 10,000 times. )