Maximilian Gorsky gave a talk on a new algorithm for k-disjoint paths problem with an explicit running time at the Discrete Math Seminar

On May 6, 2026, Maximilian Gorsky from the IBS Discrete Mathematics Group gave a talk at the Discrete Math Seminar on a new algorithm for k-disjoint paths problem with an explicit running time. The title of his talk was “The Disjoint Paths Problem lies in the Oort cloud of algorithms“.