Reachability in Graphs with Polynomially Many Surface Non-separating Cycles is in UL. - Neelabjo Shubhashis Choudhury; Chetan Gupta 002; Raghunath Tewari (IWOCA, 2026)