Klaus Metsch

856 total citations
87 papers, 509 citations indexed

About

Klaus Metsch is a scholar working on Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, Klaus Metsch has authored 87 papers receiving a total of 509 indexed citations (citations by other indexed papers that have themselves been cited), including 66 papers in Discrete Mathematics and Combinatorics, 51 papers in Electrical and Electronic Engineering and 50 papers in Artificial Intelligence. Recurrent topics in Klaus Metsch's work include Finite Group Theory Research (61 papers), graph theory and CDMA systems (51 papers) and Coding theory and cryptography (50 papers). Klaus Metsch is often cited by papers focused on Finite Group Theory Research (61 papers), graph theory and CDMA systems (51 papers) and Coding theory and cryptography (50 papers). Klaus Metsch collaborates with scholars based in Germany, Belgium and Italy. Klaus Metsch's co-authors include Jan De Beule, Leo Storme, Andreas Klein, A. Klein, Aart Blokhuis, Tamás Szőnyi, G.L. Ebert, Andreas Klein, Geertrui Van de Voorde and Albrecht Beutelspacher and has published in prestigious journals such as Bulletin of the London Mathematical Society, Applied Mathematics Letters and Discrete Mathematics.

In The Last Decade

Klaus Metsch

78 papers receiving 438 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Klaus Metsch Germany	12	419	342	293	93	60	87	509
Robert S. Coulter United States	12	192 0.5×	572 1.7×	399 1.4×	89 1.0×	110 1.8×	37	594
Robert A. Liebler United States	11	314 0.7×	238 0.7×	235 0.8×	90 1.0×	42 0.7×	28	393
Daniele Bartoli Italy	14	326 0.8×	579 1.7×	340 1.2×	75 0.8×	85 1.4×	102	638
Colva M. Roney‐Dougal United Kingdom	8	336 0.8×	261 0.8×	156 0.5×	104 1.1×	41 0.7×	26	400
Fernanda Pambianco Italy	14	522 1.2×	621 1.8×	444 1.5×	79 0.8×	93 1.6×	104	737
Yakov Berkovich Israel	13	464 1.1×	331 1.0×	281 1.0×	137 1.5×	35 0.6×	57	531
Larry Finkelstein United States	10	295 0.7×	224 0.7×	145 0.5×	122 1.3×	69 1.1×	32	405
Andrew J. Woldar United States	15	467 1.1×	257 0.8×	278 0.9×	212 2.3×	209 3.5×	43	635
Wolfgang M. Willems Germany	13	327 0.8×	456 1.3×	301 1.0×	78 0.8×	80 1.3×	82	580
Jan De Beule Belgium	9	214 0.5×	246 0.7×	154 0.5×	41 0.4×	33 0.6×	41	300

Countries citing papers authored by Klaus Metsch

Since Specialization

Citations

This map shows the geographic impact of Klaus Metsch'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 Klaus Metsch with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klaus Metsch more than expected).

Fields of papers citing papers by Klaus Metsch

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Klaus Metsch. 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 Klaus Metsch. The network helps show where Klaus Metsch may publish in the future.

Co-authorship network of co-authors of Klaus Metsch

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lavrauw, Michel, et al.. (2024). Finite geometries. Designs Codes and Cryptography. 93(2). 265–266.

Metsch, Klaus, et al.. (2019). On the smallest non-trivial tight sets in Hermitian polar spaces H(d,q2), d even. Discrete Mathematics. 342(5). 1336–1342. 1 indexed citations

Metsch, Klaus, et al.. (2017). Large {0,1,…,t}-cliques in dual polar graphs. Journal of Combinatorial Theory Series A. 154. 285–322. 1 indexed citations

Metsch, Klaus. (2017). A gap result for Cameron–Liebler k-classes. Discrete Mathematics. 340(6). 1311–1318. 7 indexed citations

Metsch, Klaus, et al.. (2014). A modular equality for Cameron–Liebler line classes. Journal of Combinatorial Theory Series A. 127. 224–242. 27 indexed citations

Metsch, Klaus. (2013). An improved bound on the existence of Cameron–Liebler line classes. Journal of Combinatorial Theory Series A. 121. 89–93. 21 indexed citations

Metsch, Klaus, et al.. (2010). Small point sets of PG(n, q 3) intersecting each k-subspace in 1 mod q points. Designs Codes and Cryptography. 56(2-3). 235–248. 4 indexed citations

Beule, Jan De, Andreas Klein, Klaus Metsch, & Leo Storme. (2008). Partial ovoids and partial spreads in finite classical polar spaces. Ghent University Academic Bibliography (Ghent University). 7 indexed citations

Metsch, Klaus & Leo Storme. (2007). Tangency sets inPG(3, q). Journal of Combinatorial Designs. 16(6). 462–476. 3 indexed citations

10.

Beule, Jan De & Klaus Metsch. (2006). The maximum size of a partial spread in H(5,q2) is q3+1. Journal of Combinatorial Theory Series A. 114(4). 761–768. 11 indexed citations

11.

Beule, Jan De & Klaus Metsch. (2005). The smallest point sets that meet all generators of H(2n,q2). Discrete Mathematics. 294(1-2). 75–81. 4 indexed citations

12.

Beule, Jan De & Klaus Metsch. (2004). Small point sets that meet all generators of Q(2n,p), p>3 prime. Journal of Combinatorial Theory Series A. 106(2). 327–333. 8 indexed citations

13.

Metsch, Klaus & Leo Storme. (2000). 2-Blocking sets in PG(4, q), q square.. Ghent University Academic Bibliography (Ghent University). 2 indexed citations

14.

Metsch, Klaus & Leo Storme. (2000). 2-blocking sets in PG(4, ), square.. 41(1). 247–255. 3 indexed citations

15.

Metsch, Klaus. (1999). On a Characterization of Bilinear Forms Graphs. European Journal of Combinatorics. 20(4). 293–306. 12 indexed citations

16.

Metsch, Klaus. (1997). Embedding theorems for locally projective three-dimensional linear spaces. Discrete Mathematics. 174(1-3). 227–245. 3 indexed citations

17.

Metsch, Klaus. (1997). On the Characterization of the Folded Johnson Graphs and the Folded Halved Cubes by their Intersection Arrays. European Journal of Combinatorics. 18(1). 65–74. 4 indexed citations

18.

Metsch, Klaus. (1995). A characterization of Grassmann graphs. European Journal of Combinatorics. 16(6). 639–644. 13 indexed citations

19.

Blokhuis, A., et al.. (1993). Partitioning the n-cube into sets with mutual distance 1. Applied Mathematics Letters. 6(4). 17–19. 1 indexed citations

20.

Beutelspacher, Albrecht & Klaus Metsch. (1987). Embedding finite linear spaces in projective planes, II. Discrete Mathematics. 66(3). 219–230. 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