C.C. Lindner

1.0k total citations
76 papers, 613 citations indexed

About

C.C. Lindner is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, C.C. Lindner has authored 76 papers receiving a total of 613 indexed citations (citations by other indexed papers that have themselves been cited), including 68 papers in Electrical and Electronic Engineering, 34 papers in Discrete Mathematics and Combinatorics and 29 papers in Artificial Intelligence. Recurrent topics in C.C. Lindner's work include graph theory and CDMA systems (68 papers), Coding theory and cryptography (29 papers) and Finite Group Theory Research (24 papers). C.C. Lindner is often cited by papers focused on graph theory and CDMA systems (68 papers), Coding theory and cryptography (29 papers) and Finite Group Theory Research (24 papers). C.C. Lindner collaborates with scholars based in United States, Canada and Australia. C.C. Lindner's co-authors include C. A. Rodger, A. Rosa, Douglas R. Stinson, D. G. Hoffman, Kevin T. Phelps, Elizabeth J. Billington, Luc Teirlinck, R. C. Mullin, Anne Street and N. S. Mendelsohn and has published in prestigious journals such as SHILAP Revista de lepidopterología, Discrete Mathematics and Journal of the London Mathematical Society.

In The Last Decade

C.C. Lindner

65 papers receiving 544 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
C.C. Lindner United States 13 582 323 295 183 68 76 613
Luc Teirlinck United States 13 415 0.7× 215 0.7× 317 1.1× 109 0.6× 39 0.6× 21 462
F.E. Bennett Canada 14 519 0.9× 234 0.7× 382 1.3× 138 0.8× 49 0.7× 76 563
Rolf S. Rees Canada 15 705 1.2× 374 1.2× 541 1.8× 117 0.6× 26 0.4× 48 757
Katherine Heinrich Canada 12 277 0.5× 150 0.5× 131 0.4× 172 0.9× 45 0.7× 45 350
Jean Doyen Belgium 12 433 0.7× 365 1.1× 310 1.1× 111 0.6× 75 1.1× 23 548
Terry S. Griggs United Kingdom 13 471 0.8× 263 0.8× 183 0.6× 256 1.4× 84 1.2× 105 573
P. J. Schellenberg Canada 9 234 0.4× 159 0.5× 118 0.4× 91 0.5× 63 0.9× 14 311
Anton Kotzig Canada 11 282 0.5× 142 0.4× 88 0.3× 409 2.2× 103 1.5× 41 561
Mario Gionfriddo Italy 11 289 0.5× 164 0.5× 153 0.5× 116 0.6× 29 0.4× 67 334
Marco Buratti Italy 20 1.3k 2.3× 582 1.8× 1.0k 3.4× 304 1.7× 72 1.1× 96 1.4k

Countries citing papers authored by C.C. Lindner

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of C.C. Lindner

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

All Works

20 of 20 papers shown
1.
Lindner, C.C., et al.. (2011). Triple metamorphosis of twofold triple systems. Discrete Mathematics. 313(19). 1872–1883. 1 indexed citations
2.
Billington, Elizabeth J., et al.. (2009). Embedding 4-cycle systems into octagon triple systems. Queensland's institutional digital repository (The University of Queensland). 79. 99–106. 2 indexed citations
3.
Lindner, C.C., et al.. (2008). Embedding Steiner triple systems in hexagon triple systems. Discrete Mathematics. 309(2). 487–490. 7 indexed citations
4.
Billington, Elizabeth J., et al.. (2007). The triangle intersection problem for K4 - e designs. Queensland's institutional digital repository (The University of Queensland). 73. 3–21. 5 indexed citations
5.
Lindner, C.C. & A. Rosa. (2007). Perfect dexagon triple systems. Discrete Mathematics. 308(2-3). 214–219. 11 indexed citations
6.
Billington, Elizabeth J. & C.C. Lindner. (2006). Perfect triple configurations from subgraphs of K4 : the remaining cases. International Journal of Emergency Medicine. 47(4). 77–90.
7.
Lindner, C.C., et al.. (2006). A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9.. Ars Combinatoria. 79. 1 indexed citations
8.
Hoffman, D. G., C.C. Lindner, & C. A. Rodger. (2003). A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k),k⩾3, where c(k) is a quadratic function of k. Discrete Mathematics. 261(1-3). 325–336. 5 indexed citations
9.
Lindner, C.C., et al.. (2003). Perfect hexagon triple systems. Discrete Mathematics. 279(1-3). 325–335. 12 indexed citations
10.
Fu, Hung‐Lin, C.C. Lindner, & C. A. Rodger. (1998). Two Doyen-Wilson theorems for maximum packings with triples. Discrete Mathematics. 178(1-3). 63–71. 4 indexed citations
11.
Lindner, C.C. & C. A. Rodger. (1994). On equationally defining m‐perfect 2m + 1 cycle systems. Journal of Combinatorial Designs. 2(5). 301–309. 2 indexed citations
12.
Lindner, C.C. & C. A. Rodger. (1992). 2-perfect m-cycle systems. Discrete Mathematics. 104(1). 83–90. 20 indexed citations
13.
Billington, Elizabeth J. & C.C. Lindner. (1992). The spectrum for lambda-fold 2-perfect 6-cycle systems. European Journal of Combinatorics. 13(1). 5–14. 9 indexed citations
14.
Lindner, C.C., et al.. (1992). Further results on large sets of disjoint group-divisible designs. Discrete Mathematics. 110(1-3). 35–42. 17 indexed citations
15.
Lindner, C.C.. (1990). Graph decomposition and quasigroup identities. SHILAP Revista de lepidopterología. 5 indexed citations
16.
Hoffman, D. G., C.C. Lindner, & Kevin T. Phelps. (1990). Blocking Sets in Designs with Block Size 4. European Journal of Combinatorics. 11(5). 451–457. 19 indexed citations
17.
Teirlinck, Luc & C.C. Lindner. (1988). The Construction of Large Sets of Idempotent Quasigroups. European Journal of Combinatorics. 9(1). 83–89. 19 indexed citations
18.
Lindner, C.C. & Douglas R. Stinson. (1984). Steiner pentagon systems. Discrete Mathematics. 52(1). 67–74. 42 indexed citations
19.
Lindner, C.C. & Anne Street. (1983). Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems. European Journal of Combinatorics. 4(4). 335–346. 7 indexed citations
20.
Hoffman, D. G. & C.C. Lindner. (1982). Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common. European Journal of Combinatorics. 3(1). 51–61. 4 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

Rankless by CCL
2026