Stefanie Gerke

50 papers A* 1Journal 46Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On k-anti-traceability of oriented graphs. Discret. Math. Bin Chen, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Heis Parker-Cox, Yacong Zhou
2024	J	`jnl`	Bounds on Maximum Weight Directed Cut. SIAM J. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2024	J	`jnl`	On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou
2024	J	`jnl`	Public goods in networks with constraints on sharing. J. Econ. Theory Stefanie Gerke, Gregory Z. Gutin, Sung-Ha Hwang, Philip R. Neary
2023	J	`jnl`	Bounds on Maximum Weight Directed Cut. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2023	J	`jnl`	Proper orientation, proper biorientation and semi-proper orientation numbers of graphs. J. Comb. Optim. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei, Yongtang Shi
2023	J	`jnl`	Results on the small quasi-kernel conjecture. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2022	J	`jnl`	Extended path partition conjecture for semicomplete and acyclic compositions. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
2022	J	`jnl`	Kings in multipartite hypertournaments. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
2022	J	`jnl`	Results on the Small Quasi-Kernel Conjecture. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou
2021	J	`jnl`	Extended Path Partition Conjecture for Semicomplete and Acyclic Compositions. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou
2021	J	`jnl`	Proximity and remoteness in directed and undirected graphs. Discret. Math. Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda
2020	J	`jnl`	Note on 4-Kings in Bipartite Hypertournaments. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin
2020	J	`jnl`	Proper orientation number of triangle-free bridgeless outerplanar graphs. J. Graph Theory Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu
2020	J	`jnl`	Proximity and Remoteness in Directed and Undirected Graphs. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda
2020	J	`jnl`	Successive shortest paths in complete graphs with random edge weights. Random Struct. Algorithms Stefanie Gerke, Balázs F. Mezei, Gregory B. Sorkin
2019	J	`jnl`	Proper Orientation Number of Triangle-free Bridgeless Outerplanar Graphs. CoRR Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu
2019	J	`jnl`	Successive shortest paths in complete graphs with random edge weights. CoRR Stefanie Gerke, Balázs Mezei, Gregory B. Sorkin
2019	J	`jnl`	The asymptotic number of prefix normal words. Theor. Comput. Sci. Paul Balister, Stefanie Gerke
2015	—	`ch.`	Controllability and matchings in random bipartite graphs. Surveys in Combinatorics Paul N. Balister, Stefanie Gerke
2015	J	`jnl`	Maximizing the Minimum Load for Random Processing Times. ACM Trans. Algorithms Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger
2015	J	`jnl`	Nonvertex-Balanced Factors in Random Graphs. J. Graph Theory Stefanie Gerke, Andrew McDowell
2013	—	`book`	Surveys in Combinatorics 2013 Simon R. Blackburn, Stefanie Gerke, Mark Wildon
2011	J	`jnl`	No Dense Subgraphs Appear in the Triangle-free Graph Process. Electron. J. Comb. Stefanie Gerke, Tamás Makai
2011	J	`jnl`	Pegging Graphs Yields a Small Diameter. Comb. Probab. Comput. Stefanie Gerke, Angelika Steger, Nicholas C. Wormald
2009	J	`jnl`	Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
2009	J	`jnl`	Connectivity of the uniform random intersection graph. Discret. Math. Simon R. Blackburn, Stefanie Gerke
2009	J	`jnl`	Convex Sets in Acyclic Digraphs. Order Paul Balister, Stefanie Gerke, Gregory Z. Gutin
2008	J	`jnl`	Connectivity of addable graph classes. J. Comb. Theory B Paul Balister, Béla Bollobás, Stefanie Gerke
2008	J	`jnl`	Sequences with Changing Dependencies. SIAM J. Discret. Math. Paul Balister, Béla Bollobás, Stefanie Gerke
2008	J	`jnl`	The Number of Graphs Not Containing K Electron. J. Comb. Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl
2008	J	`jnl`	The random planar graph process. Random Struct. Algorithms Stefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz
2007	J	`jnl`	A Characterization for Sparse epsilon-Regular Pairs. Electron. J. Comb. Stefanie Gerke, Angelika Steger
2007	J	`jnl`	A probabilistic counting lemma for complete graphs. Random Struct. Algorithms Stefanie Gerke, Martin Marciniszyn, Angelika Steger
2007	J	`jnl`	Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
2007	J	`jnl`	Convex sets in acyclic digraphs CoRR Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin
2007	J	`jnl`	Generalised acyclic edge colourings of graphs with large girth. Discret. Math. Stefanie Gerke, Melanie Raemy
2007	J	`jnl`	Small subsets inherit sparse epsilon-regularity. J. Comb. Theory B Stefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger
2007	J	`jnl`	The generalized Randic index of trees. J. Graph Theory Paul N. Balister, Béla Bollobás, Stefanie Gerke
2006	J	`jnl`	The generalized acyclic edge chromatic number of random regular graphs. J. Graph Theory Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
2005	A*	`conf`	Random planar graphs with SODA Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl
2005	—	`conf`	The sparse regularity lemma and its applications. BCC Stefanie Gerke, Angelika Steger
2004	J	`jnl`	Graph Imperfection with a Co-Site Constraint. SIAM J. Discret. Math. Stefanie Gerke, Colin McDiarmid
2004	J	`jnl`	K Random Struct. Algorithms Stefanie Gerke, Thomas Schickinger, Angelika Steger
2004	J	`jnl`	On the Number of Edges in Random Planar Graphs. Comb. Probab. Comput. Stefanie Gerke, Colin McDiarmid
2001	J	`jnl`	Channel Assignment with Large Demands. Ann. Oper. Res. Stefanie Gerke, Colin McDiarmid
2001	J	`jnl`	Graph Imperfection II. J. Comb. Theory B Stefanie Gerke, Colin McDiarmid
2001	J	`jnl`	Graph Imperfection. J. Comb. Theory B Stefanie Gerke, Colin McDiarmid
2000	J	`jnl`	Colouring weighted bipartite graphs with a co-site constraint. Discret. Math. Stefanie Gerke