Preprints (sorry,  not  all  the  files  are  downloadable  yet)

• J. Balogh, B. Bollob\'as, and R. Morris, Bootstrap percolation in three dimensions manuscript
•   J. Balogh and   Kostochka, On 2-detour subgraphs of the hypercube, submitted
•   J. Balogh,  Bezrukov, Harper and Seress,  On the bandwidth of 3-dimensional Hamming graphs, submitted
•   J. Balogh   R. Martin,     On Avoider-Enforcergames , submitted
• J. Balogh, B. Bollob\'as, M. Saks, and V. T. S\'os, On the diversity function of a hereditary graph property, submitted
  

To appear

•   J. Balogh,  Bollobas and Simonovits, The typical structure of graphs without given excluded subgraphs , Random Structures and Algorithms,
• J. Balogh, B. Bollob\'as, and R. Morris, Majority bootstrap percolation on the hypercube, Combinatorics, Probability and Computing
•   J. Balogh   R. Martin,   A. Pluhar  The diameter game, Random Structures and Algorithms,
•   J. Balogh,  Araujo, Fabila, Salazar and Urrutia,  A note on harmonic subgraphs in labelled geometric graphs,
  
•   J. Balogh, D. Mubayi; Shifting and non-trivial $t$-intersecting families, JCT A
•   J. Balogh, S.G. Hartke, Qi Liu, and   Gexin Yu, First-Fit chromatic number of planar and random graphs, (SIDMA)
• Abrego, Balogh, Fernadez-Merchant and Leanos: An extended lower bound on the number of $(\le k)$-edges to generalized configurations of points and the pseudolinear crossing number of $K_n$,, JCT A
• J. Balogh,  Kumar and Lai, On k-coverage in a mostly sleeping sensor network,  Wireless Network,

2008

•   J. Balogh   R. Martin,     Edit distance and its computation , Electronic Journal of Combinatorics, 15(1), Research Paper 20, 27 pp. (electronic).
•   J. Balogh and   Smyth, On the variance of Shannon products of graphs, Discrete Applied Mathematics Volume 156, Issue 1, 1 January 2008, Pages 110-118

2007

•   J. Balogh  and  Pemantle, The Klee-Minty random edge chain moves linear speed, Random Structures and Algorithms, (2007) Volume 30, 464--483
  
•   J. Balogh,  Bollobas and Morris, Hereditary properties of combinatorial structures: posets and oriented graphs , J. Graph Theory, 56 (2007), 311--332.
• Balogh, Bollobas, Morris, Hereditary properties of tournaments. Electron. J. Combin. 14 (2007), no. 1, Research Paper 60, 25 pp. (electronic).
•   J. Balogh and   Pittel, Bootstrap percolation on random regular graphs Random Structures and Algorithms, (2007) Volume 30, Issue 1-2, 257--286
• J. Balogh,  Pittel  and Salazar,  Large harmonious sets of non-crossing edges for n randomly labeled vertices in convex position,    Random Structures and Algorithms, (2007) Volume 30, Issue 1-2, 105--130
• J. Balogh, J. Leanos, S. Pan, R. B. Richter, and G. Salazar, The convex hull of every optimal pseudo-linear drawing of $K_n$ is a triangle. Australasian J. Combin. 38 (2007), 155--162.
•   J. Balogh and   Axenovich,  Graphs having small number of sizes on induced k-subgraphs SIAM J. Discrete Math. 21 (2007), no. 1, 264--272

2006

• J. Balogh,  Sudakov and Keevash, On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs ,  J. Combin. Theory Ser. B 96 (2006), no. 6, 919--932.
  
•   J. Balogh,  Peres and Pete, Bootstrap percolation on infinite trees and non-amenable groups,  Combinatorics, Probability and Computing, 15 (2006) 715--730.
• J. Balogh and  B. Bollobas,   Bootstrap percolation on the hypercube,  Probability and Related Fields, 134, (2006) 624--648.
•  J. Balogh,  Bollobas and Morris,   Hereditary properties of ordered graphs. Topics in discrete mathematics, 179--213, Algorithms Combin., 26, Springer, Berlin, 2006.
•   J. Balogh and  Salazar, On $k$-sets, convex quadrilaterals, and the rectilinear crossing number of K_n, Discrete Comput. Geom. 35 (2006) 671--690
  
