activity
20192024
most citedLength-Bounded Cuts: Proper Interval Graphs and Structural Parameters

2 citations · 4 across the 5 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DS2024

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication

Matthias Bentert, Klaus Heeger, Tomohiro Koana

We study the computational complexity of several polynomial-time-solvable graph problems parameterized by vertex integrity, a measure of a graph's vulnerability to vertex removal i…