PhD Proposal: Steiner Forest and Hard Instances

I explore fundamental NP-hard problems in computer science through the design of approximation algorithms and the generation of hard problem instances.
My research focuses on Steiner network problems, including Prize-Collecting Steiner Forest and k-MST, where we improved key approximation guarantees.
And on quiet planting for k-SAT, where we developed methods to construct indistinguishable hard instances with multiple solutions.