József Balogh

	2009
41		József Balogh, Béla Bollobás, Robert Morris: Majority Bootstrap Percolation on the Hypercube. Combinatorics, Probability & Computing 18(1-2): 17-51 (2009)
40		József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós: The unlabelled speed of a hereditary graph property. J. Comb. Theory, Ser. B 99(1): 9-19 (2009)
39		József Balogh, Béla Bollobás, Miklós Simonovits: The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3): 305-318 (2009)
	2008
38		József Balogh, Clifford D. Smyth: On the variance of Shannon products of graphs. Discrete Applied Mathematics 156(1): 110-118 (2008)
37		Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia: A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105(3): 98-102 (2008)
36		József Balogh, Dhruv Mubayi: A new short proof of a theorem of Ahlswede and Khachatrian. J. Comb. Theory, Ser. A 115(2): 326-330 (2008)
35		Bernardo M. Ábrego, József Balogh, Silvia Fernández-Merchant, Jesús Leaños, Gelasio Salazar: An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of Kn. J. Comb. Theory, Ser. A 115(7): 1257-1264 (2008)
34		József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu: On the First-Fit Chromatic Number of Graphs. SIAM J. Discrete Math. 22(3): 887-900 (2008)
33		Santosh Kumar, Ten-Hwang Lai, József Balogh: On k-coverage in a mostly sleeping sensor network. Wireless Networks 14(3): 277-294 (2008)
	2007
32		József Balogh, Béla Bollobás, Robert Morris: Hereditary Properties of Tournaments. Electr. J. Comb. 14(1): (2007)
31		József Balogh, Béla Bollobás, Robert Morris: Hereditary properties of combinatorial structures: Posets and oriented graphs. Journal of Graph Theory 56(4): 311-332 (2007)
30		József Balogh, Boris Pittel, Gelasio Salazar: Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. Random Struct. Algorithms 30(1-2): 105-130 (2007)
29		József Balogh, Boris Pittel: Bootstrap percolation on the random regular graph. Random Struct. Algorithms 30(1-2): 257-286 (2007)
28		József Balogh, Robin Pemantle: The Klee-Minty random edge chain moves with linear speed. Random Struct. Algorithms 30(4): 464-483 (2007)
27		Maria Axenovich, József Balogh: Graphs Having Small Number of Sizes on Induced k-Subgraphs. SIAM J. Discrete Math. 21(1): 264-272 (2007)
	2006
26		József Balogh, Yuval Peres, Gábor Pete: Bootstrap Percolation on Infinite Trees and Non-Amenable Groups. Combinatorics, Probability & Computing 15(5): 715-730 (2006)
25		József Balogh, Gelasio Salazar: k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. Discrete & Computational Geometry 35(4): 671-690 (2006)
24		József Balogh: A remark on the number of edge colorings of graphs. Eur. J. Comb. 27(4): 565-573 (2006)
23		József Balogh, Béla Bollobás, Robert Morris: Hereditary properties of partitions, ordered graphs and ordered hypergraphs. Eur. J. Comb. 27(8): 1263-1281 (2006)
22		József Balogh, Peter Keevash, Benny Sudakov: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs. J. Comb. Theory, Ser. B 96(6): 919-932 (2006)
21		József Balogh, Dhruv Mubayi, András Pluhár: On the edge-bandwidth of graph products. Theor. Comput. Sci. 359(1-3): 43-57 (2006)
	2005
20		József Balogh, Béla Bollobás: Unavoidable Traces Of Set Systems. Combinatorica 25(6): 633-643 (2005)
19		József Balogh, Béla Bollobás: Hereditary properties of words. ITA 39(1): 49-65 (2005)
18		József Balogh, Martin Kochol, András Pluhár, Xingxing Yu: Covering planar graphs with forests. J. Comb. Theory, Ser. B 94(1): 147-158 (2005)
17		József Balogh, Peter Keevash, Benny Sudakov: Disjoint representability of sets and their complements. J. Comb. Theory, Ser. B 95(1): 12-28 (2005)
16		József Balogh, Béla Bollobás, David Weinreich: A jump to the bell number for hereditary graph properties. J. Comb. Theory, Ser. B 95(1): 29-48 (2005)
	2004
