Paul N. Balister

According to our database, Paul N. Balister authored at least 64 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions.

Paul Balister, Emil Powierski, Alex Scott, Jane Tan

Random Struct. Algorithms, May, 2023

2022

A Note on Infinite Antichain Density.

Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan

SIAM J. Discret. Math., 2022

2019

The asymptotic number of prefix normal words.

Paul Balister, Stefanie Gerke

Theor. Comput. Sci., 2019

Dense subgraphs in random graphs.

Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev

Discret. Appl. Math., 2019

2018

Line percolation.

Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan

Random Struct. Algorithms, 2018

On the edge spectrum of saturated graphs for paths and stars.

Paul Balister, Ali Dogan

J. Graph Theory, 2018

Decompositions of graphs into cycles with chords.

Paul Balister, Hao Li, Richard H. Schelp

J. Comb. Theory, Ser. B, 2018

Introduction.

Paul Balister, Béla Bollobás, Imre Leader, Robert Morris

Comb. Probab. Comput., 2018

2017

Catching a fast robber on the grid.

Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan

J. Comb. Theory, Ser. A, 2017

Sentry selection in sensor networks: theory and algorithms.

Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters

Int. J. Sens. Networks, 2017

2016

Random Hypergraph Irregularity.

Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne

SIAM J. Discret. Math., 2016

Barrier Coverage.

Paul Balister, Béla Bollobás, Amites Sarkar

Random Struct. Algorithms, 2016

Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs.

Paul Balister, Béla Bollobás, Karen Gunderson

Eur. J. Comb., 2016

Catching a fast robber on the grid.

Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan

CoRR, 2016

2015

Introduction.

Paul Balister

Comb. Probab. Comput., 2015

Controllability and matchings in random bipartite graphs.

Paul N. Balister, Stefanie Gerke

Proceedings of the Surveys in Combinatorics 2015, 2015

2014

Interference percolation.

Paul Balister, Béla Bollobás

Random Struct. Algorithms, 2014

2013

Repeated Degrees in Random Uniform Hypergraphs.

Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne

SIAM J. Discret. Math., 2013

2012

Critical Probabilities of 1-Independent Percolation Models.

Paul Balister, Béla Bollobás

Comb. Probab. Comput., 2012

Projections, entropy and sumsets.

Paul Balister, Béla Bollobás

Comb., 2012

2011

Random Partial Orders Defined by Angular Domains.

Paul Balister, Balázs Patkós

Order, 2011

Coloring vertices and edges of a graph by nonempty subsets of a set.

Paul N. Balister, Ervin Györi, Richard H. Schelp

Eur. J. Comb., 2011

Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies

Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry

CoRR, 2011

Energy-latency tradeoff for in-network function computation in random networks.

Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Random majority percolation.

Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters

Random Struct. Algorithms, 2010

Bond percolation with attenuation in high dimensional Voronoi tilings.

Paul N. Balister, Béla Bollobás

Random Struct. Algorithms, 2010

The Linus Sequence.

Paul Balister, Steve Kalikow, Amites Sarkar

Comb. Probab. Comput., 2010

2009

Convex Sets in Acyclic Digraphs.

Paul Balister, Stefanie Gerke, Gregory Z. Gutin

Order, 2009

Algorithms for generating convex sets in acyclic digraphs.

Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Arezou Soleimanfallah, Anders Yeo

J. Discrete Algorithms, 2009

Highly connected random geometric graphs.

Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters

Discret. Appl. Math., 2009

Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks.

Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha

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.

Paul Balister, Santosh Kumar

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Sequences with Changing Dependencies.

Paul Balister, Béla Bollobás, Stefanie Gerke

SIAM J. Discret. Math., 2008

Connectivity of addable graph classes.

Paul Balister, Béla Bollobás, Stefanie Gerke

J. Comb. Theory, Ser. B, 2008

Connectivity of a Gaussian network.

Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters

Int. J. Ad Hoc Ubiquitous Comput., 2008

Connected graphs without long paths.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

Discret. Math., 2008

2007

Adjacent Vertex Distinguishing Edge-Colorings.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

SIAM J. Discret. Math., 2007

The generalized Randic index of trees.

Paul N. Balister, Béla Bollobás, Stefanie Gerke

J. Graph Theory, 2007

Reliable density estimates for coverage and connectivity in thin strips of finite length.

Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar

Proceedings of the 13th Annual International Conference on Mobile Computing and Networking, 2007

2006

Large deviations for mean field models of probabilistic cellular automata.

Paul N. Balister, Béla Bollobás, Robert Kozma

Random Struct. Algorithms, 2006

Ramsey unsaturated and saturated graphs.

Paul N. Balister, Jenö Lehel, Richard H. Schelp

J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.

Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Comb. Theory, Ser. A, 2006

Pair dominating graphs.

Paul N. Balister, Béla Bollobás

Eur. J. Comb., 2006

2005

Continuum percolation with steps in the square or the disc.

Paul N. Balister, Béla Bollobás, Mark Walters

Random Struct. Algorithms, 2005

Percolation in Voronoi tilings.

Paul N. Balister, Béla Bollobás, Anthony Quas

Random Struct. Algorithms, 2005

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

Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman

Biol. Cybern., 2005

2004

Balanced edge colorings.

Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp

J. Comb. Theory, Ser. B, 2004

Longest Paths in Circular Arc Graphs.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

Comb. Probab. Comput., 2004

Fast transmission in ad hoc networks.

Paul Balister, Béla Bollobás, Martin Haenggi, Mark Walters

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics.

Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman

Proceedings of the Cellular Automata, 2004

2003

Vertex-distinguishing edge colorings of graphs.

Paul N. Balister, O. M. Riordan, Richard H. Schelp

J. Graph Theory, 2003

Graphs with large maximum degree containing no odd cycles of a given length.

Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp

J. Comb. Theory, Ser. B, 2003

Packing closed trails into dense graphs.

Paul N. Balister

J. Comb. Theory, Ser. B, 2003

Packing Digraphs With Directed Closed Trails.

Paul Balister

Comb. Probab. Comput., 2003

2002

Vertex-distinguishing edge colorings of random graphs.

Paul Balister

Random Struct. Algorithms, 2002

A note on Ramsey size-linear graphs.

Paul N. Balister, Richard H. Schelp, Miklós Simonovits

J. Graph Theory, 2002

Zero-sum Square Matrices.

Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster

Eur. J. Comb., 2002

The Interlace Polynomial of Graphs at - 1.

Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody

Eur. J. Comb., 2002

Vertex distinguishing colorings of graphs with Delta(G)=2.

Paul N. Balister, Béla Bollobás, Richard H. Schelp

Discret. Math., 2002

2001

Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial.

Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott

Eur. J. Comb., 2001

Packing Circuits Into KN.

Paul Balister

Comb. Probab. Comput., 2001

On The Alspach Conjecture.

Paul Balister

Comb. Probab. Comput., 2001

1999

Counting Boundary Paths for Oriented Percolation Clusters.

Paul Balister, Béla Bollobás, Alan Stacey

Random Struct. Algorithms, 1999

1994

Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions.

Paul Balister, Béla Bollobás, Alan Stacey

Random Struct. Algorithms, 1994