S. Toida
Impact in
- Geometry and Topology top 1%
- Graph theory and applications
-
- Finite Group Theory Research
Papers in
-
- Advanced Graph Theory Research 7
- Formal Methods in Verification 3
-
- VLSI and FPGA Design Techniques 3
- graph theory and CDMA systems 3
- Co-authors
- Gordon J. Savage (1 shared paper)Tsunehiko Kameda (4 shared papers)Chun L. Kwan (1 shared paper)Nageswara S. V. Rao (4 shared papers)Chutima Boonthum (2 shared papers)Irwin B. Levinstein (2 shared papers)Toshihide Ibaraki (1 shared paper)Tiko Kameda (1 shared paper)
- Journals
- Journal of the Franklin Institute (3 papers)Journal of Combinatorial Theory Series B (2 papers)IEEE Transactions on Computers (2 papers)Journal of Algorithms (1 paper)Networks (1 paper)
- Partner nations
- CanadaUnited StatesJapan
In The Last Decade
S. Toida
20 papers receiving 786 citations
S. Toida's Hit Papers
Peers
Comparison fields: 5 of 69
- Geometry and Topology 490
- Discrete Mathematics and Combinatorics 125
- Computational Theory and Mathematics 391
- Hardware and Architecture 94
- Computational Mathematics 7
Countries citing papers authored by S. Toida
This map shows the geographic impact of S. Toida'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 S. Toida with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Toida more than expected).
Fields of papers citing papers by S. Toida
This network shows the impact of papers produced by S. Toida. 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 S. Toida. The network helps show where S. Toida may publish in the future.
Co-authors
The 10 scholars most cited alongside S. Toida, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 21 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Spectra of graphs: theory and application Hit paper breakdown → | 1981 | 619 |
| 2 | 1975 | 60 | |
| 3 | 1975 | 43 | |
| 4 | 1982 | 24 | |
| 5 | 1977 | 21 | |
| 6 | 1973 | 14 | |
| 7 | 1974 | 6 | |
| 8 | 1973 | 6 | |
| 9 | 2006 | 5 | |
| 10 | 1973 | 5 | |
| 11 | 1981 | 4 | |
| 12 | 1988 | 3 | |
| 13 | 2005 | 3 | |
| 14 | 1985 | 3 | |
| 15 | Paraphrasing Recognition through Conceptual Graph | 2003 | 2 |
| 16 | 1994 | 2 | |
| 17 | Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) | 1973 | 1 |
| 18 | 2002 | 1 | |
| 19 | 1973 | 1 | |
| 20 | 2002 | 1 |
About S. Toida
S. Toida is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Hardware and Architecture, Computer Networks and Communications and Geometry and Topology, having authored 21 papers that have together received 824 indexed citations. Recurring topics across this work include VLSI and Analog Circuit Testing (7 papers), Advanced Graph Theory Research (7 papers), Graph theory and applications (6 papers), Interconnection Networks and Systems (6 papers), VLSI and FPGA Design Techniques (3 papers), Graph Theory and Algorithms (3 papers), Formal Methods in Verification (3 papers) and graph theory and CDMA systems (3 papers). The work is most often cited by research in Geometry and Topology (490 citations), Discrete Mathematics and Combinatorics (125 citations), Computational Theory and Mathematics (391 citations), Hardware and Architecture (94 citations) and Computational Mathematics (7 citations). S. Toida has collaborated with scholars based in Canada, United States and Japan. Frequent co-authors include Gordon J. Savage, Tsunehiko Kameda, Chun L. Kwan, Nageswara S. V. Rao, Chutima Boonthum, Irwin B. Levinstein, Toshihide Ibaraki, Tiko Kameda, Mohammad Zubair and Stephan Olariu. Their work appears in journals such as Journal of the Franklin Institute, Journal of Combinatorial Theory Series B, IEEE Transactions on Computers, Journal of Algorithms and Networks.
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.