[1] ``On a problem of P. Erdos.'' *Acta Mathematica
Hungarica*, 60 (1-2), 1992, pp. 271-282.
(
link)

[2] ``Cycles in bipartite graphs and an application in Number
Theory.'' *Journal of Graph Theory*, 19 (3), 1995, pp. 323-331.
(
link)

[3] ``On sums with small prime factors.'' *Acta Mathematica Hungarica*,
67 (4), 1995, pp. 333-345.
(
link)

[4] ``Proof of a packing conjecture of Bollobas.''
*Combinatorics, Probability and Computing*,
4, 1995, pp. 241-255 (with János Komlós,
Endre Szemerédi).
(
link)

[5] ``On the square of a Hamiltonian cycle in dense graphs.''
*Random Structures and Algorithms*, 9, 1996, pp. 193-211 (with
János Komlós, Endre Szemerédi).
(
link)

[6] ``On cycles in the coprime graph of integers.'' *Electronic Journal
of Combinatorics*, 4 (2), 1997, #R8 (with Paul Erdos).
(
link)

[7] ``Blow-up Lemma.'' *Combinatorica*, 17 (1), 1997, pp. 109-123 (with
János Komlós, Endre Szemerédi).
(
link)

[8] ``An algorithmic version of the Blow-up Lemma.''
*Random Structures and Algorithms*, 12, 1998, pp. 297-312
(with János Komlós,
Endre Szemerédi).
(
link)

[9] ``On the Pósa-Seymour conjecture.'' *Journal of Graph Theory*,
29, 1998, pp. 167-176 (with
János Komlós, Endre Szemerédi).
(
link)

[10] ``Proof of the Seymour conjecture for large graphs.''
*Annals of Combinatorics*, 1, 1998, pp. 43-60 (with
János Komlós, Endre Szemerédi).
(
link)

[11] ``Counting irregular multigraphs.''
*Discrete Mathematics*, 195, 1999, pp. 235-237
(with Aron Atkins and Stanley Selkow).
(
link)

[12] ``Complete tripartite subgraphs in the coprime graph of integers.''
*Discrete Mathematics*, 202, 1999, pp. 227-238.
(
link)

[13] ``On k-ordered Hamiltonian graphs.''
*Journal of Graph Theory* 32, 1999, pp. 17-25
(with Hal Kierstead, Stanley Selkow).
(
link)

[14] ``Vertex partitions by connected monochromatic k-regular graphs.''
*Journal of Combinatorial Theory Series B*, 78, 2000, pp. 115-122
(with Stanley Selkow).
(
link)

[15] ``On edge colorings with at least q colors in every subset of p
vertices.'' *Electronic Journal of Combinatorics* 8, 2001, #R9
(with Stanley Selkow).
(
link)

[16] ``Spanning trees in dense graphs.''
*Combinatorics, Probability and Computing* 10, 2001, pp. 397-416
(with
János Komlós, Endre Szemerédi).
(
link)

[17] ``Proof of the Alon-Yuster conjecture.''
*Discrete Mathematics* 235, 2001, pp. 255-269 (with János
Komlós, Endre Szemerédi).
(
link)

[18] ``On the number of Hamiltonian cycles in Dirac graphs.''
*Discrete Mathematics* 265, 2003, pp. 237-250
(with Stanley Selkow, Endre Szemerédi).
(
link)

[19] ``On bipartite generalized Ramsey theory.''
*Ars Combinatoria* 68, 2003, pp. 57-64 (with Stanley Selkow).

[20] ``An application of the Regularity Lemma in generalized
Ramsey theory.'' *Journal
of Graph Theory* 44, 2003, pp. 39-49 (with Stanley Selkow).
(
link)

[21] ``An extension of the Ruzsa-Szemerédi Theorem.''
*Combinatorica* 25 (1), 2005, pp. 77-84 (with Stanley Selkow).
(
link)

[22] ``On a Turán-type hypergraph problem of Brown, Erdos
and T. Sós.''
*Discrete Mathematics* 297, 2005, pp. 190-195
(with Stanley Selkow).
(
link)

[23] ``On partial block designs with large blocks.''
*Discrete Mathematics* 305, 2005, pp. 264-275
(with András Sárközy).
(
link)

[24] ``On an anti-Ramsey problem of Burr, Erdos, Graham and
T. Sós.''
*Journal
of Graph Theory* 52, 2006, pp. 147-156 (with Stanley Selkow).
(
link)

[25] ``An improved bound for the monochromatic cycle partition number.''
*Journal
of Combinatorial Theory, Ser. B* 96, 2006, pp.855-873
(with András Gyárfás,
Miklós Ruszinkó and
Endre Szemerédi).
(
link)

[26] ``One-sided coverings of colored complete bipartite graphs.''
in *Topics in Discrete Mathematics* (dedicated to J. Nesetril
on his 6oth birthday), *Algorithms and Combinatorics* 26
(M. Klazar et al eds.), Springer, Berlin, 2006, pp. 133-154.
(with András Gyárfás,
Miklós Ruszinkó and
Endre Szemerédi).
(
link)

