Stefan Glock

402 total citations
16 papers, 62 citations indexed

About

Stefan Glock is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Stefan Glock has authored 16 papers receiving a total of 62 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Discrete Mathematics and Combinatorics, 10 papers in Computational Theory and Mathematics and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Stefan Glock's work include Limits and Structures in Graph Theory (14 papers), graph theory and CDMA systems (10 papers) and Advanced Graph Theory Research (7 papers). Stefan Glock is often cited by papers focused on Limits and Structures in Graph Theory (14 papers), graph theory and CDMA systems (10 papers) and Advanced Graph Theory Research (7 papers). Stefan Glock collaborates with scholars based in Germany, United Kingdom and Switzerland. Stefan Glock's co-authors include Deryk Osthus, Daniela Kühn, Felix Joos, Allan Lo, Benny Sudakov, Jaehoon Kim, Richard Montgomery, Oleg Pikhurko and Michael Krivelevich and has published in prestigious journals such as Advances in Mathematics, Proceedings of the American Mathematical Society and Memoirs of the American Mathematical Society.

In The Last Decade

Stefan Glock

16 papers receiving 60 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stefan Glock Germany 6 49 40 23 20 3 16 62
Casey Tompkins Hungary 7 78 1.6× 72 1.8× 43 1.9× 18 0.9× 3 1.0× 35 109
Luke Postle Canada 6 80 1.6× 110 2.8× 24 1.0× 15 0.8× 14 4.7× 35 116
Monika Pilśniak Poland 8 43 0.9× 202 5.0× 27 1.2× 38 1.9× 4 1.3× 43 214
Richard Mycroft United Kingdom 7 134 2.7× 109 2.7× 66 2.9× 58 2.9× 17 152
Jason Grout United States 5 8 0.2× 32 0.8× 25 1.1× 8 0.4× 6 2.0× 6 38
Frederick L. Hoffman Israel 4 10 0.2× 19 0.5× 12 0.5× 18 0.9× 15 49
Abhishek Methuku Hungary 7 197 4.0× 170 4.3× 132 5.7× 25 1.3× 2 0.7× 44 212
Pavle V. M. Blagojević Serbia 6 39 0.8× 49 1.2× 35 1.5× 4 0.2× 28 100
J. Howard Mathews India 5 16 0.3× 52 1.3× 18 0.8× 2 0.1× 5 1.7× 8 53
Niranjan Balachandran India 3 12 0.2× 10 0.3× 5 0.2× 11 0.6× 10 3.3× 15 33

Countries citing papers authored by Stefan Glock

Since Specialization
Citations

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

Fields of papers citing papers by Stefan Glock

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stefan Glock

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

All Works

16 of 16 papers shown
1.
Glock, Stefan, et al.. (2025). Optimal Hamilton covers and linear arboricity for random graphs. Proceedings of the American Mathematical Society. 153(3). 921–935. 1 indexed citations
2.
Glock, Stefan, et al.. (2025). On the ($k + \text{2}, k$)-problem of Brown, Erdős, and Sós for $k =$ 5,6,7. Canadian Journal of Mathematics. 1–43. 1 indexed citations
3.
Glock, Stefan, et al.. (2025). Tight Hamilton cycles with high discrepancy. Combinatorics Probability Computing. 34(4). 565–584. 1 indexed citations
4.
Glock, Stefan, et al.. (2024). On the (6,4)-problem of Brown, Erdős, and Sós. Warwick Research Archive Portal (University of Warwick). 11(17). 173–186. 1 indexed citations
5.
Glock, Stefan, et al.. (2024). Hamilton cycles in pseudorandom graphs. Advances in Mathematics. 458. 109984–109984. 1 indexed citations
6.
Glock, Stefan, et al.. (2024). Conflict‐free hypergraph matchings. Journal of the London Mathematical Society. 109(5). 2 indexed citations
7.
Glock, Stefan, Daniela Kühn, Allan Lo, & Deryk Osthus. (2023). The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹. Memoirs of the American Mathematical Society. 284(1406). 6 indexed citations
8.
Glock, Stefan, et al.. (2023). Hamilton cycles in pseudorandom graphs. 1 indexed citations
9.
Glock, Stefan, et al.. (2023). New results for MaxCut in H$H$‐free graphs. Journal of the London Mathematical Society. 108(2). 441–481. 8 indexed citations
10.
Glock, Stefan, et al.. (2022). The n-queens completion problem. Research in the Mathematical Sciences. 9(3). 41–41. 1 indexed citations
11.
Glock, Stefan, et al.. (2022). The largest hole in sparse random graphs. Random Structures and Algorithms. 61(4). 666–677. 1 indexed citations
12.
Glock, Stefan, et al.. (2020). Pseudorandom hypergraph matchings. Combinatorics Probability Computing. 29(6). 868–885. 9 indexed citations
13.
Glock, Stefan, Daniela Kühn, Allan Lo, & Deryk Osthus. (2020). On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. COMBINATORICA. 40(3). 363–403. 7 indexed citations
14.
Glock, Stefan, Felix Joos, Daniela Kühn, & Deryk Osthus. (2020). Euler Tours in Hypergraphs. COMBINATORICA. 40(5). 679–690. 4 indexed citations
15.
Glock, Stefan, et al.. (2020). Minimalist designs. Random Structures and Algorithms. 57(1). 47–63. 7 indexed citations
16.
Glock, Stefan, Daniela Kühn, & Deryk Osthus. (2016). Optimal path and cycle decompositions of dense quasirandom graphs. Journal of Combinatorial Theory Series B. 118. 88–108. 11 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

Breakdown of academic impact, for papers by Casey Tompkins Breakdown of academic impact, for papers by Luke Postle Breakdown of academic impact, for papers by Monika Pilśniak Breakdown of academic impact, for papers by Richard Mycroft Breakdown of academic impact, for papers by Jason Grout Breakdown of academic impact, for papers by Frederick L. Hoffman Breakdown of academic impact, for papers by Abhishek Methuku Breakdown of academic impact, for papers by Pavle V. M. Blagojević Breakdown of academic impact, for papers by J. Howard Mathews Breakdown of academic impact, for papers by Niranjan Balachandran
Rankless by CCL
2026