معرفی
Kevin Hendrey is a Research Fellow at the School of Mathematics, Monash University, specializing in graph theory and combinatorics. His research focuses on structural graph theory, treewidth, sparse graphs, and permutation spaces. He has published extensively in top-tier journals such as Combinatorics, Probability and Computing, and The Electronic Journal of Combinatorics.
His work bridges theoretical mathematics and algorithmic applications, with recent contributions to the study of graph classes with bounded treewidth, extremal functions for sparse minors, and permutation space covering radii. Collaborations include international researchers in combinatorics and discrete mathematics.
No scientific awards or grants are explicitly mentioned in the text, though his publications indicate significant scholarly impact. No advising activities or lab affiliations are detailed here.
