Etsuji Tomita - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 58 from 58

2022

On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithmsAlessio Conte, Etsuji Tomita. TCS, 899:1-24, 2022. [doi]

Speeding-Up Construction Algorithms for the Graph Coloring ProblemKazuho Kanahara, Kengo Katayama, Etsuji Tomita. ieiceta, 105-A(9):1241-1251, September 2022. [doi]

2021

Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch AlgorithmsAlessio Conte, Etsuji Tomita. walcom 2021: 195-207 [doi]

2020

Speeding-Up of Construction Algorithms for the Graph Coloring ProblemKazuho Kanahara, Kengo Katayama, Takafumi Miyake, Etsuji Tomita. bwcca 2021: 211-222 [doi]

2017

Efficient Algorithms for Finding Maximum and Maximal Cliques and Their ApplicationsEtsuji Tomita. walcom 2017: 3-15 [doi]

A Much Faster Algorithm for Finding a Maximum Clique with Computational ExperimentsEtsuji Tomita, Sora Matsuzaki, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki. jip, 25:667-677, 2017. [doi]

2016

2015

A Polynomial-Time Algorithm for Checking the Equivalence of Deterministic Restricted One-Counter Transducers Which Accept by Final StateMitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino. In Roger Lee, editor, Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing. Volume 569 of Studies in Computational Intelligence, pages 131-144, Springer, 2015. [doi]

Enumerating Maximal Clique Sets with Pseudo-Clique ConstraintHongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita. dis 2015: 324-339 [doi]

2013

Relational Change Pattern Mining Based on Modularity DifferenceYoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita. miwai 2013: 187-198 [doi]

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational ExperimentsEtsuji Tomita, Yoichi Sutani, Takanori Higashi, Mitsuo Wakatsuki. ieicet, 96-D(6):1286-1298, 2013. [doi]

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final StateMitsuo Wakatsuki, Etsuji Tomita, Tetsuro Nishino. snpd 2013: 459-465 [doi]

2012

2011

2010

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki. walcom 2010: 191-203 [doi]

Polynomial Time Identification of Strict Prefix Deterministic Finite State TransducersMitsuo Wakatsuki, Etsuji Tomita. icgi 2010: 313-316 [doi]

2009

Clique-based data mining for related genes in a biomedical databaseTsutomu Matsunaga, Chikara Yonemori, Etsuji Tomita, Masaaki Muramatsu. bmcbi, 10, 2009. [doi]

An efficient branch-and-bound algorithm for finding a maximum clique with computational experimentsEtsuji Tomita, Toshikatsu Kameda. jgo, 44(2):311, 2009. [doi]

2008

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive DataMitsuo Wakatsuki, Etsuji Tomita. ieicet, 91-D(6):1704-1718, 2008. [doi]

2007

Guest editors forewordHans-Ulrich Simon, Etsuji Tomita. TCS, 387(1):1-3, 2007. [doi]

A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate ColoringEtsuji Tomita, Yoichi Sutani, Takanori Higashi. pdpta 2007: 719-725

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational ExperimentsEtsuji Tomita, Toshikatsu Kameda. jgo, 37(1):95-111, 2007. [doi]

2006

2005

2004

Protein Threading with Profiles and ConstraintsTatsuya Akutsu, Morihiro Hayashida, Etsuji Tomita, Jun ichi Suzuki, Katsuhisa Horimoto. bibe 2004: 537-544 [doi]

Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic ApproachDukka Bahadur, Tatsuya Akutsu, Etsuji Tomita, Tomokazu Seki. apbc 2004: 191-200 [doi]

Learning Boolean Functions in AC:::0::: on Attribute and Classification NoiseAkinobu Miyata, Jun Tarui, Etsuji Tomita. alt 2004: 142-155 [doi]

Polynomial time learning of simple deterministic languages via queries and a representative sampleYasuhiro Tajima, Etsuji Tomita, Mitsuo Wakatsuki, Matsuaki Terada. TCS, 329(1-3):203-221, 2004. [doi]

The Worst-Case Time Complexity for Generating All Maximal CliquesEtsuji Tomita, Akira Tanaka, Haruhisa Takahashi. cocoon 2004: 161-170 [doi]

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive DataMitsuo Wakatsuki, Kiyoshi Teraguchi, Etsuji Tomita. icgi 2004: 260-272 [doi]

2003

An Efficient Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Tomokazu Seki. dmtcs 2003: 278-289 [doi]

2000

A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative SampleYasuhiro Tajima, Etsuji Tomita. icgi 2000: 284-297

1997

A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluationsEtsuji Tomita, Ken ichi Imamatsu, Yasuhiro Kohata, Mitsuo Wakatsuki. scjapan, 28(5):60-67, 1997. [doi]

1995

A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter AutomataKen Higuchi, Etsuji Tomita, Mitsuo Wakatsuki. ieicet, 78-D(4):305-313, 1995. [doi]

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final StateKen Higuchi, Mitsuo Wakatsuki, Etsuji Tomita. ieicet, 78-D(8):939-950, 1995. [doi]

The Extendes Equivalence Problem for a Class of Non-Real-Time Deterministic Pushdowen AutomataEtsuji Tomita, Kazushi Seino. ACTA, 32(4):395-413, 1995.

1994

A randomized algorithm for finding a near-maximum clique and its experimental evaluationsYoshiaki Yamada, Etsuji Tomita, Haruhisa Takahashi. scjapan, 25(2):1-7, 1994. [doi]

1993

Separability of internal representations in multilayer perceptrons with application to learningHaruhisa Takahashi, Etsuji Tomita, Tsutomu Kawabata. NN, 6(5):689-703, 1993. [doi]

1990

A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time ComplexityMiklo Shindo, Etsuji Tomita. scjapan, 21(3):1-13, 1990. [doi]

1989

A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time StrictEtsuji Tomita, Kazushi Seino. TCS, 64(1):39-53, 1989.

1985

A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA s to be DecidableEtsuji Tomita, Kazushi Seino. TCS, 41:223-230, 1985.

1984

An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown AutomataEtsuji Tomita. TCS, 32:87-120, 1984.

1983

A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) GrammarsEtsuji Tomita. TCS, 23:129-154, 1983.

1982

A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown AutomataEtsuji Tomita. iandc, 52(2):187-238, February 1982.

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Etsuji Tomita'

Viewing Publication 1 - 58 from 58

2022

2021

2020

2017

2016

2015

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2000

1997

1995

1994

1993

1990

1989

1985

1984

1983

1982

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Etsuji Tomita'

Viewing Publication 1 - 58 from 58

2022

2021

2020

2017

2016

2015

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2000

1997

1995

1994

1993

1990

1989

1985

1984

1983

1982

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1