معرفی
Guoli Ding is the Hubert Butts Professor of Mathematics at Louisiana State University (LSU), Department of Mathematics. He holds a Ph.D. from RUTCOR, Rutgers University (1991), advised by Paul D. Seymour. His research focuses on graph theory, matroid theory, combinatorial optimization, and structural graph theory. Notable contributions include work on graph minors, connectivity, feedback arc sets, and box-perfect graphs.
Education:
- Ph.D., RUTCOR, Rutgers University, 1991
- M.S., Institute of System Science, Academia Sinica, Beijing
- B.S., University of Science and Technology of China
Research Interests:
- Graph minors and structural properties
- Connectivity and graph algorithms
- Matroid theory and its applications
- Combinatorial optimization problems
- Algorithmic graph theory
Recent Work Trends: His recent publications (2016–2025) emphasize structural graph theory, including chain theorems for 4-connected graphs, unavoidable subgraphs, and matroid minors. Collaborations with researchers like Xujin Chen, Wenan Zang, and Perry Iverson highlight work on tournament rankings, feedback arc sets, and graph immersion properties.
Awards: No explicit awards listed, but his extensive publication record and editorial roles indicate sustained academic recognition.
Grants & Labs: Active in securing grants (e.g., NSF support for combinatorics projects) and collaborates with the LSU Combinatorics Group. His research intersects with algorithm design and discrete optimization, with applications in computer science and operations research.
