Tamaki Hisao

Hisao Tamaki

Information about the author Hisao Tamaki will soon be added to the site.
Found 6 papers in total
Computing Directed Pathwidth in O(1.89n) Time
Computing Directed Pathwidth in O(1.89n) Time
2016
We give an algorithm for computing the directed pathwidth of a digraph with n vertices...
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
2015
We give a subexponential fixed parameter algorithm for one‐sided crossing...
Route-Enabling Graph Orientation Problems
Route-Enabling Graph Orientation Problems
2013
Given an undirected and edge‐weighted graph G together with a set of ordered...
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size
2012
For graph G , let bw( G ) denote the branchwidth of G and gm( G ) the largest integer...
A Characterization of Planar Graphs by Pseudo‐Line Arrangements
A Characterization of Planar Graphs by Pseudo‐Line Arrangements
2003
Let Γ be an arrangement of pseudo‐lines, i.e., a collection of unbounded...
Multicolor routing in the undirected hypercube
Multicolor routing in the undirected hypercube
2000
An undirected routing problem is a pair ( G,R ) where G is an undirected graph and R...
Papers per page: