A common extension of the Erdös--Stone theorem and the Alon--Yuster theorem for unbounded graphs
European Journal of Combinatorics
Almost-spanning subgraphs with bounded degree in dense graphs
European Journal of Combinatorics
Critical chromatic number and the complexity of perfect packings in graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
Journal of Combinatorial Theory Series B
On the bandwidth conjecture for 3-colourable graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum H-decompositions of graphs
Journal of Combinatorial Theory Series B
Perfect packings with complete graphs minus an edge
European Journal of Combinatorics
Spanning 3-colourable subgraphs of small bandwidth in dense graphs
Journal of Combinatorial Theory Series B
Triangle packings and 1-factors in oriented graphs
Journal of Combinatorial Theory Series B
Bandwidth theorem for random graphs
Journal of Combinatorial Theory Series B
Minimum Degree Thresholds for Bipartite Graph Tiling
Journal of Graph Theory
Research paper: Combinatorial and computational aspects of graph packing and graph decomposition
Computer Science Review
A Note on Bipartite Graph Tiling
SIAM Journal on Discrete Mathematics
| Hi-index | 0.05 |