1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DS2026
A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth
DongYun Byun, Akira Matsubayashi
The vertex-disjoint paths problem asks whether, given a graph and pairs of vertices , \ldots, , has pairwise vertex-disjoint paths connect…
cs.DS2016
Online Page Migration on Ring Networks in Uniform Model
Amanj Khorramian, Akira Matsubayashi
This paper explores the problem of page migration in ring networks. A ring network is a connected graph, in which each node is connected with exactly two other nodes. In this probl…
cs.DM2014★ 1 cited
Separator-Based Graph Embedding into Multidimensional Grids with Small Edge-Congestion
Akira Matsubayashi
We study the problem of embedding a guest graph with minimum edge-congestion into a multidimensional grid with the same size as that of the guest graph. Based on a well-known notio…