Tomohiro Koana gave a talk on a faster FPT algorithm for expanding a subgraph to be a 2-connected subgraph of a given graph by adding at most k edges

On August 4, 2026, Tomohiro Koana from University of Tokyo gave a talk at the Discrete Math Seminar on a single-exponential fixed-parameter algorithm for enlarging a subgraph with at most k edges to make a 2-connected subgraph of a given graph. The title of his talk was “A Single-Exponential FPT Algorithm for 2-Vertex-Connectivity Augmentation“.