•   J. Balogh,  Mubayi and Pluhar, On the edge-bandwidth of graph products ,  Theoretical Computer Science, 359 (2006) 43--57
• J. Balogh,  A remark on the number of edge colorings of graphs, European J. Combin., 27 (2006) 565--573.
•  J. Balogh,  Bollobas and Morris, Hereditary properties of partitions, ordered graphs and ordered hypergraphs , European J. of Combinatorics, 8, (2006) 1263--1281.

2005


•  J. Balogh, Keevash and Sudakov,  Disjoint representability of sets and their complements,  Journal of Combinatorial Theory B,  95 (2005) 12--28
•   J. Balogh and  Bollobas, Hereditary properties of words, RAIRO Theoretical Informatics and Applications, Speciel Issue (Imre Simon), Vol 39, No. 1, 49-66.
•  J. Balogh  Bollobas and Weinreich, A jump to the Bell number for hereditary graph properties,, Journal of Combinatorial Theory B,   95 (2005) 29--48
  
• J. Balogh  Kochol, Pluhar and X. Yu, Covering planar graphs forests J. Comb Theory,  B Volume: 94,  May, (2005) 147-158.
• J. Balogh and  Bollobas, Unavoidable traces of set systems,  Combinatorica,  25 (2005) 633--643.
  
  

2004

•  J. Balogh,   Alon,  Keevash and B. Sudakov, The number of edge colorings with no monochromatic cliques, J. London Mathematical Society 70 (2004)  273--288.
•   J. Balogh and   J. Csirik, Index assignment for two-channel quantization, IEEE transitions on Information theory, 11 Vol. 50 November (2004) 2737--2751.
•  J. Balogh,  Bollobas and Simonovits, On the number of graphs without forbidden subgraph, J. Combinatorial Theory Ser. B., 91, 1--24
• J. Balogh, Regev, Smyth, Steiger and Szegedy, Long monotone paths in line arrangements.Discrete Comput. Geom. 32 (2004), no. 2, 167--176.
•   J. Balogh,  Ochem and Pluhar, On the interval graph of Special Graphs, J. of Graph Theory, 46 241 - 253.

2003

• J. Balogh,  J. Csirik, Y. Ishai and E. Kushulewitz, Private Computation Using a PEZ Dispenser, Theoretical Computer Science, Vol. 306, Sept 2003, 69--84
• J. Balogh and  Bollobas, Sharp thresholds in bootstrap percolation. Physics A. 326, 305--312.

2002

• J. Balogh  and Pluhar, The interval number of dense graphs, , Discrete Mathematics Vol 256/1--2,  423--429.
• J. Balogh,  Bollobas and Weinreich, Measures on monotone properties of graphs, Discrete Mathematics Vol 256/1--2,  423--429.
•  J. Balogh, The Turan density of triple systems is not principal, J. Comb. Theory Ser. A 100, no. 1, 176--180.
• J. Balogh,  Alon, Bollobas and Szabo, The Game Domination Number, Discrete Mathematics Vol 256/1-2, 23--33.

2001

• J. Balogh,  Bollobas and Weinreich, The penultimate rate of growth for graph properties, Europian J. Comb, 22, 277-289.

2000

• J. Balogh,  Bollobas and Weinreich, The speed of hereditary properties of graphs, J. Comb. Theory Ser. B 79 131-156.

1999

• J. Balogh and  Pluhar, The interval number of dense graphs,  Discrete Math. 256. no 1-2, 423-429.

1998

• J. Balogh  and Pete, Random disease on the square grid, Random Structures and Algorithms 13, 409-422
• J. Balogh,  On the non-existence of cyclic MDS codes, Atti Sem. Mat. Fis. Univ. Modena 46, 27-33.

            Conference Proceedings   (for the complete "journal version" see above list)

•   J. Balogh  Salazar, On $k$--sets, convex quadrilaterals, and the rectilinear crossing number of $K_n$ ,  Proc. 12th Intl. Symp. Graph Drawing, Lecture Notes in Computer Science, Springer. Berlin 2004

• J. Balogh  Regev Smyth, Steiger and Szegedy, Longer monotone paths in line arrangements, 19th Annual ACM Symp. on Comp. Geometry, June 2003, 124--128.

• J. Balogh  Kumar and Lai, On k-coverage in a mostly sleeping sensor network Proceedings of the 10th annual international conference on Mobile computing and networking 2004, 144--158.