Awarded
Theoretical Computer Science Top Cited Article 20052010,
TCS Top Cited Article 2006 (in TCS Top Cited Articles 19752014)
for the paper:
• Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, "
The worstcase time complexity for generating all maximal cliques and computational experiments , "
Theoretical Computer Science, vol. 363, Issue 1, pp.2842 (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, "Efficient algorithms for finding maximum and maximal cliques and their applications  Keynote 
" Invited Talk at WALCOM 2017, Hsinchu, Taiwan, Lecture Notes in Computer Science, 10167, pp.315 (2017)
• Etsuji Tomita, "Clique Enumeration," in MingYang 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)
BUET, Dhaka (2015)
• Hiro Ito " Clique enumerations: Algorithms and lower bound , " Special issue in the Journal of IEICE, vol.95, pp.484489 (In Japanese) (2012)
• Takeaki Uno " High speed clique/dense subgraph mining algorithms, " Special issue in the Journal of JSAI, vol.27, pp.246251 (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: 9789533074757, InTech, pp.625640 (2011). (
Downloaded over 10,000 times cumulatively by 2014.)
• Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki,
"A simple and faster branchandbound algorithm for finding a maximum clique,"
International Workshop on Algorithms and Computation (WALCOM 2010),
Lecture Notes in Computer Science, 5942, pp.191203 (2010)
is Top Cited in LNCS5942 (WALCOM2010).
• Etsuji Tomita, Toshikatsu Kameda,
"An efficient branchandbound algorithm for finding a maximum clique with computational experiments,"
Journal of Global Optimization, Vol. 37, Issue 1, pp.95111 (2007)
is Top Cited in JOGO,Vol.44,Issue 1.
• Etsuji Tomita, Tomokazu Seki,
"An efficient branchandbound algorithm for finding a maximum clique,"
Discrete Mathematics and Theoretical Computer Science (DMTCS 2003),
Lecture Notes in Computer Science, 2731, pp.278289 (2003)
is Top Cited in LNCS2731 (DMTCS2003).
JAPANESE
