Stefanie Gerke

2008
19	EE	Paul Balister, Béla Bollobás, Stefanie Gerke: Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98(3): 577-584 (2008)
18	EE	Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz: The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008)
2007
17	EE	Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, A. Soleimanfallah, Anders Yeo: Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR abs/0712.2661: (2007)
16	EE	Paul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs CoRR abs/0712.2678: (2007)
15	EE	Stefanie Gerke, Melanie Raemy: Generalised acyclic edge colourings of graphs with large girth. Discrete Mathematics 307(13): 1668-1671 (2007)
14	EE	Stefanie Gerke, Angelika Steger: A Characterization for Sparse epsilon-Regular Pairs. Electr. J. Comb. 14(1): (2007)
13	EE	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	EE	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	EE	Stefanie Gerke, Martin Marciniszyn, Angelika Steger: A probabilistic counting lemma for complete graphs. Random Struct. Algorithms 31(4): 517-534 (2007)
2006
10	EE	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	EE	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	EE	Stefanie Gerke, Thomas Schickinger, Angelika Steger: K5-free subgraphs of random graphs. Random Struct. Algorithms 24(2): 194-232 (2004)
5	EE	Stefanie Gerke, Colin McDiarmid: Graph Imperfection with a Co-Site Constraint. SIAM J. Discrete Math. 17(3): 403-425 (2004)
2001
4	EE	Stefanie Gerke, Colin McDiarmid: Channel Assignment with Large Demands. Annals OR 107(1-4): 143-159 (2001)
3	EE	Stefanie Gerke, Colin McDiarmid: Graph Imperfection. J. Comb. Theory, Ser. B 83(1): 58-78 (2001)
2	EE	Stefanie Gerke, Colin McDiarmid: Graph Imperfection II. J. Comb. Theory, Ser. B 83(1): 79-101 (2001)
2000
1	EE	Stefanie Gerke: Colouring weighted bipartite graphs with a co-site constraint. Discrete Mathematics 224(1-3): 125-138 (2000)

Coauthor Index

1	Paul N. Balister (Paul Balister)	[12] [16] [17] [19]
2	Béla Bollobás	[12] [19]
3	Catherine S. Greenhill	[10]
4	Gregory Gutin	[16] [17]
5	Adrian Johnstone	[17]
6	Yoshiharu Kohayakawa	[13]
7	Martin Marciniszyn	[11]
8	Colin McDiarmid (Colin J. H. McDiarmid)	[2] [3] [4] [5] [7] [9]
9	Melanie Raemy	[15]
10	Joseph Reddington	[17]
11	Vojtech Rödl	[13]
12	Thomas Schickinger	[6]
13	Dirk Schlatter	[18]
14	Elizabeth Scott	[17]
15	A. Soleimanfallah	[17]
16	Angelika Steger	[6] [8] [9] [11] [13] [14] [18]
17	Anusch Taraz	[18]
18	Andreas Weißl	[9]
19	Nicholas C. Wormald	[10]
20	Anders Yeo	[17]

Colors in the list of coauthors