The SCEAS System
| |||||||

## Search the dblp DataBase
Nobuji Saito:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Takao Asano, S. Kikuchi, Nobuji Saito
**An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.**[Citation Graph (0, 0)][DBLP] Graph Theory and Algorithms, 1980, pp:182-195 [Conf] - Norishige Chiba, Takao Nishizeki, Nobuji Saito
**A linear algorithm for five-coloring a planar graph.**[Citation Graph (0, 0)][DBLP] Graph Theory and Algorithms, 1980, pp:9-19 [Conf] - K. Takamizawa, Takao Nishizeki, Nobuji Saito
**Combinatorial problems on series-parallel graphs.**[Citation Graph (0, 0)][DBLP] Graph Theory and Algorithms, 1980, pp:79-94 [Conf] - Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
**Multicommodity Flows in Planar Undirected Graphs and Shortest Paths**[Citation Graph (0, 0)][DBLP] STOC, 1985, pp:195-204 [Conf] - Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito
**Algorithms for Multicommodity Flows in Planar Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1989, v:4, n:4, pp:471-501 [Journal] - Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, Mamoru Miura, Nobuji Saito
**A growth model having the abilities of growth-regulations for simulating visual nature of botanical trees.**[Citation Graph (0, 0)][DBLP] Computers & Graphics, 1994, v:18, n:4, pp:469-479 [Journal] - Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito
**On the fg-coloring of graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1990, v:10, n:1, pp:67-80 [Journal] - András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki
**Algorithms for Routing around a Rectangle.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:40, n:4, pp:363-378 [Journal] - K. Takamizawa, Takao Nishizeki, Nobuji Saito
**Linear-time computability of combinatorial problems on series-parallel graphs.**[Citation Graph (0, 0)][DBLP] J. ACM, 1982, v:29, n:3, pp:623-641 [Journal] - Norishige Chiba, Takao Nishizeki, Nobuji Saito
**A Linear 5-Coloring Algorithm of Planar Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1981, v:2, n:4, pp:317-327 [Journal] - Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito
**Lower Bounds for Combinatorial Problems on Graphs.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1985, v:6, n:3, pp:393-399 [Journal] - Takao Nishizeki, Nobuji Saito
**Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1978, v:24, n:3, pp:344-361 [Journal] - Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, Nobuji Saito
**Visual Simulation of Leaf Arrangement and Autumn Colours.**[Citation Graph (0, 0)][DBLP] Journal of Visualization and Computer Animation, 1996, v:7, n:2, pp:79-93 [Journal] - Norishige Chiba, Takao Nishizeki, Nobuji Saito
**An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1982, v:11, n:4, pp:663-675 [Journal] - Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
**An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1985, v:14, n:2, pp:289-302 [Journal] - Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito
**Planar Multicommodity Flows, Maximum Matchings and Negative Cycles.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:2, pp:495-510 [Journal] - Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki
**A Linear-Time Routing Algorithm for Convex Grids.**[Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1985, v:4, n:1, pp:68-76 [Journal] - Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary
**The smallest 2-connected cubic bipartite planar nonhamiltonian graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:38, n:1, pp:1-6 [Journal]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |