1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +1
We study the \textsc{-Fixed Cardinality Graph Partitioning (-FCGP)} problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In…
Parameterized Algorithms for Colored Clustering
Leon Kellerhals, Tomohiro Koana, Pascal Kunz +1
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many ed…