Charles J. Colbourn
About
In The Last Decade
Charles J. Colbourn
357 papers receiving 9.0k citations
Hit Papers
Peers
Comparison fields: 5 of 146
- Electrical and Electronic Engineering 4.2k
- Artificial Intelligence 2.8k
- Computer Networks and Communications 2.5k
- Computational Theory and Mathematics 2.3k
- Software 2.3k
Countries citing papers authored by Charles J. Colbourn
This map shows the geographic impact of Charles J. Colbourn'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 Charles J. Colbourn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Charles J. Colbourn more than expected).
Fields of papers citing papers by Charles J. Colbourn
This network shows the impact of papers produced by Charles J. Colbourn. 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 Charles J. Colbourn. The network helps show where Charles J. Colbourn may publish in the future.
Co-authorship network of co-authors of Charles J. Colbourn
This figure shows the co-authorship network connecting the top 25 collaborators of Charles J. Colbourn. A scholar is included among the top collaborators of Charles J. Colbourn 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 Charles J. Colbourn. Charles J. Colbourn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | On a latin square problem of fuchs | 1 |
| 4 | 3 | |
| 5 | Expected time to detection of interaction faults | 4 |
| 6 | 6 | |
| 7 | Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications) | 15 |
| 8 | 24 | |
| 9 | 214 | |
| 10 | NS1D0 Sequences and Anti-Pasch Steiner Triple Systems | 1 |
| 11 | Generating sets in Steiner triple systems | 1 |
| 12 | Balanced sampling plans with block size four excluding contiguous units | 18 |
| 13 | 2 | |
| 14 | Orthogonal resolutions of triple systems. | 4 |
| 15 | Existence of six incomplete MOLS. | 2 |
| 16 | The fine structure of threefold triple systems: v≡5(mod 6). | 4 |
| 17 | Supports of (ν,4,2) designs | 1 |
| 18 | Large Sets of Disjoint t-Designs | 10 |
| 19 | The Combinatorics of Network Reliability breakdown → | 817 |
| 20 | Algorithms in combinatorial design theory | 8 |
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.