1. 主な著編訳書
2. 学会誌発表 主な記事
3. 最近の発表論文 等
4. その他 主な発表論文
5. Basic Technical Reports
6. 招待講演(2015年以降)


1. 主な著編訳書

  • Etsuji Tomita, " Clique Enumeration," in Ming-Yang Kao (Ed.), " Encyclopedia of Algorithms, 2nd Edition" Springer, pp.313-327 (2016)
  • Sohel Rahman, Etsuji Tomita (Eds.), "Special issue on WALCOM 2015," Journal of Discrete Algorithms, Elsevier (2016)
  • Sohel Rahman, Etsuji Tomita (Eds.), "Special issue on WALCOM 2015," Journal of Graph Algorithms and Applications (2016)
  • Sohel Rahman, Etsuji Tomita (Eds.), "WALCOM: Algorithms and Computation," The 9th International Workshop, WALCOM 2015, Lecture Notes in Computer Science, 8973, Springer (2015)
  • 富田悦次, 横森 貴, "オートマトン・言語理論 (第 2 版)" 森北出版株式会社　(2013)
  • 富田悦次, 横森 貴, "オートマトン・言語理論," 森北出版株式会社，第24刷　(2013)
  • 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). [PDF] intechopen.com    
  • 中森眞理雄, 富田悦次, " 数理モデルの応用技術," ｢情報処理学会50年のあゆみ｣， 第3編，情報処理学会, pp.227-229 (2010）
  • 富田悦次, "形式言語," 広中平祐　編 ｢第2版 現代数理科学辞典｣，pp.391-396，丸善 （2009）
  • Hans U. Simon, Etsuji Tomita (Eds.), "Algorithmic Learning Theory," Theoretical Computer Science, Vol.387, Elsevier (2007).
  • Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita (Eds.), " Grammaical Inference: Algorithms and Applications," The 8th International Colloquium on Grammatical Inference, ICGI 2006, Lecture Notes in Artificial Intelligence, 4201,Springer (2006). [PDF] tiera.ru
  • 曽和将容，岩田 彰，富田悦次(編),   "コンピュータサイエンス教科書シリーズ,"  コロナ社 (2006-)
  • Sanjay Jain, Hans. U. Simon, Etsuji Tomita (Eds.), "Algorithmic Learning Theory," The 16th International Conference on Algorithmic Learning Theory, ALT 2005, Lecture Notes in Artificial Intelligence, 3734, Springer (2005). [PDF] tiera.ru
  • 富田悦次(分担),   島内剛一,他編 ｢アルゴリズム辞典｣，共立出版 (1994)
  • 富田悦次(訳), "文脈自由言語," 廣瀬 健, 他 監訳 ｢コンピュータ基礎理論ハンドブック II，形式的モデルと意味論｣ (Jan van Leeuwen (Ed.) Handbook of Theoretical Computer Science, vol. B, FORMAL MODELS AND SEMANTICS)， pp.57-99，丸善 (1994)
  • Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori (Eds.), "Algorithmic Learning Theory," The 4th International Workshop, ALT '93, Lecture Notes in Computer Science, 744, Springer (1993).
  • 富田悦次(分担),   長尾 真,他編 ｢情報科学辞典｣，岩波書店 （1990）
  • 富田悦次, "形式言語" 電子情報通信学会 編 ｢電子情報通信ハンドブック｣，pp.372-376，オーム社 (1988)
  • 富田悦次，"オートマトンと言語理論,"　志村正道 編 ｢電気・電子工学大百科事典, 11 情報処理｣ 第2章(pp. 35-80), 電気書院　(1983)

2. 学会誌発表 主な記事

3. 最近の発表論文 等

  • Alessio Conte, Etsuji Tomita, " Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms, " WALCOM 2021, LNCS 12635, pp.195-207 (2021)
  • Kazuho Kanahara, Kengo Katayama, Nobuo Funabiki, Etsuji Tomita, " The Performance of a metaheuristic algorithm for finding a maximal weight clique in the fill-in-blank problem, " Proc. ICIET 2020, pp.257-261 (2020)
  • Etsuji Tomita, " Enumeration of maximum cliques and its application to coding theory, " Dagstuhl Seminar on Enumeration in Data Management, Report from Dagstuhl Seminar 19211, Dagstuhl, Germany, p. 100 (2019)   (joint work with Akira Mitsutake and Takayuki Nozaki)
  • 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)   [HTML] nii.ac.jp
  • Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki, " A much faster branch-and-bound algorithm for finding a maximum clique, " FAW 2016, Qingdao, China, Lecture Notes in Computer Science, 9711, pp.215-226 (2016)
  • Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, " A fast and complete algorithm for enumerating pseudo-cliques in large graphs , " International Journal of Data Science and Analytics, Springer, pp.145-158 (2016)
  • Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita, " Enumerating maximal isolated cliques based on vertex-dependent connection lower bound, " MLDM 2016, New York, USA, Lecture Notes in Artificial Intelligence, 9727, pp.569-583 (2016)
  • Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, " A fast and complete enumeration of pseudo-cliques for large graphs , " PAKDD 2016, Auckland, New Zealand, Lecture Notes in Artificial Intelligence, 9651, pp.423-435 (2016)
  • Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, " Enumerating maximal clique sets with pseudo-clique constraint, " DS 2015, Banff, Canada, Lecture Notes in Artificial Intelligence, 9356, pp.324-339 (2015)
  • Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino, "A polynomial-time algorithm for checking the equivalence for deterministic restricted one-counter transducers which accept by final state," Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing Studies in Computational Intelligence, vol. 569, pp 131-144, Springer (2015)
  • 中西裕陽，富田悦次，若月光夫， 西野哲朗, "最大クリーク問題の多項式時間的可解性の拡張の改良," 電子情報通信学会論文誌 D, vol.J97-D, no.6, pp.1106-1121 (2014)
  • Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita, "Relational change pattern mining based on modularity difference," MIWAI 2013, Krabi, Thailand, Lecture Notes in Artificial Intelligence, 8271, pp.187-198 (2013) ( The Second Best Paper in MIWAI 2013)
  • Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki, " A simple and faster branch-and-bound algorithm for finding a maximum clique with computational experiments," IEICE Trans. on Information and Systems, vol. E96-D, pp.1286-1298 (2013)    
  • Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino, "A polynomial-time algorithm for checking the equivalence for real-time deterministic restricted one-counter transducers which accept by final state," International Journal of Computer and Information Sciences, vol. 14, pp. 45-53 (2013) [PDF] lsfk.org
  • Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita, "Structural change pattern mining based on constrained maximal k-plex search," Discovery Science 2012, Lyon, France, Lecture Notes in Artificial Intelligence, 7569, pp.284-298 (2012)
  • Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, "Finding what changes for two graphs constructed from different time intervals," Proc. 2012 IIAI International Conference on Advanced Applied Informatics, pp.48-53, Fukuoka, Japan (2012)
  • 中西裕陽，富田悦次，若月光夫, 西野哲朗, "最大クリーク問題の多項式時間的可解性の拡張," 電子情報通信学会論文誌 D, vol.J95-D, no.9, pp. 1716-1728 (2012)     詳細証明の追記
  • Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu, " A clique-based method using dynamic programming for computing edit distance between unordered trees," Journal of Computational Biology, 19, pp.1089-1104 (2012). [HTML] nih.gov
  • 中西裕陽，富田悦次，若月光夫，西野哲朗, "最大クリーク問題の多項式時間的可解性の更なる改良結果," 電子情報通信学会論文誌 D, vol.J94-D, no.12, pp.2037-2046 (2011)     詳細証明の追記
  • Akinobu Miyata, Jun Tarui, Etsuji Tomita, "Learning Boolean functions in AC0 on attribute and classification noise - Estimating an upper bound on attribute and classification noise," Theoretical Computer Science, Volume 412, pp.4650-4660 (2011)
  • Tatsuya Akutsu, Tomoya Mori, Daiji Fukagawa, Atsuhiro Takasu, Takeyuki Tamura, Etsuji Tomita, " An improved clique-based method for the edit distance between unordered trees with application to similar glycan structures," The 4th International Workshop on Intelligent Informatics in Biology and Medicine (IIBM 2011), A Part of Proc. the 5th International Conference on Complex, Intelligent and Software Intensive Systems, pp.536-540, Seoul, Korea (2011)
  • Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu, "A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures," BMC Boinformatics 2011, 12 (Suppl. 1):S13 (2011). [HTML] biomedcentral.com
  • 中西裕陽，富田悦次， "最大クリーク問題の多項式時間的可解性の改良結果," 電子情報通信学会論文誌 D, Vol.J94-D，no.5，pp.843-851 (2011)     詳細証明の追記
  • Mitsuo Wakatsuki, Etsuji Tomita, "Polynomial time identification of strict prefix deterministic finite state transducers," International Colloquium on Grammatical Inference (ICGI 2010), Valencia, Spain, Lecture Notes in Artificial Intelligence, 6339, pp.313-316 (2010).
  • Etsuji Tomita, "Plenary Lecture: The Maximum Clique Problem, " Proc. 14th WSEAS International Conference on Computers (Vol. I), p.19, Corfu, Greece (2010).
  • 中西裕陽，富田悦次, "最大クリーク問題の多項式時間的可解性の一結果," 電子情報通信学会論文誌 D, vol.J93-D, no.4, pp.417-425 (2010)
  • 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), Dhaka, Bangladesh, Lecture Notes in Computer Science, 5942, pp.191-203 (2010). [PDF] googlecode.com
  • Tsutomu Matsunaga, Chikara Yonemori, Etsuji Tomita, Masaaki Matsumura, " Clique-based data mining for related genes in a biomedical database," BMC Bioinformatics 10 (2009). (3rd of Most viewed articles in past 30 days: BMC Bioinformatics in July 2009). [PDF] biomedcentral.com
  • 米森 力，松永 務，関根 純，富田悦次，" クリークを用いた企業間関係の構造分析," 日本データベース学会論文誌, vol.7, no.4, pp.55-60 (2009). [PDF] dbsj.org
  • Mitsuo Wakatsuki, Etsuji Tomita, " Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data," IEICE Trans. on Information and Systems, E91-D, pp.1704-1718 (2008).
  • 清野和司，富田悦次，若月光夫, "実時間空スタック受理式決定性限定ワンカウンタ変換器対の多項式時間等価性判定," 電子情報通信学会論文誌D，vol.J91-D, no.5, pp.1188-1201 (2008)
  • Etsuji Tomita, "The Maximum Clique Problem and Its Applications - Invited Lecture - ," IPSJ SIG Technical Report, 2007-MPS-67/2007-BIO-11, pp.21-24 (2007).
  • 清野和司，富田悦次，若月光夫, "ε-推移を許したある決定性プッシュダウン変換器対の多項式時間等価性判定," vol.J90-D, no.10, pp.2675-2690 (2007)
  • Etsuji Tomita, "Advanced algorithms and their applications," Proc. Advanced ICT (AICT 2007), Beijing, China, pp.1-6 (2007).
  • Mitsuo Wakatsuki, Etsuji Tomita, " Polynomial time identification of finite state transducers in some class," Proc. Advanced ICT (AICT 2007), Beijing, China, pp.7-12 (2007).
  • Etsuji Tomita, Toshikatsu Kameda, "An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, " Journal of Global Optimization, Vol. 37, pp.95-111 (2007), Vol.44, p.311 (2009). [PDF] gla.ac.uk
  • Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, "The worst-case time complexity for generating all maximal cliques and computational experiments,"(Invited paper for the special issue on COCOON 2004), Theoretical Computer Science, Vol. 363, pp.28-42 (2006). ( Theoretical Computer Science Top Cited Article 2005-2010, 16th of TOP25 Hottest Articles within the journal: Theoretical Computer Science in Oct. 2009 - Sept. 2010). The preliminary version was presented in: Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, "The worst-case time complexity for generating all maximal cliques," International Computing and Combinatorics Conference (COCOON 2004), Jeju, Korea, Lecture Notes in Computer Science, 3106, pp.161- 170 (2004). [HTML] sciencedirect.com
  • Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada: "A unified algorithm for extending classes of languages identifiable in the limit from positive data," International Colloquium on Grammatical Inference (ICGI 2006), Tokyo, Japan, Lecture Notes in Artificial Intelligence, 4201, pp.161-174 (2006). [PDF] tiera.ru
  • J.B. Brown, Dukka Bahadur K. C, Etsuji Tomita, Tatsuya Akutsu, " Multiple methods for protein side chain packing using maximum weight cliques ," Genome Informatics, Vol.17, pp.3-12 (2006). [PDF] jsbi.org
  • Dukka Bahadur K. C, Etsuji Tomita, Jun'ichi Suzuki, Katsushi Horimoto, Tatsuya Akutsu, "Protein threading with profiles and distance constraints using clique based algorithms , " Journal of Bioinformatics and Computational Biology, Vol.4, pp.19-42 (2006). The preliminary version was presented in: Dukka Bahadur K. C, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu, "Clique based algorithms for protein threading with profiles and constraints," Proc. Asia-Pacific Bioinformatics Conference (APBC 2005), pp.51-64 (2005). [PDF] nus.edu.sg
  • Tatsuya Akutsu, Morihiro Hayashida, Dukka Bahadur K. C, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, "Dynamic programming and clique based approaches for protein threading with profiles and constraints", IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E89-A, pp.1215-1222 (2006). The preliminary version was presented in: Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, "Protein threading with profiles and constraints", Proc. IEEE Symp. on Bioinformatics and Bioengineering (BIBE 2004), pp.537-544 (2004). [PDF] psu.edu
  • Dukka Bahadur K. C, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu, "Protein side-chain packing problem: A maximum edge-weight clique algorithmic approach," Journal of Bioinformatics and Computational Biology, Vol.3, pp. 103-126 (2005). The preliminary version was presented in: Dukka Bahadur K.C., Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki, "Protein side-chain packing: A maximum edge weight clique algorithmic approach, "Proc. Asia-Pacific Bioinformatics Conference (APBC 2004), pp.191-200 (2004). [PDF] crpit.com
  • Dukka Bahadur K. C, J. B. Brown, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu, "Large scale protein side-chain packing based on maximum edge-weight clique finding algorithm," Proc. 2005 International Joint Conference of InCoB, AASBi and KSBI (BIOINFO2005), pp.228-233 (2005). [PDF] evansville.edu
  • Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada, "Polynomial time learning of simple deterministic languages via queries and a representative sample," Theoretical Computer Science, Vol.329, pp.203-221(2004). (4th of TOP25 Hottest Articles within the journal: Theoretical Computer Science in Oct.-Dec., 2004, and 14th in Apr.-June, 2005). The preliminary version was presented in: Yasuhoro Tajima, Etsuji Tomita, "A polynomial time learning algorithm via membership queries and a representative sample," International Colloquium on Grammatical Inference, Lisbon, Portugal (ICGI 2000), Lecture Notes in Artificial Intelligence, 1891, pp.284-297 (2000).
  • Akinobu Miyata, Jun Tarui, Etsuji Tomita, "Learning Boolean functions in AC0 on attribute and classification noise," International Conference on Algorithmic Learning Theory (ALT 2004), Padova, Italy, Lecture Notes in Artificial Intelligence, 3244, pp.142-155 (2004). [PDF] tiera.ru
  • Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita, "Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data," International Colloquium on Grammatical Inference (ICGI 2004), Athens, Greece, Lecture Notes in Artificial Intelligence, 3264, pp.260-272 (2004).
  • Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun7ichi Suzuki, Katsuhisa Horimoto, " Algorithms for computing an optimal protein threading with profiles and distance restraints," Genome Informatics, 14, pp.480-481 (2003). [PDF] sakura.ne.jp
  • Etsuji Tomita, Tomokazu Seki, "An efficient branch-and bound algorithm for finding a maximum clique," Discrete Mathematics and Theoretical Computer Science (DMTCS 2003), Dijon, France, Lecture Notes in Computer Science, 2731, pp.278-289 (2003). [PDF] tiera.ru
  • Satoshi Kobayashi, Tomohiro Kondo, Kohei Okuda, Etsuji Tomita, " Extracting globally structure free sequences by local structure freeness," Proc. International Meeting on DNA Based Computers 9, p.206 (2003).
  • 堀田一弘，富田悦次，高橋治久, " 最大クリーク抽出に基づく向きの変化に依存しない人物の顔検出," 情報処理学会論文誌:数理モデル化と応用, Vol.44, No.SIG14(TOM9))，pp.57-70 (2003)
  • Dukka Bahadur K. C. , Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki, Asao Fujiyama, " Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm," Genome Informatics, 13, pp.143-152 (2002). [PDF] jsbi.org
  • Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, "Polynomial time learnability of simple deterministic languages from MAT and a representative sample," IEICE Trans. on Information and Systems , E83-D, pp.757-765 (2000).

