Countries citing papers authored by Setsuo Arikawa
Since
Specialization
Citations
This map shows the geographic impact of Setsuo Arikawa'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 Setsuo Arikawa with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Setsuo Arikawa more than expected).
This network shows the impact of papers produced by Setsuo Arikawa. 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 Setsuo Arikawa. The network helps show where Setsuo Arikawa may publish in the future.
Co-authorship network of co-authors of Setsuo Arikawa
This figure shows the co-authorship network connecting the top 25 collaborators of Setsuo Arikawa.
A scholar is included among the top collaborators of Setsuo Arikawa 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 Setsuo Arikawa. Setsuo Arikawa is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hirata, Kouichi, et al.. (2003). Criteria for inductive inference with mind changes and anomalies of recursive real-valued functions. IEICE Transactions on Information and Systems. 86(2). 219–227.2 indexed citations
Abe, K., et al.. (2002). Optimized Substructure Discovery for Semi-structured Data. Kyushu University Institutional Repository (QIR) (Kyushu University).1 indexed citations
5.
Baba, Kensuke, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, & Setsuo Arikawa. (2002). A Note on Randomized Algorithm for String Matching with Mismatches. Kyushu University Institutional Repository (QIR) (Kyushu University). 10(1). 2–12.4 indexed citations
6.
Arikawa, Setsuo & Ayumi Shinohara. (2002). Progress in Discovery Science, Final Report of the Japanese Discovery Science Project.5 indexed citations
7.
Arimura, Hiroki, et al.. (2001). Efficient Substring Traversal with Suffix Arrays. Kyushu University Institutional Repository (QIR) (Kyushu University).2 indexed citations
8.
Takeda, Masayuki, Yusuke Shibata, Tetsuya Matsumoto, et al.. (2001). Speeding Up String Pattern Matching by Text Compression: The Dawn of a New Era. 42(3). 370–384.10 indexed citations
9.
Arimura, Hiroki, et al.. (2001). Efficient Discovery of Proximity Patterns with Suffix Arrays. 152–156.4 indexed citations
10.
Inenaga, Shunsuke, et al.. (2001). Construction of the CDAWG for a Trie.. 37–48.7 indexed citations
Asai, Tatsuya, et al.. (2001). Efficient Substructure Discovery from Large Semi-Structured Data. IEICE Transactions on Information and Systems. 101(12). 1–2763.18 indexed citations
13.
Matsumoto, Tsubasa, et al.. (2000). Compressed Pattern Matching for SEQUITUR. Kyushu University Institutional Repository (QIR) (Kyushu University).1 indexed citations
14.
Arimura, Hiroki, et al.. (1998). A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. Kyushu University Institutional Repository (QIR) (Kyushu University).
15.
Kasai, Toru, et al.. (1998). Text Data Mining Based on Optimal Pattern Discovery : Towards a Scalable Data Mining System for Large Text Databases. IPSJ SIG Notes. 98(57). 151–156.3 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.