S. Toida

1.0k total citations · 1 hit paper
18 papers, 769 citations indexed

About

S. Toida is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Geometry and Topology. According to data from OpenAlex, S. Toida has authored 18 papers receiving a total of 769 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 9 papers in Electrical and Electronic Engineering and 6 papers in Geometry and Topology. Recurrent topics in S. Toida's work include Advanced Graph Theory Research (7 papers), Graph theory and applications (6 papers) and Interconnection Networks and Systems (5 papers). S. Toida is often cited by papers focused on Advanced Graph Theory Research (7 papers), Graph theory and applications (6 papers) and Interconnection Networks and Systems (5 papers). S. Toida collaborates with scholars based in Canada and United States. S. Toida's co-authors include Gordon J. Savage, Tsunehiko Kameda, Chun L. Kwan, Nageswara S. V. Rao, Chutima Boonthum, Stephan Olariu, Mohammad Zubair, Irwin B. Levinstein and Tiko Kameda and has published in prestigious journals such as Journal of the Franklin Institute, IEEE Transactions on Computers and Networks.

In The Last Decade

S. Toida

18 papers receiving 732 citations

Hit Papers

align trajectories

What are hit papers?

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.

Spectra of graphs: theory and application

1981 588 citations Gordon J. Savage, S. Toida Journal of the Franklin Institute profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
S. Toida Canada	7	463	355	208	167	119	18	769
Wendy Myrvold Canada	16	181 0.4×	291 0.8×	138 0.7×	110 0.7×	99 0.8×	52	789
R. C. Entringer United States	17	1.2k 2.6×	1.2k 3.4×	465 2.2×	166 1.0×	348 2.9×	52	1.6k
Huiqiu Lin China	17	823 1.8×	647 1.8×	215 1.0×	133 0.8×	269 2.3×	93	943
Igor Milovanović Serbia	11	387 0.8×	333 0.9×	199 1.0×	91 0.5×	30 0.3×	102	542
Jack E. Graver United States	15	278 0.6×	362 1.0×	123 0.6×	73 0.4×	256 2.2×	48	789
Jiang Zhou China	15	334 0.7×	413 1.2×	113 0.5×	30 0.2×	51 0.4×	128	810
Shenggui Zhang China	15	392 0.8×	592 1.7×	106 0.5×	128 0.8×	245 2.1×	126	872
Yousef Alavi United States	12	327 0.7×	764 2.2×	30 0.1×	231 1.4×	317 2.7×	27	1.0k
Dong Ye China	13	198 0.4×	223 0.6×	169 0.8×	60 0.4×	53 0.4×	58	503
Peter Dankelmann South Africa	19	705 1.5×	837 2.4×	162 0.8×	354 2.1×	133 1.1×	95	1.0k

Countries citing papers authored by S. Toida

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of S. Toida

This figure shows the co-authorship network connecting the top 25 collaborators of S. Toida. A scholar is included among the top collaborators of S. Toida 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 S. Toida. S. Toida is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

1.

Rao, Nageswara S. V. & S. Toida. (2005). Computational Complexity of Test-Point Insertions and Decompositions. 233–238. 3 indexed citations

2.

Boonthum, Chutima, S. Toida, & Irwin B. Levinstein. (2003). Paraphrasing Recognition through Conceptual Graph. 2 indexed citations

3.

Rao, Nageswara S. V. & S. Toida. (2002). On polynomial-time testable classes of combinational circuits. 172–177. 1 indexed citations

4.

Toida, S.. (2002). Revisiting shift register realization for ease of test generation and testing. c 22. 151–153. 1 indexed citations

5.

Rao, Nageswara S. V. & S. Toida. (1994). On polynomial-time testable combinational circuits. IEEE Transactions on Computers. 43(11). 1298–1308. 1 indexed citations

6.

Olariu, Stephan, S. Toida, & Mohammad Zubair. (1988). On a conjecture by Plaisted and Hong. Journal of Algorithms. 9(4). 597–598. 2 indexed citations

7.

Toida, S.. (1985). A decomposition of a graph into dense subgraphs. IEEE Transactions on Circuits and Systems. 32(6). 583–589. 2 indexed citations

8.

Kwan, Chun L. & S. Toida. (1982). An optimal 2‐FT realization of binary symmetric hierarchical tree systems. Networks. 12(3). 231–239. 23 indexed citations

9.

Savage, Gordon J. & S. Toida. (1981). Spectra of graphs: theory and application. Journal of the Franklin Institute. 311(6). 403–403. 588 indexed citations breakdown →

10.

Toida, S.. (1977). A note on Ádám's conjecture∗∗This work was supported in part by the National Research Council of Canada under Grant A7396.. Journal of Combinatorial Theory Series B. 23(2-3). 239–246. 17 indexed citations

11.

Kameda, Tsunehiko, et al.. (1975). An Approach to the Diagnosability Analysis of a System. IEEE Transactions on Computers. C-24(10). 1040–1042. 42 indexed citations

12.

Kameda, Tsunehiko, et al.. (1975). A diagnosing algorithm for networks. Information and Control. 29(2). 141–148. 59 indexed citations

13.

Toida, S.. (1974). Construction of quartic graphs. Journal of Combinatorial Theory Series B. 16(2). 124–133. 4 indexed citations

14.

Kameda, Tiko & S. Toida. (1973). Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract). 12–15. 1 indexed citations

15.

Kameda, Tsunehiko & S. Toida. (1973). Efficient algorithms for determining an extremal tree of a graph. 12–15. 6 indexed citations

16.

Toida, S.. (1973). Properties of a Euler graph. Journal of the Franklin Institute. 295(4). 343–345. 11 indexed citations

17.

Toida, S.. (1973). Properties of a planar cubic graph. Journal of the Franklin Institute. 295(2). 165–174. 5 indexed citations

18.

Toida, S.. (1973). Generation of all Cutsets of a Bipath Network. IRE Transactions on Communications Systems. 21(12). 1414–1417. 1 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.

Explore authors with similar magnitude of impact