Anders Yeo

Anders Yeo is a Professor in the Department of Mathematics and Computer Science at the University of Southern Denmark. His research focuses on graph theory, combinatorics, and algorithms, with a particular emphasis on hypergraphs, directed graphs, and polynomial-time algorithms. He has contributed to topics such as transversals in hypergraphs, feedback arc sets, and stable matchings with constraints. His work frequently intersects theoretical computer science and discrete mathematics, addressing both foundational and applied problems.

Yeo's academic contributions include over 127 research outputs, many of which explore structural and algorithmic aspects of graphs and hypergraphs. His research often involves collaboration with international experts in the field, as evidenced by his network of co-authors and external collaborations. Notable areas of recent focus include the study of tournament graphs, digraph polynomials, and optimization in directed networks. Despite his prolific output, he has no awards explicitly mentioned in the provided texts, though his work has been published in high-impact journals such as Journal of Graph Theory and Discrete Mathematics.

His advising and grants sections remain unreported in the current data. He is affiliated with the university's research groups in theoretical computer science and combinatorics, though specific lab or team affiliations are not detailed here.