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
- Graph Labeling and Dimension Problems 2
-
- VLSI and FPGA Design Techniques 3
- graph theory and CDMA systems 3
- Co-authors
- Gordon J. Savage (1 shared paper)Tsunehiko Kameda (3 shared papers)Chun L. Kwan (1 shared paper)Nageswara S. V. Rao (3 shared papers)Stephan Olariu (1 shared paper)Tiko Kameda (1 shared paper)Irwin B. Levinstein (1 shared paper)Mohammad Zubair (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 States
In The Last Decade
S. Toida
18 papers receiving 732 citations
Hit Papers
Peers
Comparison fields: 5 of 67
- Geometry and Topology 463
- Discrete Mathematics and Combinatorics 119
- Computational Theory and Mathematics 355
- Hardware and Architecture 87
- 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 9 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
| # | Work | ||
|---|---|---|---|
| 1 | Spectra of graphs: theory and application Hit paper breakdown → | 1981 | 588 |
| 2 | 1975 | 59 | |
| 3 | 1975 | 42 | |
| 4 | 1982 | 23 | |
| 5 | 1977 | 17 | |
| 6 | 1973 | 11 | |
| 7 | 1973 | 6 | |
| 8 | 1973 | 5 | |
| 9 | 1974 | 4 | |
| 10 | 2005 | 3 | |
| 11 | Paraphrasing Recognition through Conceptual Graph | 2003 | 2 |
| 12 | 1985 | 2 | |
| 13 | 1988 | 2 | |
| 14 | Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) | 1973 | 1 |
| 15 | 2002 | 1 | |
| 16 | 2002 | 1 | |
| 17 | 1994 | 1 | |
| 18 | 1973 | 1 |
About S. Toida
S. Toida is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology, Hardware and Architecture and Computer Networks and Communications, having authored 18 papers that have together received 769 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (7 papers), Graph theory and applications (6 papers), Interconnection Networks and Systems (5 papers), VLSI and Analog Circuit Testing (5 papers), VLSI and FPGA Design Techniques (3 papers), graph theory and CDMA systems (3 papers), Formal Methods in Verification (3 papers) and Graph Labeling and Dimension Problems (2 papers). The work is most often cited by research in Geometry and Topology (463 citations), Discrete Mathematics and Combinatorics (119 citations), Computational Theory and Mathematics (355 citations), Hardware and Architecture (87 citations) and Computational Mathematics (7 citations). S. Toida has collaborated with scholars based in Canada and United States. Frequent co-authors include Gordon J. Savage, Tsunehiko Kameda, Chun L. Kwan, Nageswara S. V. Rao, Stephan Olariu, Tiko Kameda, Irwin B. Levinstein, Mohammad Zubair and Chutima Boonthum. 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.