default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul N. Balister
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j57]Paul Balister
, Ali Dogan:
Path Saturation Game on Six Vertices. Graphs Comb. 40(3): 45 (2024)- [j56]Paul Balister, Béla Bollobás, Robert Morris, Paul Smith:
Subcritical monotone cellular automata. Random Struct. Algorithms 64(1): 38-61 (2024) - 2023
- [j55]Paul Balister, Emil Powierski, Alex Scott, Jane Tan:
Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions. Random Struct. Algorithms 62(3): 564-584 (2023) - 2022
- [j54]Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan:
A Note on Infinite Antichain Density. SIAM J. Discret. Math. 36(1): 573-577 (2022)
2010 – 2019
- 2019
- [j53]Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev:
Dense subgraphs in random graphs. Discret. Appl. Math. 260: 66-74 (2019) - [j52]Paul Balister, Stefanie Gerke:
The asymptotic number of prefix normal words. Theor. Comput. Sci. 784: 75-80 (2019) - 2018
- [j51]Paul Balister, Béla Bollobás, Imre Leader, Robert Morris:
Introduction. Comb. Probab. Comput. 27(4): 441 (2018) - [j50]Paul Balister, Hao Li, Richard H. Schelp:
Decompositions of graphs into cycles with chords. J. Comb. Theory B 128: 47-65 (2018) - [j49]Paul Balister, Ali Dogan:
On the edge spectrum of saturated graphs for paths and stars. J. Graph Theory 89(4): 364-385 (2018) - [j48]Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan:
Line percolation. Random Struct. Algorithms 52(4): 597-616 (2018) - 2017
- [j47]Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters:
Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks 24(3): 139-148 (2017) - [j46]Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. J. Comb. Theory A 152: 341-352 (2017) - 2016
- [j45]Paul Balister, Béla Bollobás, Karen Gunderson:
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. Eur. J. Comb. 57: 85-93 (2016) - [j44]Paul Balister, Béla Bollobás, Amites Sarkar:
Barrier Coverage. Random Struct. Algorithms 49(3): 429-478 (2016) - [j43]Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30(1): 465-473 (2016) - [i5]Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan:
Catching a fast robber on the grid. CoRR abs/1609.01002 (2016) - 2015
- [j42]Paul Balister:
Introduction. Comb. Probab. Comput. 24(4): 584 (2015) - [p1]Paul N. Balister, Stefanie Gerke:
Controllability and matchings in random bipartite graphs. Surveys in Combinatorics 2015: 119-146 - 2014
- [j41]Paul Balister, Béla Bollobás:
Interference percolation. Random Struct. Algorithms 44(4): 399-418 (2014) - 2013
- [j40]Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27(1): 145-154 (2013) - 2012
- [j39]Paul Balister, Béla Bollobás:
Projections, entropy and sumsets. Comb. 32(2): 125-141 (2012) - [j38]Paul Balister, Béla Bollobás:
Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. 21(1-2): 11-22 (2012) - 2011
- [j37]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): 533-537 (2011) - [j36]Paul Balister, Balázs Patkós:
Random Partial Orders Defined by Angular Domains. Order 28(2): 341-355 (2011) - [c6]Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky:
Energy-latency tradeoff for in-network function computation in random networks. INFOCOM 2011: 1575-1583 - [i4]Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky:
Energy-Latency Tradeoff for In-Network Function Computation in Random Networks. CoRR abs/1101.0858 (2011) - [i3]Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry:
Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies. CoRR abs/1103.5957 (2011) - 2010
- [j35]Paul Balister, Steve Kalikow, Amites Sarkar:
The Linus Sequence. Comb. Probab. Comput. 19(1): 21-46 (2010) - [j34]Paul N. Balister, Béla Bollobás:
Bond percolation with attenuation in high dimensional Voronoi tilings. Random Struct. Algorithms 36(1): 5-10 (2010) - [j33]Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters:
Random majority percolation. Random Struct. Algorithms 36(3): 315-340 (2010)
2000 – 2009
- 2009
- [j32]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Highly connected random geometric graphs. Discret. Appl. Math. 157(2): 309-320 (2009) - [j31]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): 509-518 (2009) - [j30]Paul Balister, Stefanie Gerke, Gregory Z. Gutin:
Convex Sets in Acyclic Digraphs. Order 26(1): 95-100 (2009) - [c5]Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha:
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks. INFOCOM 2009: 136-144 - [c4]Paul Balister, Santosh Kumar:
Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors. INFOCOM 2009: 2896-2900 - 2008
- [j29]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Connected graphs without long paths. Discret. Math. 308(19): 4487-4494 (2008) - [j28]Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters:
Connectivity of a Gaussian network. Int. J. Ad Hoc Ubiquitous Comput. 3(3): 204-213 (2008) - [j27]Paul Balister, Béla Bollobás, Stefanie Gerke:
Connectivity of addable graph classes. J. Comb. Theory B 98(3): 577-584 (2008) - [j26]Paul Balister, Béla Bollobás, Stefanie Gerke:
Sequences with Changing Dependencies. SIAM J. Discret. Math. 22(3): 1149-1154 (2008) - 2007
- [j25]Paul N. Balister, Béla Bollobás, Stefanie Gerke:
The generalized Randic index of trees. J. Graph Theory 56(4): 270-286 (2007) - [j24]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21(1): 237-250 (2007) - [c3]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 - [i2]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 abs/0712.2661 (2007) - [i1]Paul N. Balister, Stefanie Gerke, Gregory Z. Gutin:
Convex sets in acyclic digraphs. CoRR abs/0712.2678 (2007) - 2006
- [j23]Paul N. Balister, Béla Bollobás:
Pair dominating graphs. Eur. J. Comb. 27(2): 322-328 (2006) - [j22]Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp:
Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory A 113(1): 101-112 (2006) - [j21]Paul N. Balister, Jenö Lehel, Richard H. Schelp:
Ramsey unsaturated and saturated graphs. J. Graph Theory 51(1): 22-32 (2006) - [j20]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
- [j19]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. Biol. Cybern. 92(6): 367-379 (2005) - [j18]Paul N. Balister, Béla Bollobás, Anthony Quas:
Percolation in Voronoi tilings. Random Struct. Algorithms 26(3): 310-318 (2005) - [j17]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
- [j16]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13(3): 311-317 (2004) - [j15]Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp:
Balanced edge colorings. J. Comb. Theory B 90(1): 3-20 (2004) - [c2]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 - [c1]Paul Balister, Béla Bollobás, Martin Haenggi, Mark Walters:
Fast transmission in ad hoc networks. ISIT 2004: 19 - 2003
- [j14]Paul Balister:
Packing Digraphs With Directed Closed Trails. Comb. Probab. Comput. 12(1): 1-15 (2003) - [j13]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 B 87(2): 366-373 (2003) - [j12]Paul N. Balister:
Packing closed trails into dense graphs. J. Comb. Theory B 88(1): 107-118 (2003) - [j11]Paul N. Balister, O. M. Riordan, Richard H. Schelp:
Vertex-distinguishing edge colorings of graphs. J. Graph Theory 42(2): 95-109 (2003) - 2002
- [j10]Paul N. Balister, Béla Bollobás, Richard H. Schelp:
Vertex distinguishing colorings of graphs with Delta(G)=2. Discret. Math. 252(1-3): 17-29 (2002) - [j9]Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster:
Zero-sum Square Matrices. Eur. J. Comb. 23(5): 489-497 (2002) - [j8]Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody:
The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. 23(7): 761-767 (2002) - [j7]Paul N. Balister, Richard H. Schelp, Miklós Simonovits:
A note on Ramsey size-linear graphs. J. Graph Theory 39(1): 1-5 (2002) - [j6]Paul Balister:
Vertex-distinguishing edge colorings of random graphs. Random Struct. Algorithms 20(1): 89-97 (2002) - 2001
- [j5]Paul Balister:
On The Alspach Conjecture. Comb. Probab. Comput. 10(2): 95-125 (2001) - [j4]Paul Balister:
Packing Circuits Into KN. Comb. Probab. Comput. 10(6) (2001) - [j3]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)
1990 – 1999
- 1999
- [j2]Paul Balister, Béla Bollobás, Alan Stacey:
Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999) - 1994
- [j1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