4. その他 主な発表論文

  • 但馬康宏，富田悦次，若月光夫, "構造反例付き等価性質問を用いた 単純決定性言語の多項式時間MAT学習," 電子情報通信学会論文誌, J82-D-I, pp.521-532 (1999)
  • Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita, "A polynomial-time algorithm for checking the inclusion for real-time deterministic restricted one-counter automata which accept by accept mode," IEICE Trans. on Information and Systems, E81-D, pp,1-11(1998).
  • Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita, "Some properties of deterministic restricted one-counter automata," IEICE Trans. on Information and Systems, E79-D, pp.914-924(1996).
  • 富田悦次，今松憲一，木幡康弘，若月光夫, "最大クリークを抽出する単純で効率的な分枝限定アルゴリズムと実験的評価," 電子情報通信学会論文誌, J79-D-I, pp.1-8 (1996)
  • Etsuji Tomita, Kazushi Seino, "The extended equivalence problem for a class of non-real-time deterministic pushdown automata," Acta Informatica. 32, pp.395-413 (1995).
  • 山田義朗，富田悦次，高橋治久, "近似最大クリークを抽出する確率アルゴリズムとその実験的評価," 電子情報通信学会論文誌, J76-D-I, pp.46-53 (1993)
  • Mitsuo Wakatsuki, Etsuji Tomita, "A fast algorithm for checking the inclusion for very simple deterministic pushdown automata," IEICE Trans. on Information and Systems, E76-D, pp.1224-1233 (1993).
  • Haruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata, "Separability of internal representations in multilayer perceptrons with application to learning," Neural Networks, 6, pp. 689-703 (1993).
  • 若月光夫，富田悦次"単純決定性プッシュダウンオートマトンの等価性を決定する最短入力記・・ｷの上界," 電子情報通信学会論文誌, J75-D-I, pp.950-953 (1992)
  • 若月光夫，富田悦次, "単純決定性プッシュダウンオートマトンの等価性判定の改良分岐アルゴリズムとその最大時間計算量," 電子情報通信学会論文誌, J74-D-I, pp.595-603 (1991)
  • 富田悦次．高橋治久・三間慎介, "近似最大クリークを抽出する多項式時間アルゴリズムとその実験的評価 " 電子情報通信学会論文誌, J74-D, pp.307-310 (1991).
  • Mitsuo Wakatsuki, Etsuji Tomita, "An improved branching algorithm for checking the equivalence of simple DPDA's and its worst-case time complexity," IEICE Trans. J74-D-I, 9, pp.595-603 (1991).
  • Etsuji Tomita, Kazushi Seino, "A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict," Theor. Comput. Sci., 64, pp.39-53 (1989). [HTML] sciencedirect.com
  • 若月光夫，富田悦次, "単純決定性プッシュダウンオートマトンの等価性判定を行う分岐アルゴリズム," 電子情報通信学会論文誌, J72-D-I,　pp.327-334 (1989)
  • 新道美喜男，富田悦次, "最大クリークを抽出する単純なアルゴリズムとその最大時間計算量," 電子情報通信学会論文誌, J71-D, pp.472-481 (1988)
    Mikio Shindo, Etsuji Tomita, "A simple algorithm for finding a maximum clique and its worst-case time complexity," Systems and Computers in Japan, 21, Wiley, pp.1-13 (1990).
  • Etsuji Tomita, Masahiro Igarashi"A direct branching algorithm for checking equivalence for finite-turn DPDA's," 　Trans. IECE, E69, pp.193-195 (1986)
  • Etsuji Tomita, Kazushi Seino, "A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable," Theor. Comput. Sci., 41, pp.223-230 (1985). [HTML] sciencedirect.com
  • 清野和司，富田悦次，鈴木貴史，"分岐アルゴリズムによるDPDAの拡張等価性判定の一結果," 電子情報通信学会論文誌, J68-D,　pp.2157-2158　(1985)
  • 富田悦次, "ある非実時間決定性プッシュダウン変換器対の等価性判定," 電子情報通信学会論文誌, J68-D,　pp.2157-2158　(1985).
  • 富田悦次, 藤井利昭, "最大クリーク抽出の効率化手法とその実験的評価," 電子情報通信学会論文誌, J68-D, 3, pp.221-228　(1985).
  • Etsuji Tomita, "An extended direct branching algorithm for checking equivalence of deterministic pushdown automata," Theor. Comput. Sci., 32, pp.87-120 (1984). [HTML] sciencedirect.com
  • Etsuji Tomita, "A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars," Theor. Comput. Sci., 23, pp.129-154 (1983). [HTML] sciencedirect.com
  • Etsuji Tomita, " A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata," Information and Control, 52, pp.187-238 (1982). [HTML] sciencedirect.com
  • 富田悦次,　" 決定性プッシュダウンオートマトンの等価性判定が可解であるためのある十分条件," 電子通信学会論文誌, J64-D, pp.9-16 (1981)
  • 富田悦次,　" LL(k)文法に対するより直接的な等価性判定法," 電子通信学会論文誌, J63-D, pp.755-762 (1980)
  • 富田悦次,　" 一方がε-動作なし空スタッフ受理式である決定性プッシュダウン変換器の等価性判定," 電子通信学会論文誌, 62-D, pp.467-474 (1979)
  • 富田悦次, " 分岐アルゴリズムによる決定性プッシュダウンオートマトン(クラスDo:Ro)の等価性判定," 電子通信学会論文誌, 61-D, pp.759-766 (1978)
  • 榎本肇，富田悦次, " 代表記号例集合による決定性有限オートマトンの適応的修正法," 電子通信学会論文誌, 60-D, pp.777-784 (1977)
  • 榎本肇，富田悦次, " 決定性有限オートマトンの代表記号例集合," 電子通信学会論文誌, 59-D, pp.660-667 (1976)
  • 榎本肇，富田悦次，小谷野修, " 決定性一般化順序機械の・纒\入出力記号列集合," 電子通信学会論文誌, 59-D, pp.509-510 (1976)
  • Hajime Enomoto, Etsuji Tomita, Shuji Doshita, " Synthesis of automata that recognize given strings and characterization of automata by representative sets of strings," Proc. First USA-Japan Computer Conf., pp.21-27 (1972).
  • 榎本肇，堂下修司，富田悦次, " サンプル記号例を識別する最簡オートマトンの構成," 電子通信学会論文誌, 55-D, pp.210-217 (1972)
  • Yasuharu Suematsu, Kazuyasu Nomura, Etsuji Tomita, " Measurement of delay time differences on the photocathode surface of a photo-multiplier," Proc. IEEE, 56, pp.1405-1406 (1968).

