Shizhou Yang (He/Him)

 

 

Current research project

Most graph optimization problems are computationally hard, even to approximate. It is then natural to restrict the input and ask: Which input restrictions lead to efficient algorithms? 
Knowing that a graph has small "width" is typically useful for designing efficient algorithms for many such problems. The project aims at determining exactly which graph restrictions ensure small width, for a variety of width parameters.  

Biography

(2016-2020) MMath in Mathematics & Statistics at University of Oxford
(2021-) PhD in Mathematics at Queen's University Belfast  

Research interests

• Graph Theory
• Algorithmics