3 citations · 12 across the 26 of their papers we have counts for
4 papers · 1 filter
A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a -Minor
Carla Groenland, Jesper Nederlof, Tomohiro Koana
We study a special case of the Steiner Tree problem in which the input graph does not have a minor model of a complete graph on 4 vertices for which all branch sets contain a termi…
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
Tomohiro Koana, Nidhi Purohit, Kirill Simonov
In Clique Cover, given a graph and an integer , the task is to partition the vertices of into cliques. Clique Cover on unit ball graphs has a natural interpretation…
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…
Faster algorithms on linear delta-matroids
Tomohiro Koana, Magnus Wahlström
We show new algorithms and constructions over linear delta-matroids. We observe an alternative representation for linear delta-matroids, as a contraction representation over a skew…