5. Basic Technical Reports

    [TTT88]    Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, " The worst-case time complexity for finding all the cliques," Technical Report of the University of Electro-Communications, UEC-TR-C5(2) (1988)     (Early version of CLIQUES [TTT04]: Reference [23] in [TTT06] )   [HTML] nii.ac.jp
    [TKT88]    Etsuji Tomita, Yasuhiro Kohata, Haruhisa Takahashi, " A simple algorithm for finding a maximum clique," Technical Report of the University of Electro-Communications, UEC-TR-C5(1) (1988)     (Earlier version of MCQ [TS03]: Reference [16] in [TS03] )   [HTML] nii.ac.jp
    [TMT88]    Etsuji Tomita, Shinsuke Mitsuma, Haruhisa Takahashi, " Two algorithms for finding a near-maximum clique," Technical Report of the University of Electro-Communications, UEC-TR-C1 (1988)     ( Reference [44] in [TSHW13] )   [HTML] nii.ac.jp

         (The above three Technical Reports were reviewed by the following well-known papers:
    •  P.M. Pardalos and J. Xue, "The maximum clique problem," J. Global Optomization, vol.4, pp.301-328 (1994), References 238, 239, 240. [HTML]spriner.com
    •  I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, "The maximum clique problem."   In: D.-Z. Du and P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Supplement vol.A, Kluwer Academic Publishers, pp.1-74 (1999), References 308, 309,310. [PDF]psu.edu )

