18 citations · 18 across the 4 of their papers we have counts for
4 papers
Convex sets in acyclic digraphs
P. Balister, S. Gerke, G. Gutin
A non-empty set of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by is connected and it is called convex if no two vertices…
Algorithms for Generating Convex Sets in Acyclic Digraphs
P. Balister, S. Gerke, G. Gutin +5
A set of vertices of an acyclic digraph is convex if and there is no directed path between vertices of which contains a vertex not in . A set i…
A critical constant for the k nearest neighbour model
Paul Balister, Bela Bollobas, Amites Sarkar +1
Let P be a Poisson process of intensity one in a square S_n of area n. For a fixed integer k, join every point of P to its k nearest neighbours, creating an undirected random geome…
Continuum percolation with steps in an annulus
Paul Balister, Bela Bollobas, Mark Walters
Let A be the annulus in R^2 centered at the origin with inner and outer radii r(1-ε) and r, respectively. Place points {x_i} in R^2 according to a Poisson process with intensity 1…