Interpreting the problem as a game between a leader who has to remove vertices and a follower that connects the remaining graph, eventually the following formulation results. It contains only constraints that enforce a removal of vertices such that the remaining graph has at least k components.

The naive integer programm is not so great - weak LP relaxation and highly symmetric

In the k-vertex cut problem, the goal is to select as few vertices as possible such that the remaining graph consists of at least k connected components

Lunch seminar at the Center of Algorithmics and Optimization (RWTH Aachen): Fabio Furini held a talk about Graph Disconnection Games

Its the small wrench on the top right, but i am on mobile only rn. Pretty sure i have downloaded bibtex citations from at least some Informa Journals before, but it always is a pain to find (luckily zotero does that for me nowadays)

Maybe i misunderstand, but isn't this what you ask?

Imaging having the answer before you start implementing :)

The master in Bielefeld

Presentation by David Treviño about Humanitarian Logistics at Doctors Without Borders today, organized by Lorena Reyes Rubiano at the Chair of Data and Business Analytics @ RWTH Aachen

Journal article (based on a talk) from 1966, could replace a few words and post on Linkedin as is