6. 招待講演 (2015年以降)　

　
  • Etsuji Tomita: " The Maximum Clique Problem and Its Applications," Joint Bioinformatics Education Program, Kyoto University and University of Tokyo, at Bioinformatics Center, Institute for Chemical Research, Kyoto University, February 7，2020．
  • 富田悦次： " ビッグデータ　～　最大，極大クリーク抽出によるビッグデータ分析," 非営利法人日本シンクタンクアカデミー月例政策研究会，於 慶應義塾大学三田キャンパス，2019年6月4日．
  • Etsuji Tomita: " Enumeration of maximum cliques and its application to coding theory," Dagstuhl Seminar on Enumeration in Data Management, at Dagstuhl, Germany，May 23, 2019.
  • 富田悦次： " 最大クリーク全列挙アルゴリズムと符号理論への応用," 北海道大学大学院情報科学研究科情報理工学専攻知識ソフトウェア科学講座企画学術講演会，於 北海道大学，　2019年2月16日．
  • 富田悦次： " 効率的な最大および極大クリークアルゴリズムとその応用," 電子情報通信学会中国支部学術講演会，於 岡山理科大学，2018年3月6日．
  • 富田悦次： " Efficient algorithms for finding maximum and maximal cliques," 北海道大学大学院情報科学研究科情報理工学専攻学術講演，於 北海道大学，2017年6月5日．
  • Etsuji Tomita: " Efficient algorithms for finding maximum and maximal cliques and their applications," 　 WALCOM 2017 Keynote, at Hsinchu, Taiwan, March 29, 2017.
  • Etsuji Tomita: " Efficient algorithms for finding maximum and maximal cliques," International Spring School on Algorithms and Applications (ISSAA 2015)，　 at BUET, Dhaka, Bangladesh, February. 25, 2015.

Home