Search the dblp DataBase
Béla Bollobás :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Béla Bollobás , Gautam Das , Dimitrios Gunopulos , Heikki Mannila Time-Series Similarity Problems and Well-Separated Geometric Sets. [Citation Graph (1, 0)][DBLP ] Symposium on Computational Geometry, 1997, pp:454-456 [Conf ] Robert Kozma , Marko Puljic , Paul Balister , Béla Bollobás , Walter J. Freeman Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. [Citation Graph (0, 0)][DBLP ] ACRI, 2004, pp:435-443 [Conf ] Sanjeev Arora , Béla Bollobás , László Lovász Proving Integrality Gaps without Knowing the Linear Program. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:313-322 [Conf ] Yair Bartal , Béla Bollobás , Manor Mendel A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems. [Citation Graph (0, 0)][DBLP ] FOCS, 2001, pp:396-405 [Conf ] Béla Bollobás , Bruce A. Reed , Andrew Thomason An extremal function for the achromatic number. [Citation Graph (0, 0)][DBLP ] Graph Structure Theory, 1991, pp:161-166 [Conf ] Noam Berger , Béla Bollobás , Christian Borgs , Jennifer T. Chayes , Oliver Riordan Degree Distribution of the FKP Network Model. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:725-738 [Conf ] Béla Bollobás , Guy Kindler , Imre Leader , Ryan O'Donnell Eliminating Cycles in the Discrete Torus. [Citation Graph (0, 0)][DBLP ] LATIN, 2006, pp:202-210 [Conf ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin The interlace polynomial: a new graph polynomial. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:237-245 [Conf ] Béla Bollobás , Christian Borgs , Jennifer T. Chayes , Oliver Riordan Directed scale-free graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:132-139 [Conf ] Béla Bollobás , Don Coppersmith , Michael Elkin Sparse distance preservers and additive spanners. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:414-423 [Conf ] Béla Bollobás , Trevor I. Fenner , Alan M. Frieze An Algorithm for Finding Hamilton Cycles in a Random Graph [Citation Graph (0, 0)][DBLP ] STOC, 1985, pp:430-439 [Conf ] Béla Bollobás , István Simon On the Expected Behaviour of Disjoint Set Union Algorithms [Citation Graph (0, 0)][DBLP ] STOC, 1985, pp:224-231 [Conf ] Béla Bollobás , Oliver Riordan The Phase Transition and Connectedness in Uniformly Grown Random Graphs. [Citation Graph (0, 0)][DBLP ] WAW, 2004, pp:1-18 [Conf ] Béla Bollobás , Paul Erdös Graphs of Extremal Weights. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:50, n:, pp:- [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Biological Cybernetics, 2005, v:92, n:6, pp:367-379 [Journal ] József Balogh , Béla Bollobás Unavoidable Traces Of Set Systems. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2005, v:25, n:6, pp:633-643 [Journal ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin A Two-Variable Interlace Polynomial. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:4, pp:567-584 [Journal ] Béla Bollobás , Imre Leader Edge-isoperimetric inequalities in the grid. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:4, pp:299-314 [Journal ] Béla Bollobás Long paths in sparse random graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1982, v:2, n:3, pp:223-228 [Journal ] Béla Bollobás The chromatic number of random graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1988, v:8, n:1, pp:49-55 [Journal ] Béla Bollobás , Graham Brightwell Cycles through specified vertices. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1993, v:13, n:2, pp:147-155 [Journal ] Béla Bollobás , Paul Erdös , Joel Spencer , Douglas B. West Clique coverings of the edges of a random graph. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1993, v:13, n:1, pp:1-5 [Journal ] Béla Bollobás , Trevor I. Fenner , Alan M. Frieze An algorithm for finding Hamilton cycles in a random graph. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1987, v:7, n:4, pp:327-341 [Journal ] Béla Bollobás , David Gamarnik , Oliver Riordan , Benny Sudakov On the Value of a Random Minimum Weight Steiner Tree. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:2, pp:187-207 [Journal ] Béla Bollobás , Victor Klee Diameters of random bipartite graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1984, v:4, n:1, pp:7-19 [Journal ] Béla Bollobás , Yoshiharu Kohayakawa An Extension of the Erdös-Stone Theorem. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1994, v:14, n:3, pp:279-286 [Journal ] Béla Bollobás , Imre Leader Set Systems with few Disjoint Pairs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2003, v:23, n:4, pp:559-570 [Journal ] Béla Bollobás , Oliver Riordan The Diameter of a Scale-Free Random Graph. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2004, v:24, n:1, pp:5-34 [Journal ] Béla Bollobás , Alex D. Scott Exact Bounds for Judicious Partitions of Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1999, v:19, n:4, pp:473-486 [Journal ] Béla Bollobás , Andrew Thomason The Structure of Hereditary Properties and Colourings of Random Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2000, v:20, n:2, pp:173-202 [Journal ] Béla Bollobás , Andrew Thomason Threshold functions. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1987, v:7, n:1, pp:35-38 [Journal ] Béla Bollobás , Andrew Thomason Highly Linked Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1996, v:16, n:3, pp:313-320 [Journal ] Béla Bollobás , Wenceslas Fernandez de la Vega The diameter of random regular graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1982, v:2, n:2, pp:125-134 [Journal ] Béla Bollobás , Vladimir Nikiforov Degree Powers in Graphs with Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal ] Béla Bollobás , Oliver Riordan Constrained Graph Processes. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2000, v:7, n:, pp:- [Journal ] Yair Bartal , Béla Bollobás , Manor Mendel Ramsey-type theorems for metric spaces with applications to online problems [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Béla Bollobás How Sharp is the Concentration of the Chromatic Number? [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2004, v:13, n:1, pp:115-117 [Journal ] Béla Bollobás , Graham Brightwell , Yoshiharu Kohayakawa , Imre Leader , Alex D. Scott Special Issue on Ramsey Theory. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:467-468 [Journal ] Béla Bollobás , Imre Leader Isoperimetric Problems for r-sets. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2004, v:13, n:2, pp:277-279 [Journal ] Béla Bollobás , Alex D. Scott Max Cut for Random Graphs with a Planted Partition. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:451-474 [Journal ] Béla Bollobás , Andrew Thomason Frank Ramsey. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:469-475 [Journal ] Richard Arratia , Béla Bollobás , Don Coppersmith , Gregory B. Sorkin Euler circuits and DNA sequencing by hybridization. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2000, v:104, n:1-3, pp:63-96 [Journal ] József Balogh , Béla Bollobás , David Weinreich Measures on monotone properties of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:17-36 [Journal ] Béla Bollobás , Graham Brightwell Random Walks and Electrical Resistances in Products of Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:73, n:1, pp:69-79 [Journal ] Béla Bollobás , Imre Leader Matchings and Paths in the Cube. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1997, v:75, n:1, pp:1-8 [Journal ] Noga Alon , József Balogh , Béla Bollobás , Tamás Szabó Game domination number. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:256, n:1-2, pp:23-33 [Journal ] 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 ] Béla Bollobás , Andrew Thomason Set colourings of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:10-11, pp:948-952 [Journal ] Béla Bollobás , Paul Erdös , Ralph J. Faudree , Cecil C. Rousseau , Richard H. Schelp Random induced graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:248, n:1-3, pp:249-254 [Journal ] Béla Bollobás , Vladimir Nikiforov Hermitian matrices and graphs: singular values and discrepancy. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:285, n:1-3, pp:17-32 [Journal ] Béla Bollobás , Vladimir Nikiforov Graphs and Hermitian matrices: eigenvalue interlacing. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:289, n:1-3, pp:119-127 [Journal ] Béla Bollobás , Oliver Riordan Polychromatic polynomials. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:219, n:1-3, pp:1-7 [Journal ] Béla Bollobás , Amites Sarkar Paths of length four. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2003, v:265, n:1-3, pp:357-363 [Journal ] Béla Bollobás , Douglas B. West A note on generalized chromatic number and generalized girth. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:213, n:1-3, pp:29-34 [Journal ] 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 ] Paul Balister , Béla Bollobás , J. Cutler , Luke Pebody The Interlace Polynomial of Graphs at - 1. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2002, v:23, n:7, pp:761-767 [Journal ] 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 ] Béla Bollobás , Graham Brightwell , Alexander Sidorenko Geometrical Techniques for Estimating Numbers of Linear Extensions. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1999, v:20, n:5, pp:329-335 [Journal ] Béla Bollobás , Yoshiharu Kohayakawa Percolation in High Dimensions. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1994, v:15, n:2, pp:113-125 [Journal ] Béla Bollobás , Vladimir Nikiforov Books in graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2005, v:26, n:2, pp:259-270 [Journal ] Béla Bollobás , Oleg Pikhurko Integer sets with prescribed pairwise differences being distinct. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2005, v:26, n:5, pp:607-616 [Journal ] József Balogh , Béla Bollobás , David Weinreich The Penultimate Rate of Growth for Graph Properties. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2001, v:22, n:3, pp:277-289 [Journal ] Béla Bollobás , Alex D. Scott Judicious Partitions of 3-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2000, v:21, n:3, pp:289-300 [Journal ] Béla Bollobás , Andrew Thomason Proof of a Conjecture of Mader, Erdös and Hajnal on Topological Complete Subgraphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1998, v:19, n:8, pp:883-887 [Journal ] József Balogh , Béla Bollobás , Robert Morris Hereditary properties of partitions, ordered graphs and ordered hypergraphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2006, v:27, n:8, pp:1263-1281 [Journal ] Béla Bollobás , Alex D. Scott On separating systems. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2007, v:28, n:4, pp:1068-1071 [Journal ] Béla Bollobás , Andrei Z. Broder , István Simon The Cost Distribution of Clustering in Random Probing [Citation Graph (0, 0)][DBLP ] J. ACM, 1990, v:37, n:2, pp:224-237 [Journal ] Béla Bollobás , Trevor I. Fenner , Alan M. Frieze On the Best Case of Heapsort. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1996, v:20, n:2, pp:205-217 [Journal ] Béla Bollobás , István Simon Repeated Random Insertion into a Priority Queue. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1985, v:6, n:4, pp:466-477 [Journal ] Béla Bollobás , Jair Donadelli , Yoshiharu Kohayakawa , Richard H. Schelp Ramsey minimal graphs. [Citation Graph (0, 0)][DBLP ] J. Braz. Comp. Soc., 2001, v:7, n:3, pp:27-37 [Journal ] Yair Bartal , Béla Bollobás , Manor Mendel Ramsey-type theorems for metric spaces with applications to online problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:5, pp:890-921 [Journal ] Noga Alon , Béla Bollobás , Michael Krivelevich , Benny Sudakov Maximum cuts and judicious partitions in graphs without short cycles. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:329-346 [Journal ] Paul Balister , Béla Bollobás , Oliver Riordan , Richard H. Schelp Graphs with large maximum degree containing no odd cycles of a given length. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:366-373 [Journal ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin The interlace polynomial of a graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:199-233 [Journal ] József Balogh , Béla Bollobás , Miklós Simonovits The number of graphs without forbidden subgraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:1-24 [Journal ] József Balogh , Béla Bollobás , David Weinreich The Speed of Hereditary Properties of Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2000, v:79, n:2, pp:131-156 [Journal ] József Balogh , Béla Bollobás , David Weinreich A jump to the bell number for hereditary graph properties. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2005, v:95, n:1, pp:29-48 [Journal ] Béla Bollobás Evaluations of the Circuit Partition Polynomial. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2002, v:85, n:2, pp:261-268 [Journal ] Béla Bollobás Sperner Systems Consisting of Pairs of Complementary Subsets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1973, v:15, n:3, pp:363-366 [Journal ] Béla Bollobás Helly Families of Maximal Size. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1979, v:26, n:2, pp:197-200 [Journal ] Béla Bollobás The number of unrelated partitions. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:389-391 [Journal ] Béla Bollobás Turán's Theorem and Maximal Degrees. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:160-164 [Journal ] Béla Bollobás , Pierre Duchet On Helly families of maximal size. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:290-296 [Journal ] Béla Bollobás , Richard K. Guy Equitable and proportional coloring of trees. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:34, n:2, pp:177-186 [Journal ] Béla Bollobás , Roland Häggkvist Powers of Hamilton cycles in tournaments. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:309-318 [Journal ] Béla Bollobás , Alexandr V. Kostochka , Richard H. Schelp Local and Mean Ramsey Numbers for Trees. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2000, v:79, n:1, pp:100-103 [Journal ] Béla Bollobás , Peter Keevash , Benny Sudakov Multicoloured extremal problems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2004, v:107, n:2, pp:295-312 [Journal ] Béla Bollobás , Imre Leader The Angel and the Devil in three dimensions. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:176-184 [Journal ] Béla Bollobás , Imre Leader Compressions and isoperimetric inequalities. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1991, v:56, n:1, pp:47-62 [Journal ] Béla Bollobás , Imre Leader Isoperimetric inequalities and fractional set systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1991, v:56, n:1, pp:63-74 [Journal ] Béla Bollobás , Brendan D. McKay The number of matchings in random regular graphs and bipartite graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:80-91 [Journal ] Béla Bollobás , Luke Pebody , Oliver Riordan Contraction-Deletion Invariants for Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:320-345 [Journal ] Béla Bollobás , Oliver Riordan Disjointly representing set systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2003, v:102, n:1, pp:1-9 [Journal ] Béla Bollobás , A. J. Radcliffe Defect Sauer Results. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:189-208 [Journal ] Béla Bollobás , Alex D. Scott A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:283-292 [Journal ] Béla Bollobás , Alex D. Scott Judicious Partitions of Hypergraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1997, v:78, n:1, pp:15-31 [Journal ] Béla Bollobás , Andrew Thomason Weakly Pancyclic Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:121-137 [Journal ] Béla Bollobás , Alex D. Scott Separating systems and oriented graphs of diameter two. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:2, pp:193-203 [Journal ] Béla Bollobás , D. L. Goldsmith , Douglas R. Woodall Indestructive deletions of edges from graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:263-275 [Journal ] Béla Bollobás , Paul A. Catlin Topological cliques of random graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1981, v:30, n:2, pp:224-227 [Journal ] Béla Bollobás Uniquely colorable graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1978, v:25, n:1, pp:54-61 [Journal ] Béla Bollobás The number of 1-factors in 2k-connected graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1978, v:25, n:3, pp:363-366 [Journal ] Béla Bollobás , Stephen E. Eldridge Packings of graphs and applications to computational complexity. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1978, v:25, n:2, pp:105-124 [Journal ] Béla Bollobás , Paul Erdös On a Ramsey-Turán type problem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:166-168 [Journal ] Béla Bollobás Complete subgraphs are elusive. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:1-7 [Journal ] Béla Bollobás , Stephen E. Eldridge On graphs with diameter 2. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1976, v:21, n:3, pp:201-205 [Journal ] Béla Bollobás , Gautam Das , Dimitrios Gunopulos , Heikki Mannila Time-Series Similarity Problems and Well-Separated Geometric Sets. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 2001, v:8, n:4, pp:409-423 [Journal ] Béla Bollobás Complete Matchings in Random Subgraphs on the Cube. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1990, v:1, n:1, pp:95-104 [Journal ] Béla Bollobás Paul Erdös and probability theory. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1998, v:13, n:3-4, pp:521-533 [Journal ] Béla Bollobás , Graham Brightwell The number of k-SAT functions. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2003, v:22, n:3, pp:227-247 [Journal ] Béla Bollobás , Christian Borgs , Jennifer T. Chayes , Jeong Han Kim , David Bruce Wilson The scaling window of the 2-SAT transition. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:18, n:3, pp:201-256 [Journal ] Béla Bollobás , Alan M. Frieze Spanning Maximal Planar Subgraphs of Random Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1991, v:2, n:2, pp:225-232 [Journal ] Béla Bollobás , Svante Janson , Oliver Riordan The phase transition in the uniformly grown random graph has infinite order. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2005, v:26, n:1-2, pp:1-36 [Journal ] Béla Bollobás , Yoshiharu Kohayakawa , Tomasz Luczak The Evaluation of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1992, v:3, n:1, pp:55-90 [Journal ] Béla Bollobás , Yoshiharu Kohayakawa , Tomasz Luczak On the Diameter and Radius of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1994, v:5, n:5, pp:627-648 [Journal ] Béla Bollobás , Yoshiharu Kohayakawa , Tomasz Luczak Connectivity Properties of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:6, n:2/3, pp:221-230 [Journal ] Béla Bollobás , Jeong Han Kim , Jacques Verstraëte Regular subgraphs of random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2006, v:29, n:1, pp:1-13 [Journal ] Béla Bollobás , Oliver Riordan Slow emergence of the giant component in the growing m -out graph. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2005, v:27, n:1, pp:1-24 [Journal ] Béla Bollobás , Oliver Riordan Sharp thresholds and percolation in the plane. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2006, v:29, n:4, pp:524-548 [Journal ] Béla Bollobás , Oliver Riordan Colorings generated by monotone properties. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1998, v:12, n:1, pp:1-25 [Journal ] Béla Bollobás , Oliver Riordan , Joel Spencer , Gábor E. Tusnády The degree sequence of a scale-free random graph process. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2001, v:18, n:3, pp:279-290 [Journal ] Béla Bollobás , Alex D. Scott Problems and results on judicious partitions. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:414-430 [Journal ] Béla Bollobás , Andrew Thomason Generalized Chromatic Numbers of Random Graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:6, n:2/3, pp:353-356 [Journal ] 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 ] 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 ] Paul Balister , Béla Bollobás , Alan Stacey Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1994, v:5, n:4, pp:573-590 [Journal ] Paul Balister , Béla Bollobás , Alan Stacey Counting Boundary Paths for Oriented Percolation Clusters. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1999, v:14, n:1, pp:1-28 [Journal ] 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 ] Béla Bollobás , Graham Brightwell Transitive Orientations of Graphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1988, v:17, n:6, pp:1119-1133 [Journal ] Béla Bollobás , István Simon Probabilistic Analysis of Disjoint Set Union Algorithms. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:5, pp:1053-1074 [Journal ] Béla Bollobás , Graham Brightwell Parallel Selection with High Probability. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1990, v:3, n:1, pp:21-31 [Journal ] Béla Bollobás , Graham Brightwell The Structure of Random Graph Orders. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1997, v:10, n:2, pp:318-335 [Journal ] Béla Bollobás , Fan R. K. Chung The Diameter of a Cycle Plus a Random Matching. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:3, pp:328-333 [Journal ] Béla Bollobás , Don Coppersmith , Michael Elkin Sparse Distance Preservers and Additive Spanners. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2005, v:19, n:4, pp:1029-1055 [Journal ] Béla Bollobás , Imre Leader An Isoperimetric Inequality on the Discrete Torus. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1990, v:3, n:1, pp:32-37 [Journal ] Béla Bollobás , Imre Leader Union of shadows. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:307, n:3, pp:493-502 [Journal ] Béla Bollobás , Graham Brightwell How many graphs are unions of k -cliques? [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:52, n:2, pp:87-107 [Journal ] Béla Bollobás , Alex D. Scott Judicious partitions of bounded-degree graphs. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2004, v:46, n:2, pp:131-143 [Journal ] Béla Bollobás The distribution of the maximum degree of a random graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1980, v:32, n:2, pp:201-203 [Journal ] Béla Bollobás Degree sequences of random graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1981, v:33, n:1, pp:1-19 [Journal ] Béla Bollobás , Chie Nara , Shun-ichi Tachibana The maximal number of induced complete bipartite graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1986, v:62, n:3, pp:271-275 [Journal ] Béla Bollobás Some remarks on packing trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:46, n:2, pp:203-204 [Journal ] Béla Bollobás , Ernest J. Cockayne The irredundance number and maximum degree of a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:49, n:2, pp:197-199 [Journal ] Béla Bollobás Sorting in rounds. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1988, v:72, n:1-3, pp:21-28 [Journal ] Béla Bollobás , H. R. Hind A new upper bound for the list chromatic number. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:74, n:1-2, pp:65-75 [Journal ] Béla Bollobás Paul Erdös at seventy-five. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:75, n:1-3, pp:3-5 [Journal ] Béla Bollobás , Steen Rasmussen First cycles in random directed graph processes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:75, n:1-3, pp:55-68 [Journal ] Béla Bollobás , Graham Brightwell Long cycles in graphs with no subgraphs of minimal degree 3. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:75, n:1-3, pp:47-53 [Journal ] Noga Alon , Béla Bollobás Graphs with a small number of distinct induced subgraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:75, n:1-3, pp:23-30 [Journal ] Béla Bollobás , Oliver Riordan , Zdenek Ryjácek , Akira Saito , Richard H. Schelp Closure and Hamiltonian-connectivity of claw-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:195, n:1-3, pp:67-80 [Journal ] Béla Bollobás , Paul Erdös , Amites Sarkar Extremal graphs for weights. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:200, n:1-3, pp:5-19 [Journal ] Béla Bollobás , Tamás Szabó The oriented cycle game. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:186, n:1-3, pp:55-67 [Journal ] Béla Bollobás , Norbert Hegyvári , Guoping Jin On a problem of Erdös and Graham. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:175, n:1-3, pp:253-257 [Journal ] Béla Bollobás , Oliver Riordan On some conjectures of Graffiti. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:179, n:1-3, pp:223-230 [Journal ] Béla Bollobás , Imre Leader Sums in the grid. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:162, n:1-3, pp:31-48 [Journal ] Béla Bollobás , Alex D. Scott Independent sets and repeated degrees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:170, n:1-3, pp:41-49 [Journal ] Béla Bollobás , Ernest J. Cockayne , Christina M. Mynhardt On generalised minimal domination parameters for paths. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:86, n:1-3, pp:89-97 [Journal ] Béla Bollobás , H. R. Hind Graphs without large triangle free subgraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:87, n:2, pp:119-131 [Journal ] Béla Bollobás Turán-Ramsey problems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:156, n:1-3, pp:257-262 [Journal ] Béla Bollobás Degree multiplicities and independent sets in K4 -free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1996, v:158, n:1-3, pp:27-35 [Journal ] Béla Bollobás , Imre Leader Maximal sets of given diameter in the grid and the torus. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:122, n:1-3, pp:15-35 [Journal ] Béla Bollobás , Vladimir Nikiforov Cliques and the spectral radius. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:859-865 [Journal ] Noam Berger , Béla Bollobás , Christian Borgs , Jennifer T. Chayes , Oliver Riordan Degree distribution of the FKP network model. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2007, v:379, n:3, pp:306-316 [Journal ] Reliable density estimates for coverage and connectivity in thin strips of finite length. [Citation Graph (, )][DBLP ] Eliminating Cycles in the Discrete Torus. [Citation Graph (, )][DBLP ] The distribution of the root degree of a random permutation. [Citation Graph (, )][DBLP ] The Sum of Degrees in Cliques. [Citation Graph (, )][DBLP ] Hereditary Properties of Tournaments. [Citation Graph (, )][DBLP ] Majority Bootstrap Percolation on the Hypercube. [Citation Graph (, )][DBLP ] Introduction. [Citation Graph (, )][DBLP ] Line-of-Sight Percolation. [Citation Graph (, )][DBLP ] Highly connected random geometric graphs. [Citation Graph (, )][DBLP ] Highly connected monochromatic subgraphs. [Citation Graph (, )][DBLP ] Joints in graphs. [Citation Graph (, )][DBLP ] Graphs and Hermitian matrices: Exact interlacing. [Citation Graph (, )][DBLP ] Pentagons vs. triangles. [Citation Graph (, )][DBLP ] Max k-cut and judicious k-partitions. [Citation Graph (, )][DBLP ] A note on the Harris-Kesten Theorem. [Citation Graph (, )][DBLP ] The number of graphs with large forbidden subgraphs. [Citation Graph (, )][DBLP ] Search in 0.011secs, Finished in 0.018secs