dblp.uni-trier.dewww.uni-trier.de

Stefanie Gerke

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2007
15EEPaul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, J. Reddington, Elizabeth Scott, A. Soleimanfallah, Anders Yeo: Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR abs/0712.2661: (2007)
14EEPaul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs CoRR abs/0712.2678: (2007)
13EEStefanie Gerke, Melanie Raemy: Generalised acyclic edge colourings of graphs with large girth. Discrete Mathematics 307(13): 1668-1671 (2007)
12EEStefanie Gerke, Angelika Steger: A Characterization for Sparse epsilon-Regular Pairs. Electr. J. Comb. 14(1): (2007)
11EEStefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger: Small subsets inherit sparse epsilon-regularity. J. Comb. Theory, Ser. B 97(1): 34-56 (2007)
10EEStefanie Gerke, Martin Marciniszyn, Angelika Steger: A probabilistic counting lemma for complete graphs. Random Struct. Algorithms 31(4): 517-534 (2007)
2006
9EEStefanie 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
8EEStefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl: Random planar graphs with n nodes and a fixed number of edges. SODA 2005: 999-1007
7 Stefanie Gerke, Angelika Steger: The sparse regularity lemma and its applications. Surveys in Combinatorics 2005: 227-258
2004
6 Stefanie Gerke, Colin McDiarmid: On the Number of Edges in Random Planar Graphs. Combinatorics, Probability & Computing 13(2): 165-183 (2004)
5EEStefanie Gerke, Thomas Schickinger, Angelika Steger: K5-free subgraphs of random graphs. Random Struct. Algorithms 24(2): 194-232 (2004)
4EEStefanie Gerke, Colin McDiarmid: Graph Imperfection with a Co-Site Constraint. SIAM J. Discrete Math. 17(3): 403-425 (2004)
2001
3EEStefanie Gerke, Colin McDiarmid: Graph Imperfection. J. Comb. Theory, Ser. B 83(1): 58-78 (2001)
2EEStefanie Gerke, Colin McDiarmid: Graph Imperfection II. J. Comb. Theory, Ser. B 83(1): 79-101 (2001)
2000
1EEStefanie Gerke: Colouring weighted bipartite graphs with a co-site constraint. Discrete Mathematics 224(1-3): 125-138 (2000)

Coauthor Index

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

Colors in the list of coauthors

Copyright © Thu Jun 5 07:42:39 2008 by Michael Ley (ley@uni-trier.de)