default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharles C. Lindner
Charles Curtis Lindner – Curt Lindner
Person information
- affiliation: Auburn University, Department of Discrete and Statistical Sciences, AL, USA
- award (2013): Euler Medal
SPARQL queries 
🛈 Please note that only 71% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[j90]Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan, Emine Sule Yazici:
Maximum packings of inside perfect 8-cycle systems. Australas. J Comb. 75: 146-157 (2019)- 2017
- [j89]Charles C. Lindner, Christopher A. Rodger, Mariusz Meszka:
Revisiting the intersection problem for minimum coverings of complete graphs with triples. Australas. J Comb. 68: 276-284 (2017) - 2016
- [j88]Curt Lindner, Giovanni Lo Faro, Antoinette Tripodi:
Squashing maximum packings of 6-cycles into maximum packings of triples. Ars Math. Contemp. 10(1): 19-29 (2016) - 2015
- [j87]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Almost 2-perfect 6-cycle systems. Des. Codes Cryptogr. 77(2-3): 321-333 (2015) - [j86]Fatih Demirkale
, Diane M. Donovan, Charles Curtis Lindner:
Intersection Problem for Simple 2-fold (3n, n, 3) Group Divisible Designs. Graphs Comb. 31(3): 537-545 (2015) - 2013
- [j85]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Palettes in block colourings of designs. Australas. J Comb. 56: 235-244 (2013) - [j84]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Triple metamorphosis of twofold triple systems. Discret. Math. 313(19): 1872-1883 (2013) - [j83]Fatih Demirkale, Diane M. Donovan, Charles Curtis Lindner:
Simple 2-fold (3n, n, 3)(3n, n, 3) group divisible designs having a prescribed number of triples in common. Electron. Notes Discret. Math. 40: 107-111 (2013) - 2012
- [j82]Selda Küçükçifçi, Emine Sule Yazici, Charles Curtis Lindner:
The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems. Ars Comb. 104: 81-96 (2012) - [j81]Selda Küçükçifçi, Emine Sule Yazici, Curt Lindner:
The full metamorphosis of λ-fold block designs with block size four into λ-fold triple systems. Ars Comb. 106: 337-351 (2012) - [j80]Charles C. Lindner, Alexander Rosa:
Extra two-fold Steiner pentagon systems. Discret. Math. 312(1): 30-34 (2012) - 2011
- [j79]Elizabeth J. Billington, Dean G. Hoffman, Charles C. Lindner, Mariusz Meszka:
Almost resolvable minimum coverings of complete graphs with 4-cycles. Australas. J Comb. 50: 73-86 (2011) - [j78]Elizabeth J. Billington, Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Charles C. Lindner:
The triangle intersection problem for nested Steiner triple systems. Australas. J Comb. 51: 221-234 (2011) - [j77]Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner:
Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs Comb. 27(2): 161-170 (2011) - 2010
- [j76]Peter Adams, Elizabeth J. Billington, Dean G. Hoffman, Charles Curtis Lindner:
The generalized almost resolvable cycle system problem. Comb. 30(6): 617-625 (2010)
2000 – 2009
- 2009
- [j75]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
On (K4, K4-e)-Designs. Ars Comb. 93 (2009) - [j74]Charles Curtis Lindner, Gaetano Quattrocchi, Christopher A. Rodger:
Embedding Steiner triple systems in hexagon triple systems. Discret. Math. 309(2): 487-490 (2009) - [j73]Elizabeth J. Billington, Charles Curtis Lindner:
Embedding 5-cycle systems into pentagon triple systems. Discret. Math. 309(14): 4828-4834 (2009) - [j72]Selda Küçükçifçi, Curt Lindner, Gaetano Quattrocchi:
Embeddings of P3-designs into bowtie and almost bowtie systems. Discret. Math. 309(18): 5675-5677 (2009) - 2008
- [j71]Mario Gionfriddo, Curt Lindner, Guglielmo Lunardon, Alexander Rosa:
Preface. Discret. Math. 308(2-3): 153 (2008) - [j70]Charles Curtis Lindner, Alexander Rosa:
Perfect dexagon triple systems. Discret. Math. 308(2-3): 214-219 (2008) - 2006
- [j69]Selda Küçükçifçi, Curt Lindner, Christopher A. Rodger:
A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9. Ars Comb. 79 (2006) - 2005
- [j68]Elizabeth J. Billington, Charles C. Lindner, Alexander Rosa:
Lambda-fold complete graph decompositions into perfect four-triple configurations. Australas. J Comb. 32: 323-330 (2005) - [j67]Lucia Gionfriddo, Charles C. Lindner:
Nesting kite and 4-cycle systems. Australas. J Comb. 33: 247-254 (2005) - [j66]Charles C. Lindner, Antoinette Tripodi:
The Metamorphosis of K4\e Designs Into Maximum Packings Of Kn With 4-Cycles. Ars Comb. 75 (2005) - [j65]Charles Curtis Lindner, Emine Sule Yazici:
The Triangle Intersection Problem for Kite Systems. Ars Comb. 75 (2005) - 2004
- [j64]D. G. Hoffman, Charles C. Lindner:
A partial K4-e-design of order n can be embedded in a K4-e-design of order at most 8n+16√n+82. Australas. J Comb. 29: 225-230 (2004) - [j63]Selda Küçükçifçi, Charles C. Lindner:
Minimum Covering for Hexagon Triple Systems. Des. Codes Cryptogr. 32(1-3): 251-265 (2004) - [j62]Selda Küçükçifçi, Charles C. Lindner, Alexander Rosa:
The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles. Discret. Math. 278(1-3): 175-193 (2004) - [j61]Selda Küçükçifçi, Charles C. Lindner:
Perfect hexagon triple systems. Discret. Math. 279(1-3): 325-335 (2004) - 2003
- [j60]Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k), kgeq3, where c(k) is a quadratic function of k. Discret. Math. 261(1-3): 325-336 (2003) - [j59]Charles Curtis Lindner, Christopher A. Rodger:
A connection between varieties of quasigroups and graph decompositions. Discret. Math. 272(2-3): 127-137 (2003) - [j58]Charles Curtis Lindner:
A Small Embedding for Partial 4-Cycle Systems when the Leave is Small. J. Autom. Lang. Comb. 8(4): 659-662 (2003) - 2002
- [j57]Charles C. Lindner:
A new small embedding for partial 8-cycle systems. Australas. J Comb. 25: 69-72 (2002) - [j56]Charles Curtis Lindner, Lorenzo Milazzo:
Embedding partial bipartite directed cycle systems. Discret. Math. 244(1-3): 269-278 (2002) - [j55]Frantisek Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa:
Completing the spectrum of 2-chromatic S(2, 4, v). Discret. Math. 247(1-3): 225-228 (2002) - 2000
- [j54]Peter Adams, Elizabeth J. Billington, Italo J. Dejter, Charles Curtis Lindner:
The number of 4-cycles in 2-factorizations of K2n minus a 1-factor. Discret. Math. 220(1-3): 1-11 (2000)
1990 – 1999
- 1999
- [j53]Charles C. Lindner, Maria Flavia Mammana:
A small embedding for large directed even cycle systems. Australas. J Comb. 20: 223-232 (1999) - [j52]Charles C. Lindner, Alexander Rosa:
Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations. Australas. J Comb. 20: 251-256 (1999) - 1998
- [j51]Maria Flavia Mammana, Charles C. Lindner:
A small embedding for partial directed 6k-cycle systems. Australas. J Comb. 18: 183-192 (1998) - [j50]H. L. Fu, Charles C. Lindner, C. A. Rodger:
Two Doyen-Wilson theorems for maximum packings with triples. Discret. Math. 178(1-3): 63-71 (1998) - [j49]H. L. Fu, Charles C. Lindner:
The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles. Discret. Math. 183(1-3): 103-117 (1998) - 1997
- [j48]Charles C. Lindner:
A small embedding for partial hexagon systems. Australas. J Comb. 16: 77-82 (1997) - [j47]Charles C. Lindner, Christopher A. Rodger:
On equationally defining extended cycle systems, . Discret. Math. 173(1-3): 1-14 (1997) - 1995
- [j46]Charles C. Lindner, C. A. Rodger:
Blocking set preserving embeddings of partial K4, -, e designs. Australas. J Comb. 12: 121-126 (1995) - 1994
- [j45]Elizabeth J. Billington, Charles Curtis Lindner:
The spectrum for 2-perfect bowtie systems. Discret. Math. 135(1-3): 61-68 (1994) - 1993
- [j44]Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
Corrigendum: The spectrum for 3-perfect 9-cycle systems. Australas. J Comb. 8: 277-278 (1993) - [j43]Charles C. Lindner, C. A. Rodger:
A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m. Discret. Math. 117(1-3): 151-159 (1993) - 1992
- [j42]Peter Adams, Elizabeth J. Billington, Charles C. Lindner:
The spectrum for 3-perfect 9-cycle systems. Australas. J Comb. 5: 103-108 (1992) - [j41]Charles C. Lindner, C. A. Rodger:
2-perfect m-cycle systems. Discret. Math. 104(1): 83-90 (1992) - [j40]D. Chen, Charles C. Lindner, Douglas R. Stinson:
Further results on large sets of disjoint group-divisible designs. Discret. Math. 110(1-3): 35-42 (1992) - [j39]Elizabeth J. Billington, Charles C. Lindner:
The spectrum for lambda-fold 2-perfect 6-cycle systems. Eur. J. Comb. 13(1): 5-14 (1992) - [j38]Charles J. Colbourn, Charles C. Lindner:
Support Sizes of Triple Systems. J. Comb. Theory A 61(2): 193-210 (1992) - 1991
- [j37]Mario Gionfriddo, Charles C. Lindner, C. A. Rodger:
2-colouring K4-e designs. Australas. J Comb. 3: 211-230 (1991) - [j36]Charles C. Lindner, Eric Mendelsohn, C. A. Rodger:
The intersection problem for minimum coverings of Kn by triples. Australas. J Comb. 4: 179-198 (1991) - [j35]Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps:
Blocking sets in designs with block size four II. Discret. Math. 89(3): 221-229 (1991) - [j34]Charles Curtis Lindner, Kevin T. Phelps, Christopher A. Rodger:
The spectrum for 2-perfect 6-cycle systems. J. Comb. Theory A 57(1): 76-85 (1991) - 1990
- [j33]Charles C. Lindner:
How to construct a block design with block size four admitting a blocking set. Australas. J Comb. 1: 101-126 (1990) - [j32]Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Small embeddings for partial cycle systems of odd length. Discret. Math. 80(3): 273-280 (1990) - [j31]Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps:
Blocking Sets in Designs with Block Size 4. Eur. J. Comb. 11(5): 451-457 (1990)
1980 – 1989
- 1989
- [j30]Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Nesting of cycle systems of odd length. Discret. Math. 77(1-3): 191-203 (1989) - [j29]Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
On the construction of odd cycle systems. J. Graph Theory 13(4): 417-426 (1989) - 1988
- [j28]Luc Teirlinck, Charles C. Lindner:
The Construction of Large Sets of Idempotent Quasigroups. Eur. J. Comb. 9(1): 83-89 (1988) - [j27]Charles C. Lindner, Christopher A. Rodger:
Nesting and Almost Resolvability of Pentagon Systems. Eur. J. Comb. 9(5): 483-493 (1988) - [j26]Katherine Heinrich, Charles Curtis Lindner, Christopher A. Rodger:
Almost resolvable decompositions of 2Kn into cycles of odd length. J. Comb. Theory A 49(2): 218-232 (1988) - 1987
- [j25]Charles C. Lindner:
Construction of large sets of pairwise disjoint transitive triple systems II. Discret. Math. 65(1): 65-74 (1987) - 1984
- [j24]Charles C. Lindner, Douglas R. Stinson:
Steiner pentagon systems. Discret. Math. 52(1): 67-74 (1984) - [j23]Kevin T. Phelps, Charles C. Lindner:
On the Number of Mendelsohn and Transitive Triple Systems. Eur. J. Comb. 5(3): 239-242 (1984) - 1983
- [j22]Charles C. Lindner, Anne Penfold Street:
Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems. Eur. J. Comb. 4(4): 335-346 (1983) - 1982
- [j21]Dean G. Hoffman, Charles C. Lindner:
Mendelsohn Triple Systems Having a Prescribed Number of Triples in Common. Eur. J. Comb. 3(1): 51-61 (1982) - 1981
- [j20]Mario Gionfriddo, Charles C. Lindner:
Construction of Steiner quadruple systems having a prescribed number of blocks in common. Discret. Math. 34(1): 31-42 (1981) - [j19]Charles C. Lindner:
On the Number of Disjoint Mendelsohn Triple Systems. J. Comb. Theory A 30(3): 326-330 (1981) - 1980
- [j18]Charles C. Lindner, N. S. Mendelsohn, S. R. Sun:
On the construction of Schroeder quasigroups. Discret. Math. 32(3): 271-280 (1980)
1970 – 1979
- 1979
- [j17]Ronald C. Mullin, Charles Curtis Lindner:
Lower Bounds for Maximal Partial Parallel Classes in Steiner Systems. J. Comb. Theory A 26(3): 314-318 (1979) - [j16]Charles C. Lindner, Eric Mendelsohn, Nathan Saul Mendelsohn, Barry Wolk:
Orthogonal latin square graphs. J. Graph Theory 3(4): 325-338 (1979) - 1978
- [j15]Charles C. Lindner, Alexander Rosa:
Steiner quadruple systems - a survey. Discret. Math. 22(2): 147-181 (1978) - [j14]Charles C. Lindner, Kevin T. Phelps:
A Note on Partial Parallel Classes in Steiner Systems. Discret. Math. 24(1): 109-112 (1978) - 1977
- [j13]Charles C. Lindner, Eric Mendelsohn:
On the conjugates of an n2 × 4 orthogonal array. Discret. Math. 20: 123-132 (1977) - [j12]Charles C. Lindner, Alexander Rosa:
A Partial Room Square Can be Embedded in a Room Square. J. Comb. Theory A 22(1): 97-102 (1977) - 1976
- [j11]Charles C. Lindner:
Two finite embedding theorems for partial 3-quasigroups. Discret. Math. 16(3): 271-277 (1976) - [j10]Charles C. Lindner, Alexander Rosa:
Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic. J. Comb. Theory A 21(1): 35-43 (1976) - [j9]Charles C. Lindner:
A Finite Partial Idempotent Latin Cube Can Be Embedded in a Finite Idempotent Latin Cube. J. Comb. Theory A 21(1): 104-109 (1976) - 1975
- [j8]Charles C. Lindner, Alexander Rosa:
Finite embedding theorems for partial Steiner triple systems. Discret. Math. 13(1): 31-39 (1975) - [j7]Charles C. Lindner:
Disjoint Finite Partial Steiner Triple Systems Can Be Embedded in Disjoint Finite Steiner Triple Systems. J. Comb. Theory A 18(1): 126-129 (1975) - [j6]Charles C. Lindner:
A Partial Steiner Triple System of Order n Can Be Embedded in a Steiner Triple System of Order 6n + 3. J. Comb. Theory A 18(3): 349-351 (1975) - 1974
- [j5]Charles C. Lindner:
Construction of nonisomorphic reverse steiner quasigroups. Discret. Math. 7(3-4): 281-288 (1974) - [j4]Charles C. Lindner:
A Simple Construction of Disjoint and Almost Disjoint Steiner Triple Systems. J. Comb. Theory A 17(2): 204-209 (1974) - 1973
- [j3]Charles C. Lindner:
Construction of doubly diagonalized orthogonal latin squares. Discret. Math. 5(1): 79-86 (1973) - [j2]Charles C. Lindner:
On the construction of cyclic quasigroups. Discret. Math. 6(2): 149-158 (1973) - 1972
- [j1]Charles C. Lindner:
Finite Embedding Theorems for Partial Latin Squares, Quasi-groups, and Loops. J. Comb. Theory A 13(3): 339-345 (1972)
Coauthor Index
Christopher A. Rodger
aka: C. A. Rodger
aka: C. A. Rodger
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
