Stefanie Gerke - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2024

On Seymour's and Sullivan's second neighbourhood conjecturesJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang 0003, Anders Yeo, Yacong Zhou. jgt, 105(3):413-426, March 2024. [doi]

2023

Proper orientation, proper biorientation and semi-proper orientation numbers of graphsJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Hui Lei 0002, Yongtang Shi. jco, 45(1):40, 2023. [doi]

Results on the small quasi-kernel conjectureJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou. DM, 346(7):113435, July 2023. [doi]

2022

Kings in multipartite hypertournamentsJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin. jgt, 99(1):82-89, 2022. [doi]

Extended path partition conjecture for semicomplete and acyclic compositionsJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yacong Zhou. DM, 345(11):113019, 2022. [doi]

2021

Proximity and remoteness in directed and undirected graphsJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Sonwabile Mafunda. DM, 344(3):112252, 2021. [doi]

2020

Proper orientation number of triangle-free bridgeless outerplanar graphsJiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Yongtang Shi, Zhenyu Taoqiu. jgt, 95(2):256-266, 2020. [doi]

Successive shortest paths in complete graphs with random edge weightsStefanie Gerke, Balázs F. Mezei, Gregory B. Sorkin. rsa, 57(4):1205-1247, 2020. [doi]

2019

The asymptotic number of prefix normal wordsPaul Balister, Stefanie Gerke. TCS, 784:75-80, 2019. [doi]

2015

Controllability and matchings in random bipartite graphsPaul N. Balister, Stefanie Gerke. In Artur Czumaj, Agelos Georgakopoulos, Daniel Král, Vadim V. Lozin, Oleg Pikhurko, editors, Surveys in Combinatorics 2015. Volume 424 of London Mathematical Society Lecture Note Series, pages 119-146, Cambridge University Press, 2015. [doi]

Nonvertex-Balanced Factors in Random GraphsStefanie Gerke, Andrew McDowell. jgt, 78(4):269-286, 2015. [doi]

Maximizing the Minimum Load for Random Processing TimesStefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger. TALG, 11(3):17, 2015. [doi]

2011

No Dense Subgraphs Appear in the Triangle-free Graph ProcessStefanie Gerke, Tamas Makai. combinatorics, 18(1), 2011. [doi]

Pegging Graphs Yields a Small DiameterStefanie Gerke, Angelika Steger, Nicholas C. Wormald. cpc, 20(2):239-248, 2011. [doi]

2009

Convex Sets in Acyclic DigraphsPaul Balister, Stefanie Gerke, Gregory Gutin. order, 26(1):95-100, 2009. [doi]

Algorithms for generating convex sets in acyclic digraphsPaul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, A. Soleimanfallah, Anders Yeo. jda, 7(4):509-518, 2009. [doi]

Connectivity of the uniform random intersection graphSimon R. Blackburn, Stefanie Gerke. DM, 309(16):5130-5140, 2009. [doi]

2008

Sequences with Changing DependenciesPaul Balister, Béla Bollobás, Stefanie Gerke. siamdm, 22(3):1149-1154, 2008. [doi]

Connectivity of addable graph classesPaul Balister, Béla Bollobás, Stefanie Gerke. JCT, 98(3):577-584, 2008. [doi]

3, 3 as a MinorStefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl. combinatorics, 15(1), 2008. [doi]

The random planar graph processStefanie Gerke, Dirk Schlatter, Angelika Steger, Anusch Taraz. rsa, 32(2):236-261, 2008. [doi]

2007

The generalized Randic index of treesPaul N. Balister, Béla Bollobás, Stefanie Gerke. jgt, 56(4):270-286, 2007. [doi]

Small subsets inherit sparse epsilon-regularityStefanie Gerke, Yoshiharu Kohayakawa, Vojtech Rödl, Angelika Steger. JCT, 97(1):34-56, 2007. [doi]

A probabilistic counting lemma for complete graphsStefanie Gerke, Martin Marciniszyn, Angelika Steger. rsa, 31(4):517-534, 2007. [doi]

A Characterization for Sparse epsilon-Regular PairsStefanie Gerke, Angelika Steger. combinatorics, 14(1), 2007. [doi]

::::K:::: ::4::-free subgraphs of random graphs revisitedStefanie Gerke, Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger, Anusch Taraz. combinatorica, 27(3):329-365, 2007. [doi]

2006

The generalized acyclic edge chromatic number of random regular graphsStefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald. jgt, 53(2):101-125, 2006. [doi]

2005

The sparse regularity lemma and its applicationsStefanie Gerke, Angelika Steger. sbcci 2005: 227-258

Random planar graphs with ::::n:::: nodes and a fixed number of edgesStefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl. soda 2005: 999-1007 [doi]

2004

Graph Imperfection with a Co-Site ConstraintStefanie Gerke, Colin McDiarmid. siamdm, 17(3):403-425, 2004. [doi]

K::5::-free subgraphs of random graphsStefanie Gerke, Thomas Schickinger, Angelika Steger. rsa, 24(2):194-232, 2004. [doi]

On the Number of Edges in Random Planar GraphsStefanie Gerke, Colin McDiarmid. cpc, 13(2):165-183, 2004.

2001

Graph Imperfection IIStefanie Gerke, Colin McDiarmid. JCT, 83(1):79-101, 2001. [doi]

Graph ImperfectionStefanie Gerke, Colin McDiarmid. JCT, 83(1):58-78, 2001. [doi]

Channel Assignment with Large DemandsStefanie Gerke, Colin McDiarmid. anor, 107(1-4):143-159, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL