Paul N. Balister

Publication Activity (10 Years)

Years Active: 2001-2016
Publications (10 Years): 1

Top Topics

Hypergraph Model

Randomly Distributed

Multi Agent Systems

Top Venues

SIAM J. Discret. Math.

Publications

Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30 (1) (2016)
Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks CoRR (2011)
Paul N. Balister, Ervin Györi, Richard H. Schelp
Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32 (4) (2011)
Paul N. Balister, Béla Bollobás
Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36 (1) (2010)
Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters
Highly connected random geometric graphs. Discret. Appl. Math. 157 (2) (2009)
Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
Algorithms for generating convex sets in acyclic digraphs. J. Discrete Algorithms 7 (4) (2009)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Connected graphs without long paths. Discret. Math. 308 (19) (2008)
Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3 (3) (2008)
Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo
Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR (2007)
Paul N. Balister, Béla Bollobás, Stefanie Gerke
The generalized Randic index of trees. J. Graph Theory 56 (4) (2007)
Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin
Convex sets in acyclic digraphs CoRR (2007)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21 (1) (2007)
Paul N. Balister, Béla Bollobás, Robert Kozma
Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms 29 (3) (2006)
Paul N. Balister, Jenö Lehel, Richard H. Schelp
Ramsey unsaturated and saturated graphs. J. Graph Theory 51 (1) (2006)
Paul N. Balister, Béla Bollobás
Pair dominating graphs. Eur. J. Comb. 27 (2) (2006)
Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory, Ser. A 113 (1) (2006)
Paul N. Balister, Béla Bollobás, Mark Walters
Continuum percolation with steps in the square or the disc. Random Struct. Algorithms 26 (4) (2005)
Paul N. Balister, Béla Bollobás, Anthony Quas
Percolation in Voronoi tilings. Random Struct. Algorithms 26 (3) (2005)
Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
Balanced edge colorings. J. Comb. Theory, Ser. B 90 (1) (2004)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13 (3) (2004)
Paul N. Balister, O. M. Riordan, Richard H. Schelp
Vertex-distinguishing edge colorings of graphs. J. Graph Theory 42 (2) (2003)
Paul N. Balister
Packing closed trails into dense graphs. J. Comb. Theory, Ser. B 88 (1) (2003)
Paul N. Balister, Béla Bollobás, Richard H. Schelp
Vertex distinguishing colorings of graphs with Delta(G)=2. Discret. Math. 252 (1-3) (2002)
Paul N. Balister, Richard H. Schelp, Miklós Simonovits
A note on Ramsey size-linear graphs. J. Graph Theory 39 (1) (2002)
Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott
Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. Eur. J. Comb. 22 (1) (2001)