-
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, Dagstuhl, Germany (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)
-
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 inclusion of deterministic restricted one-counter transducers which accept by final state," CATA 2015, Honolulu, USA, Proc. 30th International Conference on Computers and Their Applications, pp.11-17 (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)
-
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, Volume 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)
-
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)
-
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)
-
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)