Connectivity of the Uniform Random Intersection Graph (2008)
Blackburn, Simon R., Gerke, Stefanie
A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of...
PRIZE-COLLECTING POINT SETS (2008)
Abstract. Given a set of points P in the plane and profits (or prizes) π: P → R≥0 we want to select a maximum profit set X ⊆ P which maximizes P p∈X π(p) − µ(X) for some particular...
A characterization for sparse ε-regular pairs (2007)
Stefanie Gerke, Angelika Steger
We are interested in (ε)-regular bipartite graphs which are the central objects in the regularity lemma of Szemerédi for sparse graphs. A bipartite graph G = (A⊎B, E) with density p =...
On the number of K3,3-minor-free and maximal K3,3-minor-free graphs (2006)
Gerke, Stefanie, Giménez, Omer, Noy, Marc, Weissl, Andreass
"Vegeu el resum a l'inici del document del fitxer adjunt."
Probabilistic Counting Lemma for Complete Graphs (2005)
Stefanie Gerke, Martin Marciniszyn, Angelika Steger
We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi’s Regularity Lemma. More precisely, we consider the number of...
Small subsets inherit sparse ε-regularity (2004)
Stefanie Gerke, Yoshiharu Kohayakawa, Vojtěch Rödl, Angelika Steger
In this paper we investigate the behaviour of subgraphs of sparse ε-regular bipartite graphs G = (V1 ∪ V2, E) with vanishing density d that are induced by small subsets of vertices. In particular,...
Weighted colouring and channel assignment. (2000)
Thesis (Ph. D.)--University of Oxford, 2000.