C.C. Lindner
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
-
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- semigroups and automata theory
Papers in
-
- Finite Group Theory Research 25
- Limits and Structures in Graph Theory 13
-
- graph theory and CDMA systems 74
- Co-authors
- Chris A. Rodger (21 shared papers)Alex Da Rosa (8 shared papers)Dean G. Hoffman (11 shared papers)Douglas R. Stinson (5 shared papers)Kevin T. Phelps (5 shared papers)Elizabeth J. Billington (11 shared papers)Luc Teirlinck (1 shared paper)R. C. Mullin (4 shared papers)
- Journals
- Discrete Mathematics (24 papers)Journal of Combinatorial Designs (8 papers)European Journal of Combinatorics (7 papers)Aequationes Mathematicae (5 papers)Journal of Statistical Planning and Inference (5 papers)
- Partner nations
- United StatesCanadaAustralia
In The Last Decade
C.C. Lindner
74 papers receiving 654 citations
Peers
Comparison fields: 5 of 35
- Discrete Mathematics and Combinatorics 373
- Computational Theory and Mathematics 221
- Electrical and Electronic Engineering 687
- Geometry and Topology 86
- Artificial Intelligence 324
Countries citing papers authored by C.C. Lindner
This map shows the geographic impact of C.C. Lindner'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 C.C. Lindner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C.C. Lindner more than expected).
Fields of papers citing papers by C.C. Lindner
This network shows the impact of papers produced by C.C. Lindner. 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 C.C. Lindner. The network helps show where C.C. Lindner may publish in the future.
Co-authors
The 23 scholars most cited alongside C.C. Lindner, 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 84 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1975 | 69 | |
| 2 | 1989 | 53 | |
| 3 | 1984 | 45 | |
| 4 | 1991 | 23 | |
| 5 | 1988 | 22 | |
| 6 | 1980 | 21 | |
| 7 | 1992 | 20 | |
| 8 | 1990 | 19 | |
| 9 | 1983 | 19 | |
| 10 | 2008 | 18 | |
| 11 | 1992 | 17 | |
| 12 | 1978 | 17 | |
| 13 | 1975 | 16 | |
| 14 | 1989 | 15 | |
| 15 | 1981 | 15 | |
| 16 | 2002 | 14 | |
| 17 | 1988 | 13 | |
| 18 | 1987 | 12 | |
| 19 | 1993 | 12 | |
| 20 | 1971 | 12 |
About C.C. Lindner
C.C. Lindner is a scholar working on Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Geometry and Topology, Computational Theory and Mathematics and Artificial Intelligence, having authored 84 papers that have together received 723 indexed citations. Recurring topics across this work include graph theory and CDMA systems (74 papers), Coding theory and cryptography (31 papers), Finite Group Theory Research (25 papers), Mathematics and Applications (13 papers), Limits and Structures in Graph Theory (13 papers), Advanced Graph Theory Research (11 papers), Interconnection Networks and Systems (7 papers) and semigroups and automata theory (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (373 citations), Computational Theory and Mathematics (221 citations), Electrical and Electronic Engineering (687 citations), Geometry and Topology (86 citations) and Artificial Intelligence (324 citations). C.C. Lindner has collaborated with scholars based in United States, Canada and Australia. Frequent co-authors include Chris A. Rodger, Alex Da Rosa, Dean G. Hoffman, Douglas R. Stinson, Kevin T. Phelps, Elizabeth J. Billington, Luc Teirlinck, R. C. Mullin, Anne Street and W. D. Wallis. Their work appears in journals such as Discrete Mathematics, Journal of Combinatorial Designs, European Journal of Combinatorics, Aequationes Mathematicae and Journal of Statistical Planning and Inference.
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.