My research focuses on graph theory and its applications in optimization algorithms, dedicated to exploring the theoretical properties of graph-structured problems and developing efficient solution methods. Specific research interests include: Graph Algorithms and Complexity: Investigating algorithm design and complexity analysis for classical graph-theoretic problems (such as matching, coloring, path planning, network flow, etc.), with particular attention to approximation algorithms and parameterized algorithms for NP-hard problems. Combinatorial Optimization: Designing exact algorithms, heuristic algorithms, and metaheuristic algorithms (e.g., genetic algorithms, simulated annealing, ant colony optimization, etc.) for discrete optimization problems arising from practical applications, and analyzing their convergence properties and approximation performance. Graph Neural Networks and Optimization: Exploring the potential of Graph Neural Networks (GNNs) in solving combinatorial optimization problems, combining deep learning with traditional optimization methods to improve the efficiency of solving large-scale graph problems. Network Optimization and Applications: Studying optimization problems in complex networks such as social networks, transportation networks, and communication networks, including network design, resource allocation, and robustness analysis.