15		József Balogh, Gelasio Salazar: Improved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn. Graph Drawing 2004: 25-35
14		Santosh Kumar, Ten-Hwang Lai, József Balogh: On k-coverage in a mostly sleeping sensor network. MOBICOM 2004: 144-158
13		József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long Monotone Paths in Line Arrangements. Discrete & Computational Geometry 32(2): 167-176 (2004)
12		József Balogh, János A. Csirik: Index assignment for two-channel quantization. IEEE Transactions on Information Theory 50(11): 2737-2751 (2004)
11		József Balogh, Béla Bollobás, Miklós Simonovits: The number of graphs without forbidden subgraphs. J. Comb. Theory, Ser. B 91(1): 1-24 (2004)
10		József Balogh, Pascal Ochem, András Pluhár: On the interval number of special graphs. Journal of Graph Theory 46(4): 241-253 (2004)
	2003
9		József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long monotone paths in line arrangements. Symposium on Computational Geometry 2003: 124-128
8		József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz: Private computation using a PEZ dispenser. Theor. Comput. Sci. 306(1-3): 69-84 (2003)
	2002
7		József Balogh, Béla Bollobás, David Weinreich: Measures on monotone properties of graphs. Discrete Applied Mathematics 116(1-2): 17-36 (2002)
6		Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó: Game domination number. Discrete Mathematics 256(1-2): 23-33 (2002)
5		József Balogh, András Pluhár: The interval number of dense graphs. Discrete Mathematics 256(1-2): 423-429 (2002)
4		József Balogh: The Turan Density of Triple Systems Is Not Principal. J. Comb. Theory, Ser. A 100(1): 176-180 (2002)
	2001
3		József Balogh, Béla Bollobás, David Weinreich: The Penultimate Rate of Growth for Graph Properties. Eur. J. Comb. 22(3): 277-289 (2001)
	2000
2		József Balogh, Béla Bollobás, David Weinreich: The Speed of Hereditary Properties of Graphs. J. Comb. Theory, Ser. B 79(2): 131-156 (2000)
	1998
1		József Balogh, Gábor Pete: Random disease on the square grid. Random Struct. Algorithms 13(3-4): 409-422 (1998)

Coauthor Index

1	Bernardo M. Ábrego	[35]
2	Noga Alon	[6]
3	Gabriela Araujo	[37]
4	Maria Axenovich	[27]
5	Béla Bollobás	[2] [3] [6] [7] [11] [16] [19] [20] [23] [31] [32] [39] [40] [41]
6	János A. Csirik	[8] [12]
7	Silvia Fernández-Merchant	[35]
8	Stephen G. Hartke	[34]
9	Yuval Ishai	[8]
10	Peter Keevash	[17] [22]
11	Martin Kochol	[18]
12	Santosh Kumar	[14] [33]
13	Eyal Kushilevitz	[8]
14	Ten-Hwang Lai	[14] [33]
15	Jesús Leaños	[35]
16	Qi Liu	[34]
17	Ruy Fabila Monroy	[37]
18	Robert Morris	[23] [31] [32] [41]
19	Dhruv Mubayi	[21] [36]
20	Pascal Ochem	[10]
21	Robin Pemantle	[28]
22	Yuval Peres	[26]
23	Gábor Pete	[1] [26]
24	Boris Pittel	[29] [30]
25	András Pluhár	[5] [10] [18] [21]
26	Oded Regev	[9] [13]
27	Michael E. Saks	[40]
28	Gelasio Salazar	[15] [25] [30] [35] [37]
29	Miklós Simonovits	[11] [39]
30	Clifford D. Smyth	[9] [13] [38]
31	Vera T. Sós	[40]
32	William L. Steiger	[9] [13]
33	Benny Sudakov	[17] [22]
34	Tamás Szabó	[6]
35	Mario Szegedy	[9] [13]
36	Jorge Urrutia	[37]
37	David Weinreich	[2] [3] [7] [16]
38	Gexin Yu	[34]
39	Xingxing Yu	[18]

Colors in the list of coauthors