Paul N. Balister

According to our database1, Paul N. Balister authored at least 62 papers between 1994 and 2019.

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



In proceedings 
PhD thesis 





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

Dense subgraphs in random graphs.
Discret. Appl. Math., 2019

Line percolation.
Random Struct. Algorithms, 2018

On the edge spectrum of saturated graphs for paths and stars.
J. Graph Theory, 2018

Decompositions of graphs into cycles with chords.
J. Comb. Theory, Ser. B, 2018

Comb. Probab. Comput., 2018

Catching a fast robber on the grid.
J. Comb. Theory, Ser. A, 2017

Sentry selection in sensor networks: theory and algorithms.
Int. J. Sens. Networks, 2017

Random Hypergraph Irregularity.
SIAM J. Discret. Math., 2016

Barrier Coverage.
Random Struct. Algorithms, 2016

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs.
Eur. J. Comb., 2016

Catching a fast robber on the grid.
CoRR, 2016

Comb. Probab. Comput., 2015

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

Interference percolation.
Random Struct. Algorithms, 2014

Repeated Degrees in Random Uniform Hypergraphs.
SIAM J. Discret. Math., 2013

Critical Probabilities of 1-Independent Percolation Models.
Comb. Probab. Comput., 2012

Projections, entropy and sumsets.
Comb., 2012

Random Partial Orders Defined by Angular Domains.
Order, 2011

Coloring vertices and edges of a graph by nonempty subsets of a set.
Eur. J. Comb., 2011

Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies
CoRR, 2011

Energy-latency tradeoff for in-network function computation in random networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Random majority percolation.
Random Struct. Algorithms, 2010

Bond percolation with attenuation in high dimensional Voronoi tilings.
Random Struct. Algorithms, 2010

The Linus Sequence.
Comb. Probab. Comput., 2010

Convex Sets in Acyclic Digraphs.
Order, 2009

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

Highly connected random geometric graphs.
Discret. Appl. Math., 2009

Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

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

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

Connectivity of a Gaussian network.
Int. J. Ad Hoc Ubiquitous Comput., 2008

Connected graphs without long paths.
Discret. Math., 2008

Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discret. Math., 2007

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

Reliable density estimates for coverage and connectivity in thin strips of finite length.
Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

Large deviations for mean field models of probabilistic cellular automata.
Random Struct. Algorithms, 2006

Ramsey unsaturated and saturated graphs.
J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.
J. Comb. Theory, Ser. A, 2006

Pair dominating graphs.
Eur. J. Comb., 2006

Continuum percolation with steps in the square or the disc.
Random Struct. Algorithms, 2005

Percolation in Voronoi tilings.
Random Struct. Algorithms, 2005

Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions.
Biol. Cybern., 2005

Balanced edge colorings.
J. Comb. Theory, Ser. B, 2004

Longest Paths in Circular Arc Graphs.
Comb. Probab. Comput., 2004

Fast transmission in ad hoc networks.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics.
Proceedings of the Cellular Automata, 2004

Vertex-distinguishing edge colorings of graphs.
J. Graph Theory, 2003

Graphs with large maximum degree containing no odd cycles of a given length.
J. Comb. Theory, Ser. B, 2003

Packing closed trails into dense graphs.
J. Comb. Theory, Ser. B, 2003

Packing Digraphs With Directed Closed Trails.
Comb. Probab. Comput., 2003

Vertex-distinguishing edge colorings of random graphs.
Random Struct. Algorithms, 2002

A note on Ramsey size-linear graphs.
J. Graph Theory, 2002

Zero-sum Square Matrices.
Eur. J. Comb., 2002

The Interlace Polynomial of Graphs at - 1.
Eur. J. Comb., 2002

Vertex distinguishing colorings of graphs with Delta(G)=2.
Discret. Math., 2002

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.
Eur. J. Comb., 2001

Packing Circuits Into KN.
Comb. Probab. Comput., 2001

On The Alspach Conjecture.
Comb. Probab. Comput., 2001

Counting Boundary Paths for Oriented Percolation Clusters.
Random Struct. Algorithms, 1999

Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions.
Random Struct. Algorithms, 1994