Etsuji Tomita

According to our database, Etsuji Tomita authored at least 57 papers between 1982 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Speeding-Up Construction Algorithms for the Graph Coloring Problem.

Kazuho Kanahara, Kengo Katayama, Etsuji Tomita

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., September, 2022

On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms.

Alessio Conte, Etsuji Tomita

Theor. Comput. Sci., 2022

2020

Speeding-Up of Construction Algorithms for the Graph Coloring Problem.

Kazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita

Proceedings of the Advances on Broad-Band Wireless Computing, Communication and Applications, 2020

2017

A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments.

Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki

J. Inf. Process., 2017

Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications.

Etsuji Tomita

Proceedings of the WALCOM: Algorithms and Computation, 2017

2016

Clique Enumeration.

Etsuji Tomita

Encyclopedia of Algorithms, 2016

Guest Editors' Foreword.

M. Sohel Rahman, Etsuji Tomita

J. Graph Algorithms Appl., 2016

Special issue on WALCOM 2015.

M. Sohel Rahman, Etsuji Tomita

J. Discrete Algorithms, 2016

A fast and complete algorithm for enumerating pseudo-cliques in large graphs.

Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita

Int. J. Data Sci. Anal., 2016

A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs.

Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016

Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound.

Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita

Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2016

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.

Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State.

Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino

Proceedings of the Software Engineering, 2015

Enumerating Maximal Clique Sets with Pseudo-Clique Constraint.

Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita

Proceedings of the Discovery Science - 18th International Conference, 2015

2013

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments.

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki

IEICE Trans. Inf. Syst., 2013

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State.

Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino

Proceedings of the 14th ACIS International Conference on Software Engineering, 2013

Relational Change Pattern Mining Based on Modularity Difference.

Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita

Proceedings of the Multi-disciplinary Trends in Artificial Intelligence, 2013

2012

A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees.

Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu

J. Comput. Biol., 2012

Finding What Changes for Two Graphs Constructed from Different Time Intervals.

Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita

Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search.

Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita

Proceedings of the Discovery Science - 15th International Conference, 2012

2011

Learning Boolean functions in AC⁰ on attribute and classification noise - Estimating an upper bound on attribute and classification noise.

Akinobu Miyata, Jun Tarui, Etsuji Tomita

Theor. Comput. Sci., 2011

A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.

Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu

BMC Bioinform., 2011

An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures.

Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita

Proceedings of the International Conference on Complex, 2011

2010

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers.

Mitsuo Wakatsuki, Etsuji Tomita

Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2009

Clique-based data mining for related genes in a biomedical database.

Tsutomu Matsunaga, Chikara Yonemori, Etsuji Tomita, Masaaki Muramatsu

BMC Bioinform., 2009

2008

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.

Mitsuo Wakatsuki, Etsuji Tomita

IEICE Trans. Inf. Syst., 2008

2007

Guest editors' foreword.

Hans Ulrich Simon, Etsuji Tomita

Theor. Comput. Sci., 2007

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments.

Etsuji Tomita, Toshikatsu Kameda

J. Glob. Optim., 2007

A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring.

Etsuji Tomita, Yoichi Sutani, Takanori Higashi

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

2006

The worst-case time complexity for generating all maximal cliques and computational experiments.

Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi

Theor. Comput. Sci., 2006

Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms.

K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu

J. Bioinform. Comput. Biol., 2006

Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints.

Tatsuya Akutsu, Morihiro Hayashida, Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data.

Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada

Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2005

Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach.

K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu

J. Bioinform. Comput. Biol., 2005

Clique-based algorithms for protein threading with profiles and constraints.

Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu

Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

Editors' Introduction.

Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004

Polynomial time learning of simple deterministic languages via queries and a representative sample.

Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada

Theor. Comput. Sci., 2004

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.

Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

The Worst-Case Time Complexity for Generating All Maximal Cliques.

Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Protein Threading with Profiles and Constraints.

Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto

Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach.

Dukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki

Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004

Learning Boolean Functions in AC⁰ on Attribute and Classification Noise.

Akinobu Miyata, Jun Tarui, Etsuji Tomita

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.

Etsuji Tomita, Tomokazu Seki

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2000

A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample.

Yasuhiro Tajima, Etsuji Tomita

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1997

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations.

Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki

Syst. Comput. Jpn., 1997

1995

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State.

Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita

IEICE Trans. Inf. Syst., 1995

A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata.

Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki

IEICE Trans. Inf. Syst., 1995

The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata.

Etsuji Tomita, Kazushi Seino

Acta Informatica, 1995

1994

A randomized algorithm for finding a near-maximum clique and its experimental evaluations.

Yoshiaki Yamada, Etsuji Tomita, Haruhisa Takahashi

Syst. Comput. Jpn., 1994

1993

Separability of internal representations in multilayer perceptrons with application to learning.

Haruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata

Neural Networks, 1993

1990

A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity.

Miklo Shindo, Etsuji Tomita

Syst. Comput. Jpn., 1990

1989

A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict.

Etsuji Tomita, Kazushi Seino

Theor. Comput. Sci., 1989

1985

A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable.

Etsuji Tomita, Kazushi Seino

Theor. Comput. Sci., 1985

1984

An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata.

Etsuji Tomita

Theor. Comput. Sci., 1984

1983

A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars.

Etsuji Tomita

Theor. Comput. Sci., 1983

1982

A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata

Etsuji Tomita

Inf. Control., February, 1982