Etsuji Tomita

63 papers B 12C 2Misc 4Journal 32Unranked 10
YearRankTypeTitle / Venue / Authors
2022 J jnl
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms.
Theor. Comput. Sci.
Alessio Conte, Etsuji Tomita
2022 J jnl
Speeding-Up Construction Algorithms for the Graph Coloring Problem.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuho Kanahara, Kengo Katayama, Etsuji Tomita
2021 B conf
Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms.
WALCOM
Alessio Conte, Etsuji Tomita
2020 — conf
Speeding-Up of Construction Algorithms for the Graph Coloring Problem.
BWCCA
Kazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita
2017 J jnl
A Much Faster Algorithm for Finding a Maximum Clique with Computational Experiments.
J. Inf. Process.
Etsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
2017 B conf
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications.
WALCOM
Etsuji Tomita
2016 — conf
A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs.
PAKDD (1)
Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
2016 Misc conf
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
FAW
Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki
2016 J jnl
A fast and complete algorithm for enumerating pseudo-cliques in large graphs.
Int. J. Data Sci. Anal.
Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
2016 — ch.
Clique Enumeration.
Encyclopedia of Algorithms
Etsuji Tomita
2016 — conf
Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound.
MLDM
Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
2016 J jnl
Guest Editors' Foreword.
J. Graph Algorithms Appl.
M. Sohel Rahman, Etsuji Tomita
2016 J jnl
Special issue on WALCOM 2015.
J. Discrete Algorithms
M. Sohel Rahman, Etsuji Tomita
2015 — ch.
A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final State.
Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing
Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
2015 B conf
Enumerating Maximal Clique Sets with Pseudo-Clique Constraint.
Discovery Science
Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
2015 B ed.
WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings
WALCOM
M. Sohel Rahman, Etsuji Tomita
2013 C conf
A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State.
SNPD
Mitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino
2013 J jnl
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments.
IEICE Trans. Inf. Syst.
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki
2013 — conf
Relational Change Pattern Mining Based on Modularity Difference.
MIWAI
Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
2012 J jnl
A Clique-Based Method Using Dynamic Programming for Computing Edit Distance Between Unordered Trees.
J. Comput. Biol.
Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu
2012 — conf
Finding What Changes for Two Graphs Constructed from Different Time Intervals.
IIAI-AAI
Aixiang Li, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita
2012 B conf
Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search.
Discovery Science
Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita
2011 J jnl
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
BMC Bioinform.
Daiji Fukagawa, Takeyuki Tamura, Atsuhiro Takasu, Etsuji Tomita, Tatsuya Akutsu
2011 Misc conf
An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures.
CISIS
Tatsuya Akutsu, Tomoya Mori, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu, Etsuji Tomita
2011 J jnl
Learning Boolean functions in AC
Theor. Comput. Sci.
Akinobu Miyata, Jun Tarui, Etsuji Tomita
2010 B conf
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
WALCOM
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki
2010 — conf
Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers.
ICGI
Mitsuo Wakatsuki, Etsuji Tomita
2009 J jnl
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments.
J. Glob. Optim.
Etsuji Tomita, Toshikatsu Kameda
2009 J jnl
Clique-based data mining for related genes in a biomedical database.
BMC Bioinform.
Tsutomu Matsunaga, Chikara Yonemori, Etsuji Tomita, Masaaki Muramatsu
2008 J jnl
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
IEICE Trans. Inf. Syst.
Mitsuo Wakatsuki, Etsuji Tomita
2007 Misc conf
A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring.
PDPTA
Etsuji Tomita, Yoichi Sutani, Takanori Higashi
2007 J jnl
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments.
J. Glob. Optim.
Etsuji Tomita, Toshikatsu Kameda
2007 J jnl
Guest editors' foreword.
Theor. Comput. Sci.
Hans Ulrich Simon, Etsuji Tomita
2006 — conf
A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data.
ICGI
Mitsuo Wakatsuki, Etsuji Tomita, Go Yamada
2006 J jnl
Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tatsuya Akutsu, Morihiro Hayashida, Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto
2006 — ed.
Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings
ICGI
Yasubumi Sakakibara, Satoshi Kobayashi, Kengo Sato, Tetsuro Nishino, Etsuji Tomita
2006 J jnl
Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms.
J. Bioinform. Comput. Biol.
K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
2006 J jnl
The worst-case time complexity for generating all maximal cliques and computational experiments.
Theor. Comput. Sci.
Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
2005 B ed.
Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings
ALT
Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
2005 B conf
Clique-based algorithms for protein threading with profiles and constraints.
APBC
Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto, Tatsuya Akutsu
2005 B conf
Editors' Introduction.
ALT
Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
2005 J jnl
Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach.
J. Bioinform. Comput. Biol.
K. C. Dukka Bahadur, Etsuji Tomita, Jun'ichi Suzuki, Tatsuya Akutsu
2004 B conf
Learning Boolean Functions in AC
ALT
Akinobu Miyata, Jun Tarui, Etsuji Tomita
2004 — conf
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
ICGI
Mitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita
2004 J jnl
Polynomial time learning of simple deterministic languages via queries and a representative sample.
Theor. Comput. Sci.
Yasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada
2004 B conf
Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach.
APBC
Dukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki
2004 C conf
Protein Threading with Profiles and Constraints.
BIBE
Tatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun'ichi Suzuki, Katsuhisa Horimoto
2004 Misc conf
The Worst-Case Time Complexity for Generating All Maximal Cliques.
COCOON
Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi
2003 — conf
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.
DMTCS
Etsuji Tomita, Tomokazu Seki
2000 — conf
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample.
ICGI
Yasuhiro Tajima, Etsuji Tomita
1997 J jnl
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations.
Syst. Comput. Jpn.
Etsuji Tomita, Ken'ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki
1995 J jnl
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.
Ken Higuchi, Mitsuo Wakatsuki, Etsuji Tomita
1995 J jnl
A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata.
IEICE Trans. Inf. Syst.
Ken Higuchi, Etsuji Tomita, Mitsuo Wakatsuki
1995 J jnl
The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen Automata.
Acta Informatica
Etsuji Tomita, Kazushi Seino
1994 J jnl
A randomized algorithm for finding a near-maximum clique and its experimental evaluations.
Syst. Comput. Jpn.
Yoshiaki Yamada, Etsuji Tomita, Haruhisa Takahashi
1993 B ed.
Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings
ALT
Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori
1993 J jnl
Separability of internal representations in multilayer perceptrons with application to learning.
Neural Networks
Haruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata
1990 J jnl
A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity.
Syst. Comput. Jpn.
Miklo Shindo, Etsuji Tomita
1989 J jnl
A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict.
Theor. Comput. Sci.
Etsuji Tomita, Kazushi Seino
1985 J jnl
A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable.
Theor. Comput. Sci.
Etsuji Tomita, Kazushi Seino
1984 J jnl
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata.
Theor. Comput. Sci.
Etsuji Tomita
1983 J jnl
A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars.
Theor. Comput. Sci.
Etsuji Tomita
1982 J jnl
A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata
Inf. Control.
Etsuji Tomita