Shortest Disjoint Paths in Planar GraphsResearch Paper
This mission contains the full arbitrary-position search goal, all seventeen numbered milestones, thirteen local definition items and a published planarity reference. The theorem proofs are open Lean declarations.