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

Search the dblp DataBase

Title:
Author:
Klaus Metsch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Klaus Metsch, Bridget S. Webb
    A Note on the Cycle Structures of Automorphisms of 2-(v, k, 1) Designs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  2. Jörg Eisfeld, Klaus Metsch
    Blocking s-Dimensional Subspaces by Lines in PG(2s, q). [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:151-162 [Journal]
  3. Klaus Metsch
    Blocking Subspaces By Lines In PG(n, q). [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:459-486 [Journal]
  4. Klaus Metsch
    On the Number of Lines in Planar Spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1995, v:15, n:1, pp:105-110 [Journal]
  5. Aart Blokhuis, Klaus Metsch
    On the Size of a Maximal Partial Spread. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1993, v:3, n:3, pp:187-191 [Journal]
  6. Klaus Metsch
    On the Characterization of the Folded Halved Cubes by Their Intersection Arrays. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:215-225 [Journal]
  7. Klaus Metsch
    Small Point Sets that Meet All Generators of W(2n+1, iq). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:3, pp:283-288 [Journal]
  8. Klaus Metsch
    Blocking Structures of Hermitian Varieties. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:339-360 [Journal]
  9. Klaus Metsch
    Improvement of Bruck's Completion Theorem. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:2, pp:99-116 [Journal]
  10. Klaus Metsch
    Embedding the Linear Structure of Planar Spaces into Projective Spaces. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:2, pp:251-263 [Journal]
  11. Klaus Metsch
    A Bose-Burton Theorem for Elliptic Polar Spaces. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:219-224 [Journal]
  12. Klaus Metsch, Leo Storme
    Partial-Spreads in. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:199-216 [Journal]
  13. Jan De Beule, Klaus Metsch
    The smallest point sets that meet all generators of H(2n, q2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:75-81 [Journal]
  14. Klaus Metsch, Leo Storme
    Partial linear complexes of PG(3, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:255, n:1-3, pp:287-296 [Journal]
  15. Klaus Metsch
    On the Characterization of the Folded Johnson Graphs and the Folded Halved Cubes by their Intersection Arrays. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:1, pp:65-74 [Journal]
  16. Klaus Metsch
    Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:8, pp:901-913 [Journal]
  17. Klaus Metsch
    On a Characterization of Bilinear Forms Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:4, pp:293-306 [Journal]
  18. Jan De Beule, Klaus Metsch
    Small point sets that meet all generators of Q(2n, p), p>3 prime. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:106, n:2, pp:327-333 [Journal]
  19. Klaus Metsch
    Embedding finite planar spaces into 3-dimensional projective spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:51, n:2, pp:161-168 [Journal]
  20. Jan De Beule, Klaus Metsch, Leo Storme
    Characterization results on small blocking sets of the polar spaces Q +(2 n + 1, 2) and Q +(2 n + 1, 3). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:197-207 [Journal]
  21. Albrecht Beutelspacher, Klaus Metsch
    Embedding finite linear spaces in projective planes, II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:219-230 [Journal]
  22. Klaus Metsch
    An optimal bound for embedding linear spaces into projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:70, n:1, pp:53-70 [Journal]
  23. Klaus Metsch
    Embedding theorems for locally projective three-dimensional linear spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:174, n:1-3, pp:227-245 [Journal]
  24. Klaus Metsch
    Linear spaces with few lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:215-222 [Journal]
  25. Klaus Metsch
    Quasi-residual designs, 1 1/2-designs, and strongly regular multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:143, n:1-3, pp:167-188 [Journal]
  26. Jan De Beule, Klaus Metsch
    The maximum size of a partial spread in H(5, q2) is q3+1. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:4, pp:761-768 [Journal]

  27. Partial ovoids and partial spreads in hermitian polar spaces. [Citation Graph (, )][DBLP]


  28. Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. [Citation Graph (, )][DBLP]


  29. Parameters for which the Griesmer bound is not sharp. [Citation Graph (, )][DBLP]


  30. Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. [Citation Graph (, )][DBLP]


Search in 0.065secs, Finished in 0.067secs
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