Search the dblp DataBase

Publications of Author

1. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
   Longest Paths in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
   Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:311-317 [Journal]
   
2. Paul N. Balister, Béla Bollobás, Richard H. Schelp
   Vertex distinguishing colorings of graphs with Delta(G)=2. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:252, n:1-3, pp:17-29 [Journal]
   
3. Paul N. Balister, Béla Bollobás
   Pair dominating graphs. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2006, v:27, n:2, pp:322-328 [Journal]
   
4. Paul N. Balister, Béla Bollobás, Oliver Riordan, Alex D. Scott
   Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2001, v:22, n:1, pp:1-4 [Journal]
   
5. Paul N. Balister
   Packing closed trails into dense graphs. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2003, v:88, n:1, pp:107-118 [Journal]
   
6. Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
   Mono-multi bipartite Ramsey numbers, designs, and matrices. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:101-112 [Journal]
   
7. Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
   Balanced edge colorings. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:3-20 [Journal]
   
8. Paul N. Balister, Béla Bollobás, Robert Kozma
   Large deviations for mean field models of probabilistic cellular automata. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2006, v:29, n:3, pp:399-415 [Journal]
   
9. Paul N. Balister, Béla Bollobás, Anthony Quas
   Percolation in Voronoi tilings. [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 2005, v:26, n:3, pp:310-318 [Journal]
   
10. Paul N. Balister, Béla Bollobás, Mark Walters
    Continuum percolation with steps in the square or the disc. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:4, pp:392-403 [Journal]
    
11. Paul N. Balister, Jenö Lehel, Richard H. Schelp
    Ramsey unsaturated and saturated graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:1, pp:22-32 [Journal]
    
12. 
    Algorithms for Generating Convex Sets in Acyclic Digraphs [Citation Graph (, )][DBLP]
    
    
13. 
    Convex sets in acyclic digraphs [Citation Graph (, )][DBLP]
    
    
14. 
    Highly connected random geometric graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    Connected graphs without long paths. [Citation Graph (, )][DBLP]