Nishizeki Takao

Takao Nishizeki

Information about the author Takao Nishizeki will soon be added to the site.
Found 6 papers in total
Minimum Cost Partitions of Trees with Supply and Demand
Minimum Cost Partitions of Trees with Supply and Demand
2012
Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex,...
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range
2012
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that...
Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals
Finding a Region with the Minimum Total L 1 Distance from Prescribed Terminals
2003
Given k terminals and n axis‐parallel rectangular obstacles on the plane, our...
Algorithms for routing around a rectangle
Algorithms for routing around a rectangle
1992
Simple efficient algorithms are given for three routing problems around a rectangle....
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
1989
An algorithm is presented for finding a Hamiltonian cycle in 4-connected planar...
An algorithm for finding a forest in a planar graph-Case in which all terminals of each net lie on one of two specified face boundaries
An algorithm for finding a forest in a planar graph-Case in which all terminals of each net lie on one of two specified face boundaries
1988
Several routing problems such as VLSI river routing and one-layer routing can be...
Papers per page: