Nobuji Saito

Available identifiers

zbMath Open saito.nobujiMaRDI QIDQ788488

List of research outcomes

Publication	Date of Publication	Type
Algorithms for routing around a rectangle	1993-05-16	Paper
On the fg-coloring of graphs	1990-01-01	Paper
Algorithms for multicommodity flows in planar graphs	1989-01-01	Paper
On the f-coloring of multigraphs	1988-01-01	Paper
Planar Multicommodity Fows, Maximum Matchings and Negative Cycles	1986-01-01	Paper
Lower bounds for combinatorial problems on graphs	1985-01-01	Paper
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks	1985-01-01	Paper
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs	1984-01-01	Paper
A note on the critical problem for matroids	1984-01-01	Paper
An algorithm for finding a large independent set in planar graphs	1983-01-01	Paper
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs	1982-01-01	Paper
The smallest 2-connected cubic bipartite planar nonhamiltonian graph	1982-01-01	Paper
Linear-time computability of combinatorial problems on series-parallel graphs	1982-01-01	Paper
Combinatorial problems on series-parallel graphs	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3933762	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3917502	1981-01-01	Paper
A linear 5-coloring algorithm of planar graphs	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3916605	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3888545	1980-01-01	Paper
An algorithm for finding a short closed spanning walk in a graph	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3888543	1980-01-01	Paper
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade	1978-01-01	Paper

Research outcomes over time

This page was built for person: Nobuji Saito