The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Béla Bollobás" ( http://dblp.L3S.de/Authors/Béla_Bollobás )

  Author page on DBLP  Author page in RDF  Community of Béla Bollobás in ASPL-2

Publication years (Num. hits)
1973-1983 (17) 1984-1988 (15) 1989-1991 (17) 1992-1996 (19) 1997-1999 (20) 2000-2001 (17) 2002-2003 (22) 2004 (16) 2005-2006 (24) 2007-2008 (22) 2009-2011 (27) 2012 (2)
Publication types (Num. hits)
article(201) book(1) inproceedings(16)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 18 occurrences of 17 keywords

Results
Found 218 publication records. Showing 218 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Béla Bollobás, Oliver Riordan Asymptotic normality of the size of the giant component via a random walk. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Mykhaylo Tyomkyn Walks and paths in trees. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Noga Alon, József Balogh, Béla Bollobás, Robert Morris The structure of almost all graphs in a hereditary property. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Graham Brightwell, Robert Morris Shadows of ordered graphs. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Miklós Simonovits The fine structure of octahedron-free graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Large joints in graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Svante Janson, Oliver Riordan On covering by translates of a set. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Svante Janson, Oliver Riordan Sparse random graphs with clustering. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Sparse graphs: Metrics and random models. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Imre Leader, Claudia Malvenuto Daisies and Other Turán Problems. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky Energy-Latency Tradeoff for In-Network Function Computation in Random Networks Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Béla Bollobás, Alex D. Scott Intersections of graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, David Pritchard, Thomas Rothvoß, Alex D. Scott Cover-Decomposition and Polychromatic Numbers. Search on Bibsonomy ESA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky Energy-latency tradeoff for in-network function computation in random networks. Search on Bibsonomy INFOCOM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Alex D. Scott Max k-cut and judicious k-partitions. Search on Bibsonomy Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov The number of graphs with large forbidden subgraphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters Random majority percolation. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás Bond percolation with attenuation in high dimensional Voronoi tilings. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Noga Alon, Béla Bollobás Introduction. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Robert Morris Bootstrap Percolation in High Dimensions. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós The unlabelled speed of a hereditary graph property. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Clique percolation. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Miklós Simonovits The typical structure of graphs without given excluded subgraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Svante Janson, Oliver Riordan Line-of-Sight Percolation. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Robert Morris Majority Bootstrap Percolation on the Hypercube. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Noga Alon, Béla Bollobás Introduction. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Boris Pittel The distribution of the root degree of a random permutation. Search on Bibsonomy Combinatorica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters Highly connected random geometric graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Paul Balister, Béla Bollobás, Stefanie Gerke Connectivity of addable graph classes. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit Packing d-degenerate graphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Joints in graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, András Gyárfás Highly connected monochromatic subgraphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Graphs and Hermitian matrices: Exact interlacing. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Ervin Györi Pentagons vs. triangles. Search on Bibsonomy Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell Eliminating Cycles in the Discrete Torus. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Discrete torus, Foam, Tiling, Multicut
1Paul N. Balister, Béla Bollobás, Amites Sarkar, Mark Walters Connectivity of a Gaussian network. Search on Bibsonomy IJAHUC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Percolation on dual lattices with k-fold symmetry. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Paul Balister, Béla Bollobás, Stefanie Gerke Sequences with Changing Dependencies. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Alex D. Scott Separating systems and oriented graphs of diameter two. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Cliques and the spectral radius. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan Degree distribution of the FKP network model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan A note on the Harris-Kesten Theorem. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Alex D. Scott On separating systems. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Robert Morris Hereditary Properties of Tournaments. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2007 DBLP  BibTeX  RDF
1Béla Bollobás, Svante Janson, Oliver Riordan The phase transition in inhomogeneous random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Svante Janson, Oliver Riordan Spread-out percolation in Rd. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás, Stefanie Gerke The generalized Randic index of trees. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Robert Morris Hereditary properties of combinatorial structures: Posets and oriented graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott Maximum directed cuts in acyclic digraphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar Reliable density estimates for coverage and connectivity in thin strips of finite length. Search on Bibsonomy MOBICOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF wireless sensor networks, connectivity, coverage, network topology, deployment, critical, random geometric graphs, barrier coverage
1Béla Bollobás, Imre Leader The Angel and the Devil in three dimensions. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Andrew Thomason Set colourings of graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Sanjeev Arora, Béla Bollobás, László Lovász, Iannis Tourlakis Proving Integrality Gaps without Knowing the Linear Program. Search on Bibsonomy Theory of Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás Pair dominating graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Robert Morris Hereditary properties of partitions, ordered graphs and ordered hypergraphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás, Robert Kozma Large deviations for mean field models of probabilistic cellular automata. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Sharp thresholds and percolation in the plane. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Jeong Han Kim, Jacques Verstraëte Regular subgraphs of random graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Graham Brightwell How many graphs are unions of k-cliques? Search on Bibsonomy Journal of Graph Theory The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Yair Bartal, Béla Bollobás, Manor Mendel Ramsey-type theorems for metric spaces with applications to online problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Percolation. Search on Bibsonomy 2006   RDF
1Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell Eliminating Cycles in the Discrete Torus. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, David Weinreich A jump to the bell number for hereditary graph properties. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás Hereditary properties of words. Search on Bibsonomy ITA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Books in graphs. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oleg Pikhurko Integer sets with prescribed pairwise differences being distinct. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov The Sum of Degrees in Cliques. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2005 DBLP  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Slow emergence of the giant component in the growing m-out graph. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás, Anthony Quas Percolation in Voronoi tilings. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Paul N. Balister, Béla Bollobás, Mark Walters Continuum percolation with steps in the square or the disc. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Svante Janson, Oliver Riordan The phase transition in the uniformly grown random graph has infinite order. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás Unavoidable Traces Of Set Systems. Search on Bibsonomy Combinatorica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1Robert 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. Search on Bibsonomy Biological Cybernetics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Don Coppersmith, Michael Elkin Sparse Distance Preservers and Additive Spanners. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1József Balogh, Béla Bollobás, Miklós Simonovits The number of graphs without forbidden subgraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Richard Arratia, Béla Bollobás, Gregory B. Sorkin The interlace polynomial of a graph. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Peter Keevash, Benny Sudakov Multicoloured extremal problems. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Graphs and Hermitian matrices: eigenvalue interlacing. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Hermitian matrices and graphs: singular values and discrepancy. Search on Bibsonomy Discrete Mathematics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Vladimir Nikiforov Degree Powers in Graphs with Forbidden Subgraphs. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2004 DBLP  BibTeX  RDF
1Béla Bollobás, Alex D. Scott Max Cut for Random Graphs with a Planted Partition. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás How Sharp is the Concentration of the Chromatic Number? Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Imre Leader Isoperimetric Problems for r-sets. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, David Gamarnik, Oliver Riordan, Benny Sudakov On the Value of a Random Minimum Weight Steiner Tree. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C80, 68R10, 60C05
1Béla Bollobás, Oliver Riordan The Diameter of a Scale-Free Random Graph. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C80
1Richard Arratia, Béla Bollobás, Gregory B. Sorkin A Two-Variable Interlace Polynomial. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C99, 05E99, 05A15
1Yair Bartal, Béla Bollobás, Manor Mendel Ramsey-type theorems for metric spaces with applications to online problems Search on Bibsonomy CoRR The full citation details ... 2004 DBLP  BibTeX  RDF
1Béla Bollobás, Alex D. Scott Judicious partitions of bounded-degree graphs. Search on Bibsonomy Journal of Graph Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. Search on Bibsonomy ACRI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan The Phase Transition and Connectedness in Uniformly Grown Random Graphs. Search on Bibsonomy WAW The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp Graphs with large maximum degree containing no odd cycles of a given length. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov Maximum cuts and judicious partitions in graphs without short cycles. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Oliver Riordan Disjointly representing set systems. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Imre Leader Union of shadows. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Amites Sarkar Paths of length four. Search on Bibsonomy Discrete Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Graham Brightwell The number of k-SAT functions. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Graham Brightwell, Yoshiharu Kohayakawa, Imre Leader, Alex D. Scott Special Issue on Ramsey Theory. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Andrew Thomason Frank Ramsey. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Béla Bollobás, Imre Leader Set Systems with few Disjoint Pairs. Search on Bibsonomy Combinatorica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05D05, 05C65
Displaying result #1 - #100 of 218 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.