Paul Balister

2.2k total citations
79 papers, 1.2k citations indexed

About

Paul Balister is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Mathematical Physics. According to data from OpenAlex, Paul Balister has authored 79 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 30 papers in Discrete Mathematics and Combinatorics and 24 papers in Mathematical Physics. Recurrent topics in Paul Balister's work include Limits and Structures in Graph Theory (27 papers), Stochastic processes and statistical mechanics (21 papers) and Graph Labeling and Dimension Problems (18 papers). Paul Balister is often cited by papers focused on Limits and Structures in Graph Theory (27 papers), Stochastic processes and statistical mechanics (21 papers) and Graph Labeling and Dimension Problems (18 papers). Paul Balister collaborates with scholars based in United States, United Kingdom and Brazil. Paul Balister's co-authors include Béla Bollobás, R. H. Schelp, Santosh Kumar, Amites Sarkar, Mark Walters, B Bollobás, Jenő Lehel, Róbert Kozma, Oliver Riordan and Marko Puljic and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Communications in Mathematical Physics and Transactions of the American Mathematical Society.

In The Last Decade

Paul Balister

74 papers receiving 1.1k citations

Peers

Paul Balister

CTM

CNC

EEE

DMC

Robert Morris Brazil

Eyal Lubetzky United States

Yuliy Baryshnikov United States

József Balogh United States

N. C. Wormald Australia

Roman Smolensky United States

Balázs Szegedy Hungary

Miklós Bóna United States

Charles Bordenave France

Michael J. Tsatsomeros United States

Robert Morris Brazil

Paul Balister

400 ×0.8

CTM

117 ×0.3

CNC

58 ×0.2

EEE

350 ×1.7

DMC

293 ×1.5

Citations per year, relative to Paul Balister Paul Balister (= 1×) peers Robert Morris

Countries citing papers authored by Paul Balister

Since Specialization

Citations

This map shows the geographic impact of Paul Balister's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Paul Balister with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Balister more than expected).

Fields of papers citing papers by Paul Balister

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paul Balister. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Paul Balister. The network helps show where Paul Balister may publish in the future.

Co-authorship network of co-authors of Paul Balister

This figure shows the co-authorship network connecting the top 25 collaborators of Paul Balister. A scholar is included among the top collaborators of Paul Balister based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Paul Balister. Paul Balister is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Balister, Paul, et al.. (2025). Improved bounds for 1-independent percolation on Zn. Electronic Journal of Probability. 30(none). 1 indexed citations

Balister, Paul, Hao Li, & R. H. Schelp. (2017). Decompositions of graphs into cycles with chords. Journal of Combinatorial Theory Series B. 128. 47–65. 5 indexed citations

Balister, Paul, Ervin Győri, & R. H. Schelp. (2011). Coloring vertices and edges of a graph by nonempty subsets of a set. European Journal of Combinatorics. 32(4). 533–537. 4 indexed citations

Balister, Paul, Béla Bollobás, Amites Sarkar, & Mark Walters. (2010). Sentry Selection in Wireless Networks. Advances in Applied Probability. 42(1). 1–25. 3 indexed citations

Balister, Paul, Béla Bollobás, Amites Sarkar, & Mark Walters. (2010). Sentry Selection in Wireless Networks. Advances in Applied Probability. 42(1). 1–25. 9 indexed citations

Balister, Paul, Béla Bollobás, & Mark Walters. (2009). Random transceiver networks. Advances in Applied Probability. 41(2). 323–343.

Balister, Paul, Béla Bollobás, & Mark Walters. (2009). Random transceiver networks. Advances in Applied Probability. 41(2). 323–343. 1 indexed citations

Balister, Paul, Stefanie Gerke, Gregory Gutin, et al.. (2008). Algorithms for generating convex sets in acyclic digraphs. Journal of Discrete Algorithms. 7(4). 509–518. 10 indexed citations

Balister, Paul, Béla Bollobás, & Stefanie Gerke. (2007). Connectivity of addable graph classes. Journal of Combinatorial Theory Series B. 98(3). 577–584. 10 indexed citations

10.

Balister, Paul, Béla Bollobás, Amites Sarkar, & Mark Walters. (2005). Connectivity of random k-nearest-neighbour graphs. Advances in Applied Probability. 37(1). 1–24. 12 indexed citations

11.

Balister, Paul, Béla Bollobás, Amites Sarkar, & Mark Walters. (2005). Connectivity of random k-nearest-neighbour graphs. Advances in Applied Probability. 37(1). 1–24. 55 indexed citations

12.

Balister, Paul, et al.. (2005). Mono-multi bipartite Ramsey numbers, designs, and matrices. Journal of Combinatorial Theory Series A. 113(1). 101–112. 9 indexed citations

13.

Balister, Paul & Béla Bollobás. (2005). Pair dominating graphs. European Journal of Combinatorics. 27(2). 322–328. 1 indexed citations

14.

Balister, Paul, B Bollobás, & Anthony Quas. (2004). Percolation in Voronoi tilings. Random Structures and Algorithms. 26(3). 310–318. 5 indexed citations

15.

Balister, Paul. (2003). Packing closed trails into dense graphs. Journal of Combinatorial Theory Series B. 88(1). 107–118. 13 indexed citations

16.

Balister, Paul, Béla Bollobás, Oliver Riordan, & R. H. Schelp. (2003). Graphs with large maximum degree containing no odd cycles of a given length. Journal of Combinatorial Theory Series B. 87(2). 366–373. 9 indexed citations

17.

Balister, Paul, B Bollobás, & R. H. Schelp. (2002). Vertex distinguishing colorings of graphs with Δ(G)=2. Discrete Mathematics. 252(1-3). 17–29. 51 indexed citations

18.

Balister, Paul, et al.. (2002). The Interlace Polynomial of Graphs at − 1. European Journal of Combinatorics. 23(7). 761–767. 20 indexed citations

19.

Balister, Paul, Yair Caro, Cecil Rousseau, & Raphael Yuster. (2002). Zero-sum Square Matrices. European Journal of Combinatorics. 23(5). 489–497. 4 indexed citations

20.

Balister, Paul, Béla Bollobás, & Alan Stacey. (1993). Upper bounds for the critical probability of oriented percolation in two dimensions. Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences. 440(1908). 201–220. 7 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact