Stefanie Gerke

Orcid: 0000-0002-9426-1708

Affiliations:
  • ETH Zurich, Switzerland


According to our database1, Stefanie Gerke authored at least 40 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Seymour's and Sullivan's second neighbourhood conjectures.
J. Graph Theory, March, 2024

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees.
CoRR, 2024

2023
Results on the small quasi-kernel conjecture.
Discret. Math., July, 2023

Proper orientation, proper biorientation and semi-proper orientation numbers of graphs.
J. Comb. Optim., 2023

Bounds on Maximum Weight Directed Cut.
CoRR, 2023

2022
Kings in multipartite hypertournaments.
J. Graph Theory, 2022

Extended path partition conjecture for semicomplete and acyclic compositions.
Discret. Math., 2022

2021
Proximity and remoteness in directed and undirected graphs.
Discret. Math., 2021

2020
Successive shortest paths in complete graphs with random edge weights.
Random Struct. Algorithms, 2020

Proper orientation number of triangle-free bridgeless outerplanar graphs.
J. Graph Theory, 2020

Note on 4-Kings in Bipartite Hypertournaments.
CoRR, 2020

2019
The asymptotic number of prefix normal words.
Theor. Comput. Sci., 2019

2015
Maximizing the Minimum Load for Random Processing Times.
ACM Trans. Algorithms, 2015

Nonvertex-Balanced Factors in Random Graphs.
J. Graph Theory, 2015

Controllability and matchings in random bipartite graphs.
Proceedings of the Surveys in Combinatorics 2015, 2015

2011
Pegging Graphs Yields a Small Diameter.
Comb. Probab. Comput., 2011

No Dense Subgraphs Appear in the Triangle-free Graph Process.
Electron. J. Comb., 2011

2009
Convex Sets in Acyclic Digraphs.
Order, 2009

Algorithms for generating convex sets in acyclic digraphs.
J. Discrete Algorithms, 2009

Connectivity of the uniform random intersection graph.
Discret. Math., 2009

2008
Sequences with Changing Dependencies.
SIAM J. Discret. Math., 2008

The random planar graph process.
Random Struct. Algorithms, 2008

Connectivity of addable graph classes.
J. Comb. Theory B, 2008

The Number of Graphs Not Containing K<sub>3, 3</sub> as a Minor.
Electron. J. Comb., 2008

2007
A probabilistic counting lemma for complete graphs.
Random Struct. Algorithms, 2007

The generalized Randic index of trees.
J. Graph Theory, 2007

Small subsets inherit sparse epsilon-regularity.
J. Comb. Theory B, 2007

Generalised acyclic edge colourings of graphs with large girth.
Discret. Math., 2007

A Characterization for Sparse epsilon-Regular Pairs.
Electron. J. Comb., 2007

<i>K</i> <sub>4</sub>-free subgraphs of random graphs revisited.
Comb., 2007

2006
The generalized acyclic edge chromatic number of random regular graphs.
J. Graph Theory, 2006

2005
Random planar graphs with <i>n</i> nodes and a fixed number of edges.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

The sparse regularity lemma and its applications.
Proceedings of the Surveys in Combinatorics, 2005

2004
Graph Imperfection with a Co-Site Constraint.
SIAM J. Discret. Math., 2004

K<sub>5</sub>-free subgraphs of random graphs.
Random Struct. Algorithms, 2004

On the Number of Edges in Random Planar Graphs.
Comb. Probab. Comput., 2004

2001
Graph Imperfection II.
J. Comb. Theory B, 2001

Graph Imperfection.
J. Comb. Theory B, 2001

Channel Assignment with Large Demands.
Ann. Oper. Res., 2001

2000
Colouring weighted bipartite graphs with a co-site constraint.
Discret. Math., 2000


  Loading...