The directed next-to-shortest path problem was solved by 2 undergrads! arxiv.org/abs/2511.04345 Look out for Kuowen Chen and Yiran Zhang this PhD application cycle.

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs

Given a graph and a pair of terminals $s$, $t$, the next-to-shortest path problem asks for an $s\!\to \!t$ (simple) path that is shortest among all not shortest $s\!\to \!t$ paths (if one exists). Thi...

arxiv.org

If you are interested in applying to the PhD program at University of Michigan CSE but paying the application fee poses a challenge, see here for how to apply for an application fee waiver: cse.engin.umich.edu/academics/gr...

If you are a prospective CS graduate student who wants tips on how to prepare your application and what grad school is like, register to join us on zoom for University of Michigan's "Explore Grad Studies in CSE" workshop. cse.engin.umich.edu/academics/gr...