電気通信大学 

次の論文は  " Theoretical Computer Science Top Cited Article 2005-2010 " (最高被引用論文賞) を受賞,   TCS Top Cited Article 2006 (in TCS Top Cited Articles 1975-2014)
・Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, " The worst-case time complexity for generating all maximal cliques and computational experiments,"  Theoretical Computer Science, vol. 363, Issue 1, pp.28-42 (2006)     [PDF]sciencedirect.com     Google Scholar
  ( 先行版: LNCS 3106 (COCOON 2004) pp.161-170.   [PDF] nozdr.ru )

    本論文は，下記 特集号 記事などにおいても紹介された．
　・ 伊藤大雄, “クリーク列挙 - アルゴリズムと下限 - ,”  電子情報通信学会誌, vol.95, pp.484-489 (小特集 「広がる列挙の技術 - 列挙による問題解決アプローチ - 」 ) (2012年6月号)  [HTML]cinii.ac.jp
　・ 宇野毅明, “高速クリーク・密部分グラフマイニングアルゴリズム,”  人工知能学会誌, vol.27, pp.246-251 (特集：「離散構造処理系 - 知能情報処理を支えるアルゴリズムの技法」) (2012年5月号)    [PDF]nii.ac.jp
　・ Etsuji Tomita, " Efficient algorithms for finding maximum and maximal cliques and their applications "　 　 招待基調講演 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, pp.313-317 (2016)   [HTML]springer.com
　・ Etsuji Tomita, "Efficient algorithms for finding maximum and maximal cliques,"   招待講演，International Spring School on Algorithms and Applications (ISSAA 2015)，　 BUET, Dhaka (2015)
　 ・ 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). 　 (2014年,　累積 10,000回以上ダウンロード.)

• 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)     は　LNCS9711 (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)     は　LNCS5942 (WALCOM 2010)　において 最高被引用^*.     [PDF] researchgate.net     Google Scholar
( 拡張版: IEICE Trans. Inf. Syst.E96-D, no.6, 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)     は　JOGO,Vol.44,Issue 1 において 最高被引用^*.     [PDF] springer.com
    Google Scholar
• 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)     は　LNCS2731 (DMTCS 2003)　において 最高被引用^*.     [PDF] semanticscholar.org     Google Scholar
                                                                                          * Bookmetrix　による．