Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The worst-case time complexity for generating all maximal cliques and computational experiments
2006451 citationsEtsuji Tomita, Akira Tanaka et al.Theoretical Computer Scienceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Etsuji Tomita's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Etsuji Tomita with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Etsuji Tomita more than expected).
This network shows the impact of papers produced by Etsuji Tomita. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Etsuji Tomita. The network helps show where Etsuji Tomita may publish in the future.
Co-authorship network of co-authors of Etsuji Tomita
This figure shows the co-authorship network connecting the top 25 collaborators of Etsuji Tomita.
A scholar is included among the top collaborators of Etsuji Tomita based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Etsuji Tomita. Etsuji Tomita is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Tomita, Etsuji & Alessio Conte. (2020). Another time-complexity analysis for the maximal clique enumeration algorithm CLIQUES. IEICE technical report. Speech. 120(2020). 1–8.1 indexed citations
Tomita, Etsuji, et al.. (2007). A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring.. Parallel and Distributed Processing Techniques and Applications. 719–725.1 indexed citations
6.
Kobayashi, Satoshi, et al.. (2006). Grammatical Inference: Algorithms and Applications: 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings (Lecture Notes in Computer Science). Springer eBooks.1 indexed citations
7.
Tomita, Etsuji, Akira Tanaka, & Haruhisa Takahashi. (2004). The Worst-Case Time Complexity for Generating All Maximal Cliques (Extended Abstract). Lecture notes in computer science. 161–170.2 indexed citations
Akutsu, Tatsuya, et al.. (2004). Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach. 191–200.7 indexed citations
10.
Tomita, Etsuji, et al.. (2002). An Algorithm for Finding a Maximum Clique with Maximum Edge - Weight and Computational Experiments. IPSJ SIG Notes. 2002(114). 45–48.6 indexed citations
11.
Akutsu, Tatsuya, et al.. (2002). Point matching under non - uniform distortions and protein side chain packing based on efficient maximum clique algorithms. IPSJ SIG Notes. 2002(36). 21–24.8 indexed citations
12.
Tomita, Etsuji, et al.. (1998). A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode. IEICE Transactions on Information and Systems. 81(1). 1–11.2 indexed citations
13.
Tomita, Etsuji, et al.. (1995). A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata. IEICE Transactions on Information and Systems. 78(4). 305–313.2 indexed citations
14.
Tomita, Etsuji, et al.. (1995). A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State. IEICE Transactions on Information and Systems. 78(8). 939–950.4 indexed citations
Tomita, Etsuji, et al.. (1993). A Fast Algorithm for Checking the Inclusion for Very Simple Deterministic Pushdown Automata. IEICE Transactions on Information and Systems. 76(10). 1224–1233.7 indexed citations
17.
Tomita, Etsuji, et al.. (1993). A Randomized Algorithm for Finding a Near-Maximum Clique and Its Experimental Evaluations. Transactions of the Institute of Electronics, Information and Communication Engineers. 76(2). 46–53.3 indexed citations
18.
Tomita, Etsuji, Akira Tanaka, & Haruhisa Takahashi. (1989). An Optimal Algorithm for Finding All the Cliques. 1989(98). 91–98.9 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.