[27] ``Three color Ramsey numbers for paths.''
*Combinatorica* 27 (1), 2007, pp. 35-69
(with András Gyárfás, Miklós Ruszinkó and
Endre Szemerédi),
(
link)

[28] ``Tripartite Ramsey numbers for paths.''
*Journal of Graph Theory* 55, 2007, pp. 164-174
(with András Gyárfás, Miklós Ruszinkó and
Endre Szemerédi).
(
link)

[29] ``Corrigendum: Three color Ramsey numbers for paths''
(Combinatorica 27 (1), 2007, pp. 35-69). *Combinatorica* 28 (4), 2008, pp. 499-502
(with András Gyárfás, Miklós Ruszinkó and
Endre Szemerédi),
(
link)

[30] ``Monochromatic Hamiltonian Berge-cycles in colored complete
uniform hypergraphs.''
*Journal of Combinatorial Theory,
Ser. B* 98, 2008, pp. 342-358
(with András Gyárfás, Jeno Lehel
and Richard Schelp).
(
link)

[31] ``On 2-factors with k components.''
*Discrete Mathematics* 308, 2008, pp. 1962-1972.
(
link)

[32] ``Size of monochromatic components in local edge colorings.''
*Discrete Mathematics* 308, 2008, pp. 2620-2622
(with András Gyárfás).
(
link)

[33] ``Inequalities for the First-Fit chromatic number.''
*Journal of Graph Theory* 59, 2008, pp. 75-88 (with Zoltán Furedi,
András Gyárfás
and Stanley Selkow).
(
link)

[34] ``Monochromatic Hamiltonian t-tight Berge-cycles in hypergraphs.''
*Journal of Graph Theory* 59, 2008, pp. 34-44
(with Paul Dorbec and
Sylvain Gravier).
(
link)

[35] ``Distributing vertices along a Hamiltonian cycle in Dirac graphs.''
*Discrete Mathematics* 308, 2008, pp. 5757-5770
(with Stanley Selkow).
(
link)

[36] ``The Ramsey number of diamond-matchings and loose cycles
in hypergraphs.'' *Electronic Journal of Combinatorics* 15 (1),
2008, #R126
(with András Gyárfás and
Endre Szemerédi).
(
link)

[37] ``Size of monochromatic double stars in edge colorings.''
*Graphs and Combinatorics* 24, 2008, pp. 531-536
(with András Gyárfás).
(
link)

[38] ``A fast parallel algorithm for finding Hamiltonian cycles in
dense graphs.'' *Discrete Mathematics* 309, 2009, pp. 1611-1622.
(
link)

[39] ``Multipartite Ramsey numbers for odd cycles.''
*Journal of Graph Theory* 61, 2009, pp. 12-21
(with András Gyárfás
and Richard Schelp).
(
link)

[40] ``Stability of the path-path Ramsey number.''
*Discrete Mathematics* 309, 2009, pp. 4590-4595
(with András Gyárfás and
Endre Szemerédi).
(
link)

[41] ``How to avoid using the Regularity Lemma; Pósa's Conjecture
revisited.'' *Discrete Mathematics* 310, 2010, pp. 630-641
(with Ian Levitt and Endre Szemerédi).
(
link)

[42] ``Gallai colorings of non-complete graphs.'' *Discrete Mathematics*
310, 2010, pp. 977-980 (with András Gyárfás).
(
link)

[43] ``Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored
4-uniform hypergraphs.'' *Journal of Graph Theory* 63, 2010, pp. 288-299
(with András Gyárfás and
Endre Szemerédi).
(
link)

[44] ``Long monochromatic Berge cycles in colored 4-unform
hypergraphs.'' *Graphs and Combinatorics* 26, 2010, pp. 71-76
(with András Gyárfás and
Endre Szemerédi).
(
link)

[45] ``Ramsey-type results for Gallai-colorings.''
*Journal of Graph Theory* 64, 2010, pp. 233-243
(with András Gyárfás, András Sebo
and Stanley Selkow).
(
link)

[46] ``Monochromatic matchings in the shadow graph of almost complete
hypergraphs.''
*Annals of Combinatorics* 14, 2010, pp. 245-249
(with András Gyárfás and
Endre Szemerédi).
(
link)

[47] ``The 3-color Ramsey number of a 3-uniform Berge-cycle.''
*Combinatorics, Probability and Computing* 20, 2011, pp. 53-71
(with András Gyárfás).
(
link)

[48] ``Monochromatic cycle partitions of edge-colored graphs.''
*Journal of Graph Theory* 66, 2011, pp. 57-64.
(
link)

[49] ``Partitioning 3-colored complete graphs into three monochromatic cycles.''
*Electronic Journal of Combinatorics* 18, 2011, #P53
(with András Gyárfás, Miklós Ruszinkó and
Endre Szemerédi).
(
link)

