Nobuji Saito

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Algorithms for routing around a rectangle Discrete Applied Mathematics	1993-05-16	Paper
On the fg-coloring of graphs Combinatorica	1990-01-01	Paper
Algorithms for multicommodity flows in planar graphs Algorithmica	1989-01-01	Paper
On the f-coloring of multigraphs IEEE Transactions on Circuits and Systems	1988-01-01	Paper
Planar Multicommodity Fows, Maximum Matchings and Negative Cycles SIAM Journal on Computing	1986-01-01	Paper
Lower bounds for combinatorial problems on graphs Journal of Algorithms	1985-01-01	Paper
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks SIAM Journal on Computing	1985-01-01	Paper
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs Discrete Applied Mathematics	1984-01-01	Paper
A note on the critical problem for matroids European Journal of Combinatorics	1984-01-01	Paper
An algorithm for finding a large independent set in planar graphs Networks	1983-01-01	Paper
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs SIAM Journal on Computing	1982-01-01	Paper
The smallest 2-connected cubic bipartite planar nonhamiltonian graph Discrete Mathematics	1982-01-01	Paper
Linear-time computability of combinatorial problems on series-parallel graphs Journal of the ACM	1982-01-01	Paper
Combinatorial problems on series-parallel graphs Discrete Applied Mathematics	1981-01-01	Paper
scientific article; zbMATH DE number 3750313 (Why is no real title available?)	1981-01-01	Paper
scientific article; zbMATH DE number 3729461 (Why is no real title available?)	1981-01-01	Paper
A linear 5-coloring algorithm of planar graphs Journal of Algorithms	1981-01-01	Paper
scientific article; zbMATH DE number 3728317 (Why is no real title available?)	1981-01-01	Paper
scientific article; zbMATH DE number 3694608 (Why is no real title available?)	1980-01-01	Paper
An algorithm for finding a short closed spanning walk in a graph Networks	1980-01-01	Paper
scientific article; zbMATH DE number 3694607 (Why is no real title available?)	1980-01-01	Paper
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade Journal of Combinatorial Theory. Series B	1978-01-01	Paper

Research outcomes over time

This page was built for person: Nobuji Saito