Awarded 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)     [PDF]sciencedirect.com  
(Preceding version: LNCS 3106 (COCOON 2004) pp161-170. [PDF] nozdr.ru )

      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 - , "  WALCOM 2017, Hsinchu, Taiwan, Lecture Notes in Computer Science, 10167, pp.3-15 (2017)    [PDF] nii.ac.jp
• Etsuji Tomita, "Clique Enumeration," in Ming-Yang Kao (Ed.), "Encyclopedia of Algorithms, 2nd Edition," Springer (2016)   [HTML]springer.com
• 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, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki, " A much faster branch-and-bound algorithm for finding a maximum clique, " International Workshop on Frontiers in Algorithmics (FAW 2016), Lecture Notes in Computer Science, 9711, pp.215-226 (2016)     is Most Downloaded ^* in LNCS 9711 (FAW 2016).     [PDF] nii.ac.jp
• Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki, "A simple and faster branch-and-bound algorithm for finding a maximum clique," International Workshop on Algorithms and Computation (WALCOM 2010), Lecture Notes in Computer Science, 5942, pp.191-203 (2010)     is Top Cited^* in LNCS5942 (WALCOM 2010).     [PDF] researchgate.net
( Extended version: IEICE Trans. E96-D, pp.1286-1298 (2013)     [PDF] jst.go.jp )
• Etsuji Tomita, Toshikatsu Kameda, "An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments," Journal of Global Optimization, Vol. 37, Issue 1, pp.95-111 (2007)     is Top Cited^* in JOGO,Vol.44,Issue 1.     [PDF] springer.com
• Etsuji Tomita, Tomokazu Seki, "An efficient branch-and-bound algorithm for finding a maximum clique," Discrete Mathematics and Theoretical Computer Science (DMTCS 2003), Lecture Notes in Computer Science, 2731, pp.278-289 (2003)     is Top Cited^* in LNCS2731 (DMTCS 2003).     [PDF] semanticscholar.org
                                                                                * according to Bookmetrix．