Yang Liu

Yang Liu is a computer scientist specializing in theoretical computer science, particularly in the design and analysis of parameterized and exact algorithms. He has been affiliated with institutions such as Texas A&M University and has collaborated extensively with researchers like Jianer Chen and Songjian Lu. His work primarily focuses on NP-hard graph problems, including feedback vertex set, multiway cut, matching, and packing, where he has contributed improved fixed-parameter tractable algorithms and kernelization techniques.

His research lies at the intersection of algorithms, complexity theory, and combinatorics. Key areas include:

• Fixed-parameter tractability (FPT)
• Kernelization and measure-and-conquer methods
• Graph partitioning and structural graph theory
• Randomized and deterministic exact algorithms
• Algebraic methods in polynomial testing

His publications in top journals such as Journal of the ACM, Algorithmica, and Theoretical Computer Science demonstrate a consistent contribution to foundational algorithmic research. The article trends show a strong focus on solving hard combinatorial problems through novel algorithmic frameworks, often improving time complexity or kernel bounds.

Notable scientific contributions include:

• A landmark 2008 JACM paper proving that the Directed Feedback Vertex Set problem is fixed-parameter tractable.
• Improvements in kernel sizes for feedback vertex and packing problems.
• Applications of color-coding and iterative expansion in 3D-matching.

While no explicit information about advisees or grants is available, his long-term collaboration network suggests a role in mentoring and team-based research. He has not been associated with any lab or research center in the provided data.