Stefanie Gerke

675 total citations
35 papers, 299 citations indexed

About

Stefanie Gerke is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Stefanie Gerke has authored 35 papers receiving a total of 299 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 14 papers in Geometry and Topology and 13 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Stefanie Gerke's work include Advanced Graph Theory Research (20 papers), Limits and Structures in Graph Theory (13 papers) and Graph theory and applications (13 papers). Stefanie Gerke is often cited by papers focused on Advanced Graph Theory Research (20 papers), Limits and Structures in Graph Theory (13 papers) and Graph theory and applications (13 papers). Stefanie Gerke collaborates with scholars based in United Kingdom, Switzerland and United States. Stefanie Gerke's co-authors include Colin McDiarmid, Simon R. Blackburn⋆, Angelika Steger, Paul Balister, Béla Bollobás, Vojtěch Rödl, Yoshiharu Kohayakawa, Anusch Taraz, Gregory Gutin and Omer Giménez and has published in prestigious journals such as Journal of Economic Theory, Annals of Operations Research and Theoretical Computer Science.

In The Last Decade

Stefanie Gerke

30 papers receiving 284 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stefanie Gerke United Kingdom 11 174 130 91 84 66 35 299
Gábor Simonyi Hungary 12 294 1.7× 213 1.6× 111 1.2× 84 1.0× 43 0.7× 40 423
Lúcia Draque Penso Germany 9 203 1.2× 58 0.4× 77 0.8× 73 0.9× 10 0.2× 32 274
Claude Tardif Canada 12 437 2.5× 177 1.4× 156 1.7× 94 1.1× 88 1.3× 60 517
Walter Wenzel Germany 11 306 1.8× 92 0.7× 113 1.2× 36 0.4× 41 0.6× 42 430
Guillem Perarnau Spain 7 89 0.5× 65 0.5× 46 0.5× 29 0.3× 27 0.4× 35 166
Omid Amini France 9 142 0.8× 35 0.3× 75 0.8× 39 0.5× 23 0.3× 28 207
Norbert Seifter Austria 10 163 0.9× 149 1.1× 134 1.5× 34 0.4× 52 0.8× 35 281
Martin Kochol Slovakia 13 395 2.3× 225 1.7× 87 1.0× 74 0.9× 35 0.5× 55 448
Jerzy Jaworski Poland 11 68 0.4× 66 0.5× 42 0.5× 93 1.1× 136 2.1× 35 283
Mihyun Kang Austria 11 168 1.0× 171 1.3× 90 1.0× 19 0.2× 152 2.3× 67 347

Countries citing papers authored by Stefanie Gerke

Since Specialization
Citations

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

Fields of papers citing papers by Stefanie Gerke

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stefanie Gerke

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

All Works

20 of 20 papers shown
1.
Gerke, Stefanie, et al.. (2024). Bounds on Maximum Weight Directed Cut. SIAM Journal on Discrete Mathematics. 38(3). 2370–2391.
2.
Gerke, Stefanie, et al.. (2023). On Seymour's and Sullivan's second neighbourhood conjectures. Journal of Graph Theory. 105(3). 413–426. 1 indexed citations
3.
Gerke, Stefanie, et al.. (2021). Kings in multipartite hypertournaments. Journal of Graph Theory. 99(1). 82–89.
4.
Gerke, Stefanie, et al.. (2020). Proximity and remoteness in directed and undirected graphs. Discrete Mathematics. 344(3). 112252–112252. 5 indexed citations
5.
Gerke, Stefanie, et al.. (2014). Nonvertex‐Balanced Factors in Random Graphs. Journal of Graph Theory. 78(4). 269–286. 3 indexed citations
6.
Blackburn⋆, Simon R. & Stefanie Gerke. (2009). Connectivity of the uniform random intersection graph. Discrete Mathematics. 309(16). 5130–5140. 57 indexed citations
7.
Balister, Paul, Stefanie Gerke, Gregory Gutin, et al.. (2008). Algorithms for generating convex sets in acyclic digraphs. Journal of Discrete Algorithms. 7(4). 509–518. 10 indexed citations
8.
Gerke, Stefanie, et al.. (2008). The Number of Graphs Not Containing $K_{3,3}$ as a Minor. The Electronic Journal of Combinatorics. 15(1). 9 indexed citations
9.
Balister, Paul, Béla Bollobás, & Stefanie Gerke. (2007). Connectivity of addable graph classes. Journal of Combinatorial Theory Series B. 98(3). 577–584. 10 indexed citations
10.
Gerke, Stefanie & Angelika Steger. (2007). A characterization for sparse -regular pairs.. 14(1). 669–76. 1 indexed citations
11.
Balister, Paul, Béla Bollobás, & Stefanie Gerke. (2007). The generalized Randić index of trees. Journal of Graph Theory. 56(4). 270–286. 13 indexed citations
12.
Gerke, Stefanie, Yoshiharu Kohayakawa, Vojtěch Rödl, & Angelika Steger. (2006). Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory Series B. 97(1). 34–56. 23 indexed citations
13.
Gerke, Stefanie, et al.. (2006). On the number of K3,3-minor-free and maximal K3,3-minor-free graphs. Dipòsit Digital de Documents de la UAB (Universitat Autònoma de Barcelona). 3 indexed citations
14.
Gerke, Stefanie, et al.. (2006). Generalised acyclic edge colourings of graphs with large girth. Discrete Mathematics. 307(13). 1668–1671. 13 indexed citations
15.
Gerke, Stefanie, et al.. (2005). Random planar graphs with n nodes and a fixed number of edges. Symposium on Discrete Algorithms. 999–1007. 15 indexed citations
16.
Gerke, Stefanie, et al.. (2005). A Probabilistic Counting Lemma for Complete Graphs. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AE,...(Proceedings). 5 indexed citations
17.
Gerke, Stefanie & Colin McDiarmid. (2001). Graph Imperfection II. Journal of Combinatorial Theory Series B. 83(1). 79–101. 12 indexed citations
18.
Gerke, Stefanie & Colin McDiarmid. (2001). Graph Imperfection. Journal of Combinatorial Theory Series B. 83(1). 58–78. 29 indexed citations
19.
Gerke, Stefanie & Colin McDiarmid. (2001). Channel Assignment with Large Demands. Annals of Operations Research. 107(1-4). 143–159.
20.
Gerke, Stefanie. (2000). Colouring weighted bipartite graphs with a co-site constraint. Discrete Mathematics. 224(1-3). 125–138. 3 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

Rankless by CCL
2026