Edouard Bonnet, Tillmann Miltzow,
Flip Distance to a Non-crossing Perfect Matching
http://arxiv.org/pdf/1601.05989v1.pdf

Younjin Kim, Mohit Kumbhat, Zoltán Lóránt Nagy, Balázs Patkós, Alexey Pokrovskiy, Máté Vizer
Identifying codes and searching with balls in graphs
Discrete Applied Mathematics, 193 (2015) 39-47

Zoltan L. Blazsik, Jay Cummings, Willem H. Haemers
Cospectral regular graphs with and without a perfect matching
arXiv:1409.0630 

Victor Falgas-Ravry, Teeradej Kittipassorn, Dániel Korándi, Shoham Letzter, Bhargav P. Narayanan
Separating path systems,
http://arxiv.org/pdf/1311.5051.pdf

Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi, Alexey Pokrovskiy, Günter Rote,
Advantage in the discrete Voronoi game,
arXiv:1303.0523.

Asaf Ferber, Roman Glebov, Michael Krivelevich, Hong Liu, Cory Palmer, Tomas Valla, Máté Vizer,
The biased odd cycle game,
Electronic Journal of Combinatorics Vol. 20, Issue 2 (2013), publ. P9.

Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman,
Avoider-Enforcer star games,
arXiv:1302.2555. 

Zoltán Loránt Nagy, Lale Özkahya, Balázs Patkós, Máté Vizer,
On the ratio of maximum and minimum degree in maximal intersecting families,
Discrete Mathematics, 313(2), 207-211 (2013).

Tamás Terpai,
Large 2-Coloured Matchings in 3-Coloured Complete Hypergraphs,
Electronic Journal of Combinatorics Vol. 19, Issue 4 (2012), publ. P18.

József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor Sárközy,
Partitioning edge-2-colored graphs by monochromatic paths and cycles,
Combinatorica, to appear.

János Barát, Dániel Gerbner,
Edge-decomposition of graphs into copies of a tree with four edges,
Electronic Journal of Combinatorics, accepted.

Pu Gao,
On the geometric Ramsey numbers of trees,
arXiv:1308.5188.

János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós,
Large $B_d$-free and union-free subfamilies,
SIAM J. on Discrete Mathematics 26 (2012), 71-76.