Akira Matsubayashi

activity

20142026

most citedSeparator-Based Graph Embedding into Multidimensional Grids with Small Edge-Congestion

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

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth

DongYun Byun, Akira Matsubayashi

The $k$ vertex-disjoint paths problem asks whether, given a graph $G$ and $k$ pairs of vertices $(s_{1}, t_{1})$ , \ldots, $(s_{k}, t_{k})$ , $G$ has $k$ 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…