 | 2011 |
| 27 |  | Stefanie Gerke,
Angelika Steger,
Nicholas C. Wormald:
Pegging Graphs Yields a Small Diameter.
Combinatorics, Probability & Computing 20(2): 239-248 (2011) |
| 26 |  | Stefanie Gerke,
Tamas Makai:
No Dense Subgraphs Appear in the Triangle-free Graph Process.
Electr. J. Comb. 18(1): (2011) |
| 2009 |
| 25 |  | Simon R. Blackburn,
Stefanie Gerke:
Connectivity of the uniform random intersection graph.
Discrete Mathematics 309(16): 5130-5140 (2009) |
| 24 |  | Paul N. Balister,
Stefanie Gerke,
Gregory Gutin,
Adrian Johnstone,
Joseph Reddington,
Elizabeth Scott,
Arezou Soleimanfallah,
Anders Yeo:
Algorithms for generating convex sets in acyclic digraphs.
J. Discrete Algorithms 7(4): 509-518 (2009) |
| 23 |  | Paul Balister,
Stefanie Gerke,
Gregory Gutin:
Convex Sets in Acyclic Digraphs.
Order 26(1): 95-100 (2009) |
| 2008 |
| 22 |  | Stefanie Gerke,
Omer Giménez,
Marc Noy,
Andreas Weißl:
The Number of Graphs Not Containing K3, 3 as a Minor.
Electr. J. Comb. 15(1): (2008) |
| 21 |  | Paul Balister,
Béla Bollobás,
Stefanie Gerke:
Connectivity of addable graph classes.
J. Comb. Theory, Ser. B 98(3): 577-584 (2008) |
| 20 |  | Stefanie Gerke,
Dirk Schlatter,
Angelika Steger,
Anusch Taraz:
The random planar graph process.
Random Struct. Algorithms 32(2): 236-261 (2008) |
| 19 |  | Paul Balister,
Béla Bollobás,
Stefanie Gerke:
Sequences with Changing Dependencies.
SIAM J. Discrete Math. 22(3): 1149-1154 (2008) |
| 2007 |
| 18 |  | Paul N. Balister,
Stefanie Gerke,
Gregory Gutin,
Adrian Johnstone,
Joseph Reddington,
Elizabeth Scott,
Arezou Soleimanfallah,
Anders Yeo:
Algorithms for Generating Convex Sets in Acyclic Digraphs
CoRR abs/0712.2661: (2007) |
| 17 |  | Paul N. Balister,
Stefanie Gerke,
Gregory Gutin:
Convex sets in acyclic digraphs
CoRR abs/0712.2678: (2007) |
| 16 |  | Stefanie Gerke,
Hans Jürgen Prömel,
Thomas Schickinger,
Angelika Steger,
Anusch Taraz:
K 4-free subgraphs of random graphs revisited.
Combinatorica 27(3): 329-365 (2007) |
| 15 |  | Stefanie Gerke,
Melanie Raemy:
Generalised acyclic edge colourings of graphs with large girth.
Discrete Mathematics 307(13): 1668-1671 (2007) |
| 14 |  | Stefanie Gerke,
Angelika Steger:
A Characterization for Sparse epsilon-Regular Pairs.
Electr. J. Comb. 14(1): (2007) |
| 13 |  | Stefanie Gerke,
Yoshiharu Kohayakawa,
Vojtech Rödl,
Angelika Steger:
Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory, Ser. B 97(1): 34-56 (2007) |
| 12 |  | Paul N. Balister,
Béla Bollobás,
Stefanie Gerke:
The generalized Randic index of trees.
Journal of Graph Theory 56(4): 270-286 (2007) |
| 11 |  | Stefanie Gerke,
Martin Marciniszyn,
Angelika Steger:
A probabilistic counting lemma for complete graphs.
Random Struct. Algorithms 31(4): 517-534 (2007) |
| 2006 |
| 10 |  | Stefanie Gerke,
Catherine S. Greenhill,
Nicholas C. Wormald:
The generalized acyclic edge chromatic number of random regular graphs.
Journal of Graph Theory 53(2): 101-125 (2006) |
| 2005 |
| 9 |  | Stefanie Gerke,
Colin McDiarmid,
Angelika Steger,
Andreas Weißl:
Random planar graphs with n nodes and a fixed number of edges.
SODA 2005: 999-1007 |
| 8 |  | Stefanie Gerke,
Angelika Steger:
The sparse regularity lemma and its applications.
Surveys in Combinatorics 2005: 227-258 |
| 2004 |
| 7 |  | Stefanie Gerke,
Colin McDiarmid:
On the Number of Edges in Random Planar Graphs.
Combinatorics, Probability & Computing 13(2): 165-183 (2004) |
| 6 |  | Stefanie Gerke,
Thomas Schickinger,
Angelika Steger:
K5-free subgraphs of random graphs.
Random Struct. Algorithms 24(2): 194-232 (2004) |
| 5 |  | Stefanie Gerke,
Colin McDiarmid:
Graph Imperfection with a Co-Site Constraint.
SIAM J. Discrete Math. 17(3): 403-425 (2004) |
| 2001 |
| 4 |  | Stefanie Gerke,
Colin McDiarmid:
Channel Assignment with Large Demands.
Annals OR 107(1-4): 143-159 (2001) |
| 3 |  | Stefanie Gerke,
Colin McDiarmid:
Graph Imperfection.
J. Comb. Theory, Ser. B 83(1): 58-78 (2001) |
| 2 |  | Stefanie Gerke,
Colin McDiarmid:
Graph Imperfection II.
J. Comb. Theory, Ser. B 83(1): 79-101 (2001) |
| 2000 |
| 1 |  | Stefanie Gerke:
Colouring weighted bipartite graphs with a co-site constraint.
Discrete Mathematics 224(1-3): 125-138 (2000) |