The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Charles C. Lindner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charles C. Lindner, Antoinette Tripodi
    The Metamorphosis of K4\e Designs Into Maximum Packings Of Kn With 4-Cycles. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  2. Selda Küçükçifçi, Charles C. Lindner
    Minimum Covering for Hexagon Triple Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:32, n:1-3, pp:251-265 [Journal]
  3. F. Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa
    Completing the spectrum of 2-chromatic S(2, 4, v). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:225-228 [Journal]
  4. Selda Küçükçifçi, Charles C. Lindner
    Perfect hexagon triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:325-335 [Journal]
  5. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:175-193 [Journal]
  6. Charles J. Colbourn, Charles C. Lindner
    Support Sizes of Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:193-210 [Journal]
  7. Charles C. Lindner
    Finite Embedding Theorems for Partial Latin Squares, Quasi-groups, and Loops. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:13, n:3, pp:339-345 [Journal]
  8. Charles C. Lindner
    A Simple Construction of Disjoint and Almost Disjoint Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:2, pp:204-209 [Journal]
  9. Charles C. Lindner
    Disjoint Finite Partial Steiner Triple Systems Can Be Embedded in Disjoint Finite Steiner Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:1, pp:126-129 [Journal]
  10. Charles C. Lindner
    A Partial Steiner Triple System of Order n Can Be Embedded in a Steiner Triple System of Order 6n + 3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:18, n:3, pp:349-351 [Journal]
  11. Charles C. Lindner
    Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:1, pp:35-43 [Journal]
  12. Charles C. Lindner
    A Finite Partial Idempotent Latin Cube Can Be Embedded in a Finite Idempotent Latin Cube. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:21, n:1, pp:104-109 [Journal]
  13. Charles C. Lindner
    On the Number of Disjoint Mendelsohn Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:30, n:3, pp:326-330 [Journal]
  14. Charles C. Lindner, Alexander Rosa
    A Partial Room Square Can be Embedded in a Room Square. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:1, pp:97-102 [Journal]
  15. Charles C. Lindner, N. S. Mendelsohn, S. R. Sun
    On the construction of Schroeder quasigroups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:3, pp:271-280 [Journal]
  16. Charles C. Lindner, Douglas R. Stinson
    Steiner pentagon systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:1, pp:67-74 [Journal]
  17. Charles C. Lindner
    Construction of large sets of pairwise disjoint transitive triple systems II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:1, pp:65-74 [Journal]
  18. Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson
    Nesting of cycle systems of odd length. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:77, n:1-3, pp:191-203 [Journal]
  19. Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson
    Small embeddings for partial cycle systems of odd length. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:3, pp:273-280 [Journal]
  20. H. L. Fu, Charles C. Lindner
    The Doyen-Wilson theorem for maximum packings of Kn with 4-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:183, n:1-3, pp:103-117 [Journal]
  21. Charles C. Lindner, Christopher A. Rodger
    On equationally defining extended cycle systems, . [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:173, n:1-3, pp:1-14 [Journal]
  22. H. L. Fu, Charles C. Lindner, C. A. Rodger
    Two Doyen-Wilson theorems for maximum packings with triples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:178, n:1-3, pp:63-71 [Journal]
  23. Dean G. Hoffman, Charles C. Lindner, Kevin T. Phelps
    Blocking sets in designs with block size four II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:3, pp:221-229 [Journal]
  24. Charles C. Lindner, C. A. Rodger
    2-perfect m-cycle systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:104, n:1, pp:83-90 [Journal]
  25. D. Chen, Charles C. Lindner, Douglas R. Stinson
    Further results on large sets of disjoint group-divisible designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:35-42 [Journal]
  26. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:117, n:1-3, pp:151-159 [Journal]

Search in 0.028secs, Finished in 0.029secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002