5 citations · 9 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
A faster fixed parameter algorithm for two-layer crossing minimization
Yasuaki Kobayashi, Hisao Tamaki
We give an algorithm that decides whether the bipartite crossing number of a given graph is at most . The running time of the algorithm is upper bounded by …
cs.DS2015★ 4 cited
On the pathwidth of almost semicomplete digraphs
Kenta Kitsunai, Yasuaki Kobayashi, Hisao Tamaki
We call a digraph {\em -semicomplete} if each vertex of the digraph has at most non-neighbors, where a non-neighbor of a vertex is a vertex such that there is…