Etsuji Tomita

According to our database1, Etsuji Tomita
  • authored at least 53 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications.
Proceedings of the WALCOM: Algorithms and Computation, 2017

2016
Clique Enumeration.
Encyclopedia of Algorithms, 2016

Guest Editors' Foreword.
J. Graph Algorithms Appl., 2016

Special issue on WALCOM 2015.
J. Discrete Algorithms, 2016

A fast and complete algorithm for enumerating pseudo-cliques in large graphs.
I. J. Data Science and Analytics, 2016

A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016

Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2016

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
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.
Proceedings of the Software Engineering, 2015

Enumerating Maximal Clique Sets with Pseudo-Clique Constraint.
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.
IEICE Transactions, 2013

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State.
Proceedings of the 14th ACIS International Conference on Software Engineering, 2013

Relational Change Pattern Mining Based on Modularity Difference.
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.
Journal of Computational Biology, 2012

Structural Change Pattern Mining Based on Constrained Maximal k-Plex Search.
Proceedings of the Discovery Science - 15th International Conference, 2012

2011
Learning Boolean functions in AC0 on attribute and classification noise - Estimating an upper bound on attribute and classification noise.
Theor. Comput. Sci., 2011

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

An Improved Clique-Based Method for Computing Edit Distance between Unordered Trees and Its Application to Comparison of Glycan Structures.
Proceedings of the International Conference on Complex, 2011

2010
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Polynomial Time Identification of Strict Prefix Deterministic Finite State Transducers.
Proceedings of the Grammatical Inference: Theoretical Results and Applications, 2010

2009
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments.
J. Global Optimization, 2009

Clique-based data mining for related genes in a biomedical database.
BMC Bioinformatics, 2009

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

2007
Guest editors' foreword.
Theor. Comput. Sci., 2007

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments.
J. Global Optimization, 2007

A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring.
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.
Theor. Comput. Sci., 2006

Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms.
J. Bioinformatics and Computational Biology, 2006

Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints.
IEICE Transactions, 2006

A Unified Algorithm for Extending Classes of Languages Identifiable in the Limit from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2005
Protein Side-chain Packing Problem: a Maximum Edge-weight Clique Algorithmic Approach.
J. Bioinformatics and Computational Biology, 2005

Clique-based algorithms for protein threading with profiles and constraints.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

Editors' Introduction.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004
Polynomial time learning of simple deterministic languages via queries and a representative sample.
Theor. Comput. Sci., 2004

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

The Worst-Case Time Complexity for Generating All Maximal Cliques.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Protein Threading with Profiles and Constraints.
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.
Proceedings of the Second Asia-Pacific Bioinformatics Conference (APBC 2004), 2004

Learning Boolean Functions in AC0 on Attribute and Classification Noise.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique.
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.
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.
Systems and Computers in Japan, 1997

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

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

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

1994
A randomized algorithm for finding a near-maximum clique and its experimental evaluations.
Systems and Computers in Japan, 1994

1993
Separability of internal representations in multilayer perceptrons with application to learning.
Neural Networks, 1993

1990
A Simple Algorithm for Finding a Maximum Clique and Its Worst-Case Time Complexity.
Systems and Computers in Japan, 1990

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

1985
A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable.
Theor. Comput. Sci., 1985

1984
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata.
Theor. Comput. Sci., 1984

1983
A Direct Branching Algorithm for Checking Equivalence of Strict Deterministic VS. LL(k) Grammars.
Theor. Comput. Sci., 1983

1982
A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata
Information and Control, February, 1982


  Loading...