default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefanie Gerke
Person information
- affiliation: ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Stefanie Gerke, Gregory Z. Gutin, Sung-Ha Hwang, Philip R. Neary:
Public goods in networks with constraints on sharing. J. Econ. Theory 219: 105844 (2024)- [j35]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang
, Anders Yeo, Yacong Zhou:
On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory 105(3): 413-426 (2024) - [j34]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. 38(3): 2370-2391 (2024) - [i10]Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR abs/2401.10074 (2024) - 2023
- [j33]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the small quasi-kernel conjecture. Discret. Math. 346(7): 113435 (2023) - [j32]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Yongtang Shi:
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. J. Comb. Optim. 45(1): 40 (2023) - [i9]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Bounds on Maximum Weight Directed Cut. CoRR abs/2304.10202 (2023) - 2022
- [j31]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou:
Extended path partition conjecture for semicomplete and acyclic compositions. Discret. Math. 345(11): 113019 (2022) - [j30]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Kings in multipartite hypertournaments. J. Graph Theory 99(1): 82-89 (2022) - [i8]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Results on the Small Quasi-Kernel Conjecture. CoRR abs/2207.12157 (2022) - 2021
- [j29]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda:
Proximity and remoteness in directed and undirected graphs. Discret. Math. 344(3): 112252 (2021) - [i7]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou:
Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions. CoRR abs/2111.09633 (2021) - 2020
- [j28]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu:
Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory 95(2): 256-266 (2020) - [j27]Stefanie Gerke, Balázs F. Mezei, Gregory B. Sorkin:
Successive shortest paths in complete graphs with random edge weights. Random Struct. Algorithms 57(4): 1205-1247 (2020) - [i6]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda:
Proximity and Remoteness in Directed and Undirected Graphs. CoRR abs/2001.10253 (2020) - [i5]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Note on 4-Kings in Bipartite Hypertournaments. CoRR abs/2011.05878 (2020)
2010 – 2019
- 2019
- [j26]Paul Balister, Stefanie Gerke:
The asymptotic number of prefix normal words. Theor. Comput. Sci. 784: 75-80 (2019) - [i4]Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu:
Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs. CoRR abs/1907.06379 (2019) - [i3]Stefanie Gerke, Balázs Mezei, Gregory B. Sorkin:
Successive shortest paths in complete graphs with random edge weights. CoRR abs/1911.01151 (2019) - 2015
- [j25]Stefanie Gerke, Andrew McDowell:
Nonvertex-Balanced Factors in Random Graphs. J. Graph Theory 78(4): 269-286 (2015) - [j24]Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger:
Maximizing the Minimum Load for Random Processing Times. ACM Trans. Algorithms 11(3): 17:1-17:19 (2015) - [p1]Paul N. Balister, Stefanie Gerke:
Controllability and matchings in random bipartite graphs. Surveys in Combinatorics 2015: 119-146 - 2013
- [e1]Simon R. Blackburn, Stefanie Gerke, Mark Wildon:
Surveys in Combinatorics 2013. London Mathematical Society Lecture Note Series 409, Cambridge University Press 2013, ISBN 9781139506748 [contents] - 2011
- [j23]Stefanie Gerke, Tamás Makai:
No Dense Subgraphs Appear in the Triangle-free Graph Process. Electron. J. Comb. 18(1) (2011) - [j22]Stefanie Gerke, Angelika Steger, Nicholas C. Wormald:
Pegging Graphs Yields a Small Diameter. Comb. Probab. Comput. 20(2): 239-248 (2011)
2000 – 2009
- 2009
- [j21]Simon R. Blackburn, Stefanie Gerke:
Connectivity of the uniform random intersection graph. Discret. Math. 309(16): 5130-5140 (2009) - [j20]Paul N. Balister, Stefanie Gerke, Gregory Z. 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) - [j19]Paul Balister, Stefanie Gerke, Gregory Z. Gutin:
Convex Sets in Acyclic Digraphs. Order 26(1): 95-100 (2009) - 2008
- [j18]Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl:
The Number of Graphs Not Containing K3, 3 as a Minor. Electron. J. Comb. 15(1) (2008) - [j17]Paul Balister, Béla Bollobás, Stefanie Gerke:
Connectivity of addable graph classes. J. Comb. Theory B 98(3): 577-584 (2008) - [j16]Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz:
The random planar graph process. Random Struct. Algorithms 32(2): 236-261 (2008) - [j15]Paul Balister, Béla Bollobás, Stefanie Gerke:
Sequences with Changing Dependencies. SIAM J. Discret. Math. 22(3): 1149-1154 (2008) - 2007
- [j14]Stefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz:
K 4-free subgraphs of random graphs revisited. Comb. 27(3): 329-365 (2007) - [j13]Stefanie Gerke, Angelika Steger:
A Characterization for Sparse epsilon-Regular Pairs. Electron. J. Comb. 14(1) (2007) - [j12]Stefanie Gerke, Melanie Raemy:
Generalised acyclic edge colourings of graphs with large girth. Discret. Math. 307(13): 1668-1671 (2007) - [j11]Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger:
Small subsets inherit sparse epsilon-regularity. J. Comb. Theory B 97(1): 34-56 (2007) - [j10]Paul N. Balister, Béla Bollobás, Stefanie Gerke:
The generalized Randic index of trees. J. Graph Theory 56(4): 270-286 (2007) - [j9]Stefanie Gerke, Martin Marciniszyn, Angelika Steger:
A probabilistic counting lemma for complete graphs. Random Struct. Algorithms 31(4): 517-534 (2007) - [i2]Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo:
Algorithms for Generating Convex Sets in Acyclic Digraphs. CoRR abs/0712.2661 (2007) - [i1]Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin:
Convex sets in acyclic digraphs. CoRR abs/0712.2678 (2007) - 2006
- [j8]Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald:
The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory 53(2): 101-125 (2006) - 2005
- [c2]Stefanie Gerke, Angelika Steger:
The sparse regularity lemma and its applications. BCC 2005: 227-258 - [c1]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 - 2004
- [j7]Stefanie Gerke, Colin McDiarmid:
On the Number of Edges in Random Planar Graphs. Comb. Probab. Comput. 13(2): 165-183 (2004) - [j6]Stefanie Gerke, Thomas Schickinger, Angelika Steger:
K5-free subgraphs of random graphs. Random Struct. Algorithms 24(2): 194-232 (2004) - [j5]Stefanie Gerke, Colin McDiarmid:
Graph Imperfection with a Co-Site Constraint. SIAM J. Discret. Math. 17(3): 403-425 (2004) - 2001
- [j4]Stefanie Gerke, Colin McDiarmid:
Channel Assignment with Large Demands. Ann. Oper. Res. 107(1-4): 143-159 (2001) - [j3]Stefanie Gerke, Colin McDiarmid:
Graph Imperfection. J. Comb. Theory B 83(1): 58-78 (2001) - [j2]Stefanie Gerke, Colin McDiarmid:
Graph Imperfection II. J. Comb. Theory B 83(1): 79-101 (2001) - 2000
- [j1]Stefanie Gerke:
Colouring weighted bipartite graphs with a co-site constraint. Discret. Math. 224(1-3): 125-138 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
