Holiest minimum-cost paths and flows in surface graphs. - Jeff Erickson 001; Kyle Fox; Luvsandondov Lkhamsuren (STOC, 2018)