Paul N. Balister

Paul Balister

2009
31	EE	Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Highly connected random geometric graphs. Discrete Applied Mathematics 157(2): 309-320 (2009)
2008
30	EE	Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008)
29	EE	Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters: Connectivity of a Gaussian network. IJAHUC 3(3): 204-213 (2008)
28	EE	Paul Balister, Béla Bollobás, Stefanie Gerke: Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98(3): 577-584 (2008)
2007
27	EE	Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar: Reliable density estimates for coverage and connectivity in thin strips of finite length. MOBICOM 2007: 75-86
26	EE	Paul N. Balister, Stefanie Gerke, Gregory Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, A. Soleimanfallah, Anders Yeo: Algorithms for Generating Convex Sets in Acyclic Digraphs CoRR abs/0712.2661: (2007)
25	EE	Paul N. Balister, Stefanie Gerke, Gregory Gutin: Convex sets in acyclic digraphs CoRR abs/0712.2678: (2007)
24	EE	Paul N. Balister, Béla Bollobás, Stefanie Gerke: The generalized Randic index of trees. Journal of Graph Theory 56(4): 270-286 (2007)
23	EE	Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discrete Math. 21(1): 237-250 (2007)
2006
22	EE	Paul N. Balister, Béla Bollobás: Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006)
21	EE	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): 101-112 (2006)
20	EE	Paul N. Balister, Jenö Lehel, Richard H. Schelp: Ramsey unsaturated and saturated graphs. Journal of Graph Theory 51(1): 22-32 (2006)
19	EE	Paul N. Balister, Béla Bollobás, Robert Kozma: Large deviations for mean field models of probabilistic cellular automata. Random Struct. Algorithms 29(3): 399-415 (2006)
2005
18	EE	Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman: Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions. Biological Cybernetics 92(6): 367-379 (2005)
17	EE	Paul N. Balister, Béla Bollobás, Anthony Quas: Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005)
16	EE	Paul N. Balister, Béla Bollobás, Mark Walters: Continuum percolation with steps in the square or the disc. Random Struct. Algorithms 26(4): 392-403 (2005)
2004
15	EE	Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman: Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. ACRI 2004: 435-443
14		Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Longest Paths in Circular Arc Graphs. Combinatorics, Probability & Computing 13(3): 311-317 (2004)
13	EE	Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp: Balanced edge colorings. J. Comb. Theory, Ser. B 90(1): 3-20 (2004)
2003
12		Paul Balister: Packing Digraphs With Directed Closed Trails. Combinatorics, Probability & Computing 12(1): (2003)
11	EE	Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp: Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87(2): 366-373 (2003)
10	EE	Paul N. Balister: Packing closed trails into dense graphs. J. Comb. Theory, Ser. B 88(1): 107-118 (2003)
2002
9	EE	Paul N. Balister, Béla Bollobás, Richard H. Schelp: Vertex distinguishing colorings of graphs with Delta(G)=2. Discrete Mathematics 252(1-3): 17-29 (2002)
8	EE	Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster: Zero-sum Square Matrices. Eur. J. Comb. 23(5): 489-497 (2002)
7	EE	Paul Balister, Béla Bollobás, J. Cutler, Luke Pebody: The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. 23(7): 761-767 (2002)
6		Paul Balister: Vertex-distinguishing edge colorings of random graphs. Random Struct. Algorithms 20(1): 89-97 (2002)
2001
5		Paul Balister: On The Alspach Conjecture. Combinatorics, Probability & Computing 10(2): (2001)
4		Paul Balister: Packing Circuits Into KN. Combinatorics, Probability & Computing 10(6): (2001)
3	EE	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): 1-4 (2001)
1999
2		Paul Balister, Béla Bollobás, Alan Stacey: Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999)
1994
1		Paul Balister, Béla Bollobás, Alan Stacey: Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. Random Struct. Algorithms 5(4): 573-590 (1994)

Coauthor Index

1	Béla Bollobás	[1] [2] [3] [7] [9] [11] [15] [16] [17] [18] [19] [22] [24] [27] [28] [29] [31]
2	Yair Caro	[8]
3	J. Cutler	[7]
4	Walter J. Freeman	[15] [18]
5	Stefanie Gerke	[24] [25] [26] [28]
6	Gregory Gutin	[25] [26]
7	András Gyárfás	[21]
8	Ervin Györi	[14] [23] [30]
9	Adrian Johnstone	[26]
10	Alexandr V. Kostochka	[13]
11	Robert Kozma	[15] [18] [19]
12	Santosh Kumar	[27]
13	Jenö Lehel (Jeno Lehel)	[14] [20] [21] [23] [30]
14	Hao Li	[13]
15	Luke Pebody	[7]
16	Marko Puljic	[15] [18]
17	Anthony Quas	[17]
18	Joseph Reddington	[26]
19	Oliver Riordan	[3] [11]
20	Cecil C. Rousseau	[8]
21	Amites Sarkar	[27] [29] [31]
22	Richard H. Schelp	[9] [11] [13] [14] [20] [21] [23] [30]
23	Alex D. Scott (Alexander D. Scott)	[3]
24	Elizabeth Scott	[26]
25	A. Soleimanfallah	[26]
26	Alan Stacey	[1] [2]
27	Mark Walters	[16] [29] [31]
28	Anders Yeo	[26]
29	Raphael Yuster	[8]