Countries citing papers authored by Charles C. Lindner
Since
Specialization
Citations
This map shows the geographic impact of Charles 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 Charles 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 Charles C. Lindner more than expected).
Fields of papers citing papers by Charles C. Lindner
This network shows the impact of papers produced by Charles 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 Charles C. Lindner. The network helps show where Charles C. Lindner may publish in the future.
Co-authorship network of co-authors of Charles C. Lindner
This figure shows the co-authorship network connecting the top 25 collaborators of Charles C. Lindner.
A scholar is included among the top collaborators of Charles 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 Charles C. Lindner. Charles 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, Charles C., et al.. (2013). Palettes in block colourings of designs.. Australas. J Comb.. 56. 235–244.1 indexed citations
2.
Lindner, Charles C., et al.. (2012). The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems.. Ars Combinatoria. 104. 337–351.1 indexed citations
3.
Billington, Elizabeth J., et al.. (2011). Almost resolvable minimum coverings of complete graphs with 4-cycles. Queensland's institutional digital repository (The University of Queensland). 50. 73–85.4 indexed citations
4.
Billington, Elizabeth J., et al.. (2011). The triangle intersection problem for nested Steiner triple systems. Queensland's institutional digital repository (The University of Queensland). 51. 221–233.
5.
Lindner, Charles C., et al.. (2005). The Triangle Intersection Problem for Kite Systems.. Ars Combinatoria. 75.6 indexed citations
Lindner, Charles C., et al.. (2005). Nesting kite and 4-cycle systems.. Australas. J Comb.. 33. 247–254.3 indexed citations
8.
Hoffman, D. G. & Charles C. Lindner. (2004). A partial K 4 -e-design of order n can be embedded in a K 4 -e-design of order at most 8n+16√n+82.. Australas. J Comb.. 29. 225–230.1 indexed citations
9.
Hoffman, Gary R., et al.. (2000). Coding Theory and Cryptography: The Essentials. CERN Bulletin.23 indexed citations
10.
Lindner, Charles C. & Alexander Rosa. (1999). Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations.. Australas. J Comb.. 20. 251–256.3 indexed citations
11.
Lindner, Charles C.. (1997). A small embedding for partial hexagon systems.. Australas. J Comb.. 16. 77–82.2 indexed citations
Adams, Peter D., Elizabeth J. Billington, & Charles C. Lindner. (1992). The spectrum for 3-perfect 9-cycle systems.. Australas. J Comb.. 5. 103–108.5 indexed citations
14.
Gionfriddo, Mario, Charles C. Lindner, & C. A. Rodger. (1991). 2-colouring K 4 -e designs.. Australas. J Comb.. 3. 211–230.6 indexed citations
15.
Lindner, Charles C., Eric Mendelsohn, & C. A. Rodger. (1991). The intersection problem for minimum coverings of K n by triples.. Australas. J Comb.. 4. 179–198.2 indexed citations
16.
Lindner, Charles C.. (1990). How to construct a block design with block size four admitting a blocking set.. Australas. J Comb.. 1. 101–126.3 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.