E-LIB Suche - Ergebnisse für: Saito, Nobuji

1

Supporting Mobile Language Learning outside Classrooms:

, In: Sixth IEEE International Conference on Advanced Learning Technologies (ICALT'06),

Ueda, Takahito ; Oishi, Yasuko ; Yano, Yoneo... - p. 928-932 , 2006

Link: https://doi.org/10.1109/..

2

A growth model having the abilities of growth-regulations f..:

Chiba, Norishige ; Ohshida, Ken ; Muraoka, Kazunobu..
Computers & Graphics. 18 (1994) 4 - p. 469-479 , 1994

Link: https://doi.org/10.1016/..

3

Algorithms for routing around a rectangle:

Frank, András ; Nishizeki, Takao ; Saito, Nobuji..
Discrete Applied Mathematics. 40 (1992) 3 - p. 363-378 , 1992

Link: https://doi.org/10.1016/..

4

Algorithms for multicommodity flows in planar graphs:

Suzuki, Hitoshi ; Nishizeki, Takao ; Saito, Nobuji
Algorithmica. 4 (1989) 1-4 - p. 471-501 , 1989

Link: https://doi.org/10.1007/..

5

Planar Multicommodity Fows, Maximum Matchings and Negative ..:

Matsumoto, Kazuhiko ; Nishizeki, Takao ; Saito, Nobuji
SIAM Journal on Computing. 15 (1986) 2 - p. 495-510 , 1986

Link: https://doi.org/10.1137/..

6

Lower bounds for combinatorial problems on graphs:

Nakayama, Hiroyuki ; Nishizeki, Takao ; Saito, Nobuji
Journal of Algorithms. 6 (1985) 3 - p. 393-399 , 1985

Link: https://doi.org/10.1016/..

7

An Efficient Algorithm for Finding Multicommodity Flows in ..:

Matsumoto, Kazuhiko ; Nishizeki, Takao ; Saito, Nobuji
SIAM Journal on Computing. 14 (1985) 2 - p. 289-302 , 1985

Link: https://doi.org/10.1137/..

8

A linear algorithm for finding Hamiltonian cycles in 4-conn..:

Asano, Takao ; Kikuchi, Shunji ; Saito, Nobuji
Discrete Applied Mathematics. 7 (1984) 1 - p. 1-15 , 1984

Link: https://doi.org/10.1016/..

9

A Note on the Critical Problem for Matroids:

Asano, Takao ; Nishizeki, Takao ; Saito, Nobuji.
European Journal of Combinatorics. 5 (1984) 2 - p. 93-97 , 1984

Link: https://doi.org/10.1016/..

10

An algorithm for finding a large independent set in planar ..:

Chiba, Norishige ; Nishizeki, Takao ; Saito, Nobuji
Networks. 13 (1983) 2 - p. 247-252 , 1983

Link: https://doi.org/10.1002/..

11

An Approximation Algorithm for the Maximum Independent Set ..:

Chiba, Norishige ; Nishizeki, Takao ; Saito, Nobuji
SIAM Journal on Computing. 11 (1982) 4 - p. 663-675 , 1982

Link: https://doi.org/10.1137/..

12

The smallest 2-connected cubic bipartite planar nonhamilton..:

Asano, Takao ; Saito, Nobuji ; Exoo, Geoffrey.
Discrete Mathematics. 38 (1982) 1 - p. 1-6 , 1982

Link: https://doi.org/10.1016/..

13

Graph theory and algorithms

17th Symposium of Research Institute of Electrical Communic... Lecture notes in computer science ; 108

Saito, Nobuji , 1981

Link: http://dx.doi.org/10.100..

Copies: Zentrale:Magazin 01.f.6752

14

17th Symposium of Research Institute of Electrical Communic... Lecture notes in computer science ; 108;Symposium of Research Institute of Electrical Communication, Tohoku University Sendai, Japan ; 17

Saito, Nobuji ; Saito, N. , 1981

Copies: Zentrale:Magazin 01.f.6752

15

A linear 5-coloring algorithm of planar graphs:

Chiba, Norishige ; Nishizeki, Takao ; Saito, Nobuji
Journal of Algorithms. 2 (1981) 4 - p. 317-327 , 1981

Link: https://doi.org/10.1016/..