Etsuji Tomita

Publication Activity (10 Years)

Years Active: 1982-2022
Publications (10 Years): 12

Top Topics

Computationally Complex

Strongly Polynomial

Top Venues

Discovery Science

Publications

Kazuho Kanahara, Kengo Katayama, Etsuji Tomita
Speeding-Up Construction Algorithms for the Graph Coloring Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2022)
Alessio Conte, Etsuji Tomita
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms. Theor. Comput. Sci. 899 (2022)
Alessio Conte, Etsuji Tomita
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms. WALCOM (2021)
Kazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita
Speeding-Up of Construction Algorithms for the Graph Coloring Problem. BWCCA (2020)
Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments. J. Inf. Process. 25 (2017)
Etsuji Tomita
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications. WALCOM (2017)
Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs. PAKDD (1) (2016)
M. Sohel Rahman, Etsuji Tomita
Special issue on WALCOM 2015. J. Discrete Algorithms 36 (2016)
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)
M. Sohel Rahman, Etsuji Tomita
Guest Editors' Foreword. J. Graph Algorithms Appl. 20 (1) (2016)
Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
A fast and complete algorithm for enumerating pseudo-cliques in large graphs. Int. J. Data Sci. Anal. 2 (3-4) (2016)
Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound. MLDM (2016)
Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
Enumerating Maximal Clique Sets with Pseudo-Clique Constraint. Discovery Science (2015)
Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
Relational Change Pattern Mining Based on Modularity Difference. 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. Inf. Syst. (6) (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. SNPD (2013)
Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
Finding What Changes for Two Graphs Constructed from Different Time Intervals. IIAI-AAI (2012)
Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search. Discovery Science (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. J. Comput. Biol. 19 (10) (2012)
Akinobu Miyata, Jun Tarui, Etsuji Tomita
on attribute and classification noise - Estimating an upper bound on attribute and classification noise. Theor. Comput. Sci. 412 (35) (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 Bioinform. 12 (S-1) (2011)
Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures. CISIS (2011)
Mitsuo Wakatsuki, Etsuji Tomita
Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers. ICGI (2010)
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. WALCOM (2010)
Etsuji Tomita, Toshikatsu Kameda
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 44 (2) (2009)
Tsutomu Matsunaga, Chikara Yonemori, Etsuji Tomita, Masaaki Muramatsu
Clique-based data mining for related genes in a biomedical database. BMC Bioinform. 10 (2009)
Mitsuo Wakatsuki, Etsuji Tomita
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. IEICE Trans. Inf. Syst. (6) (2008)
Etsuji Tomita, Yoichi Sutani, Takanori Higashi
A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring. PDPTA (2007)
Etsuji Tomita, Toshikatsu Kameda
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments. J. Glob. Optim. 37 (1) (2007)
Hans Ulrich Simon, Etsuji Tomita
Guest editors' foreword. Theor. Comput. Sci. 387 (1) (2007)
K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms. J. Bioinform. Comput. Biol. 4 (1) (2006)
Tatsuya Akutsu, Morihiro Hayashida, Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto
Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)
Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data. ICGI (2006)
Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363 (1) (2006)
Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
Clique-based algorithms for protein threading with profiles and constraints. APBC (2005)
Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
Editors' Introduction. ALT (2005)
K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu
Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach. J. Bioinform. Comput. Biol. 3 (1) (2005)
Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data. ICGI (2004)
Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
The Worst-Case Time Complexity for Generating All Maximal Cliques. COCOON (2004)
Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada
Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comput. Sci. 329 (1-3) (2004)
Dukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki
Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach. APBC (2004)
Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto
Protein Threading with Profiles and Constraints. BIBE (2004)
Akinobu Miyata, Jun Tarui, Etsuji Tomita
on Attribute and Classification Noise. ALT (2004)
Etsuji Tomita, Tomokazu Seki
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. DMTCS (2003)
Yasuhiro Tajima, Etsuji Tomita
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample. ICGI (2000)
Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. Systems and Computers in Japan 28 (5) (1997)
Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki
A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata. IEICE Trans. Inf. Syst. (4) (1995)
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 Final State. IEICE Trans. Inf. Syst. (8) (1995)
Etsuji Tomita, Kazushi Seino
The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata. Acta Informatica 32 (4) (1995)
Yoshiaki Yamada, Etsuji Tomita, Haruhisa Takahashi
A randomized algorithm for finding a near-maximum clique and its experimental evaluations. Systems and Computers in Japan 25 (2) (1994)
Haruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata
Separability of internal representations in multilayer perceptrons with application to learning. Neural Networks 6 (5) (1993)
Miklo Shindo, Etsuji Tomita
A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity. Systems and Computers in Japan 21 (3) (1990)
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 (1) (1989)
Etsuji Tomita, Kazushi Seino
A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable. Theor. Comput. Sci. 41 (1985)
Etsuji Tomita
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata. Theor. Comput. Sci. 32 (1984)
Etsuji Tomita
A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars. Theor. Comput. Sci. 23 (1983)
Etsuji Tomita
A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata Inf. Control. 52 (2) (1982)