Home » News » seminar » Meike Hatzel gave a talk on the parameterized complexity of finding a vertex cut of small size separating three pairs of terminals on a directed graph at the Discrete Math Seminar

Meike Hatzel gave a talk on the parameterized complexity of finding a vertex cut of small size separating three pairs of terminals on a directed graph at the Discrete Math Seminar