| Isomorphic bisections of cubic graphs | 0 | 0.34 | 2021 |
| Partitioning edge-coloured hypergraphs into few monochromatic tight cycles | 0 | 0.34 | 2020 |
| On the Odd Cycle Game and Connected Rules | 0 | 0.34 | 2020 |
| A family of extremal hypergraphs for Ryser's conjecture. | 0 | 0.34 | 2019 |
| On the Size-Ramsey Number of Cycles. | 0 | 0.34 | 2019 |
| Linearly many rainbow trees in properly edge-coloured complete graphs. | 3 | 0.51 | 2018 |
| Ramsey Goodness of Bounded Degree Trees. | 0 | 0.34 | 2018 |
| Ramsey goodness of paths | 1 | 0.37 | 2017 |
| Graphs without proper subgraphs of minimum degree 3 and short cycles | 0 | 0.34 | 2017 |
| Calculating Ramsey Numbers by Partitioning Colored Graphs | 1 | 0.42 | 2017 |
| Rainbow matchings and rainbow connectedness | 2 | 0.45 | 2017 |
| Edge-disjoint rainbow trees in properly coloured complete graphs. | 1 | 0.39 | 2017 |
| Strong Ramsey games: Drawing on an infinite board. | 0 | 0.34 | 2017 |
| Identifying codes and searching with balls in graphs | 2 | 0.47 | 2015 |
| Rainbow matchings and connectedness of coloured graphs | 0 | 0.34 | 2015 |
| Partitioning edge-coloured complete graphs into monochromatic cycles and paths. | 24 | 1.29 | 2014 |
| Edge Growth In Graph Powers | 0 | 0.34 | 2014 |
| Advantage in the discrete Voronoi game. | 0 | 0.34 | 2013 |
| Partitioning edge-coloured complete graphs into monochromatic cycles. | 0 | 0.34 | 2013 |
| Growth of graph powers | 3 | 3.98 | 2011 |
| Partitioning 3-coloured complete graphs into three monochromatic paths. | 5 | 0.48 | 2011 |
