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

Stefanie Gerke Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page