Michael Wigal

Michael Wigal is a Postdoctoral Research Associate in the Department of Mathematics at the University of Illinois Urbana-Champaign (UIUC), mentored by József Balogh. His research focuses on algorithms, combinatorics, and optimization, with particular interests in graph theory, combinatorial optimization, and discrete mathematics. He completed his Ph.D. under the guidance of Xingxing Yu.

His research spans structural graph theory, approximation algorithms, and combinatorial enumeration, with contributions to topics like Tutte cycles, TSP approximations, and submodular optimization. His work often bridges theoretical and applied aspects of discrete mathematics, addressing fundamental problems in graph algorithms and combinatorial structures.

Michael’s publications reflect a strong emphasis on graph theory and algorithmic approaches, with recent contributions to journal articles such as Journal of Combinatorial Theory, SIAM Journal of Discrete Math, and Mathematical Programming. His research trends highlight a focus on advancing combinatorial methods for solving complex optimization problems and analyzing graph structures.

No scientific awards or major grants are explicitly mentioned in the provided text. His teaching experience includes courses such as Linear Programming (Fall 2024) and Basic Discrete Mathematics (Fall 2023).