[50] ``Long rainbow cycles in proper edge-colorings of complete graphs.''
*Australasian Journal of Combinatorics* 50, 2011, pp. 45-53
(with András Gyárfás, Miklós Ruszinkó and
Richard Schelp).
(
link)

[51] ``Spectral Clustering in Educational Data Mining.''
*Proceedings of the 4th International Conference on Educational Data Mining*, 2011, pp. 129-138
(with Shubhendu Trivedi, Zach Pardos and Neil Heffernan).
(
link)

[52] ``Vertex partitions of non-complete graphs by connected monochromatic k-regular graphs.''
*Discrete Mathematics* 311, 2011, pp. 279-284
(with Stanley Selkow and Fei Song).
(
link)

[53] ``Coverings by monochromatic pieces - problems for the Emlektabla workshop.''
*Proceedings of the 3rd Emlektabla Workshop*, Janos Bolyai Mathematical Society, 2011, pp. 1-9.
(
link)

[54] ``Star versus two stripes Ramsey numbers and a
conjecture of Schelp.''
*Combinatorics, Probability and Computing* 21, 2012, pp. 179-186.
(with András Gyárfás).
(
link)

[55] ``Clustered knowledge tracing.''
*Proceedings of the 11th International Conference on
Intelligent Tutoring Systems*, LNCS 7315, pp. 407–412, 2012,
Springer-Verlag Berlin Heidelberg
(with Zach Pardos, Shubhendu Trivedi and Neil Heffernan).
(
link)

[56] ``Co-Clustering by bipartite spectral graph partitioning for
out-of-tutor prediction.''
*Proceedings of the 5th International Conference on Educational Data Mining*, 2012, pp. 33-40
(with Zach Pardos, Shubhendu Trivedi and Neil Heffernan).
(
link)

[57] ``A Practical regularity partitioning algorithm and its applications in clustering.'' Technical Report, Worcester Polytechnic Institute, Department of Computer Science, 2012, WPI-CS-TR-12-05 (with Fei Song, Endre Szemerédi and Shubhendu Trivedi). ( link)

[58] ``An improved bound for vertex partitions by connected monochromatic k-regular graphs.''
*Journal of Graph Theory* 73, 2013, pp. 127-145.
(with Stanley Selkow and Fei Song).
(
link)

[59] ``Monochromatic path and cycle partitions in
hypergraphs.''
*Electronic Journal of Combinatorics* 20, 2013, P18.
(with András Gyárfás).
(
link)

[60] ``Applying Clustering to the Problem of Predicting Retention within an ITS:
Comparing Regularity Clustering with Traditional Methods.''
*Proceedings of the 26th International FLAIRS Conference*, 2013, pp. 527-532.
(with Fei Song, Shubhendu Trivedi, Yutao Wang and Neil Heffernan).
(
link)

[61] ``Ramsey numbers for bipartite graphs with small bandwidth.''
*The Seventh European Conference on Combinatorics, Graph Theory and Applications*
CRM Series Volume 16, 2013, pp 165-170 (with G.O. Mota, M. Schacht, A. Taraz).
(
link)

[62] ``Rainbow matchings and partial transversals of Latin squares.''
*Discrete Mathematics* 327, 2014, pp. 96–102.
(with András Gyárfás).
(
link)

[63] ``Monochromatic loose-cycle partitions in hypergraphs.''
*Electronic Journal of Combinatorics* 21, 2014, P2.36
(with András Gyárfás).
(
link)

[64] ``Improved monochromatic loose cycle partitions in
hypergraphs.''
*Discrete Mathematics* 334, 2014, pp. 52–62.
(
link)

[65] ``Rainbow matchings in bipartite multigraphs.''
Accepted for publication in the
*Electronic Journal of Combinatorics*
(with Janos Barat and András Gyárfás).
(
link)

[66] ``Coverings by few monochromatic pieces - a
transition between two Ramsey problems.''
Accepted for publication in
*Graphs and Combinatorics*
(with András Gyárfás and Stanley Selkow).
(
link)

[67] ``Partitioning edge-2-colored graphs by monochromatic paths and cycles.''
Accepted for publication in
*Combinatorica*
(with Jozsef Balog, Janos Barat, Daniel Gerbner and
András Gyárfás).
(
link)

[68] ``Ramsey numbers for bipartite graphs with small bandwidth.'' (extended version)
Accepted for publication in the
*European Journal of Combinatorics* (with G.O. Mota, M. Schacht, A. Taraz).
(
link)

[69] ``Ramsey number of a connected triangle matching.''
Submitted for publication to the
*Journal of Graph Theory*
(with András Gyárfás).
(
link)

[70] ``Monochromatic bounded degree subgraph partitions.''
Submitted for publication to
*Discrete Mathematics*
(with Andrey Grinshpun).
(
link)

[71] ``A quantitative version of the Blow-up Lemma.'' Submitted for publication. ( link)

[72] ``Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles.''
Submitted for publication to the
*Journal of Graph Theory*
(with Janos Barat).
(
link)