default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNobuji Saito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j20]Norishige Chiba, Ken Ohshida, Kazunobu Muraoka, Nobuji Saito:
Visual Simulation of Leaf Arrangement and Autumn Colours. Comput. Animat. Virtual Worlds 7(2): 79-93 (1996)- 1995
- [j19]Norishige Chiba, Shinji Sanakanishi, Kenichiro Yokoyama, Isao Otawara, Kazunobu Muraoka, Nobuji Saito:
Visual simulation of water currents using a particle-based behavioural model. Comput. Animat. Virtual Worlds 6(3): 155-171 (1995) - 1994
- [j18]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. Comput. Graph. 18(4): 469-479 (1994) - 1992
- [j17]András Frank
, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos:
Algorithms for Routing around a Rectangle. Discret. Appl. Math. 40(4): 363-378 (1992) - 1990
- [j16]Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito:
On the fg-coloring of graphs. Comb. 10(1): 67-80 (1990)
1980 – 1989
- 1989
- [j15]Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito:
Algorithms for Multicommodity Flows in Planar Graphs. Algorithmica 4(4): 471-501 (1989) - 1986
- [j14]Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito:
Planar Multicommodity Flows, Maximum Matchings and Negative Cycles. SIAM J. Comput. 15(2): 495-510 (1986) - 1985
- [j13]Hiroyuki Nakayama, Takao Nishizeki, Nobuji Saito:
Lower Bounds for Combinatorial Problems on Graphs. J. Algorithms 6(3): 393-399 (1985) - [j12]Kazuhiko Matsumoto, Takao Nishizeki, Nobuji Saito:
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks. SIAM J. Comput. 14(2): 289-302 (1985) - [j11]Takao Nishizeki, Nobuji Saito, Kiminobu Suzuki:
A Linear-Time Routing Algorithm for Convex Grids. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4(1): 68-76 (1985) - [c4]Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito:
Multicommodity Flows in Planar Undirected Graphs and Shortest Paths. STOC 1985: 195-204 - 1984
- [j10]Takao Asano, Shunji Kikuchi, Nobuji Saito:
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs. Discret. Appl. Math. 7(1): 1-15 (1984) - [j9]Takao Asano, Takao Nishizeki, Nobuji Saito, James G. Oxley:
A Note on the Critical Problem for Matroids. Eur. J. Comb. 5(2): 93-97 (1984) - 1983
- [j8]Norishige Chiba, Takao Nishizeki, Nobuji Saito:
An algorithm for finding a large independent set in planar graphs. Networks 13(2): 247-252 (1983) - 1982
- [j7]Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary:
The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38(1): 1-6 (1982) - [j6]K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3): 623-641 (1982) - [j5]Norishige Chiba, Takao Nishizeki, Nobuji Saito:
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs. SIAM J. Comput. 11(4): 663-675 (1982) - 1981
- [j4]K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs. Discret. Appl. Math. 3(1): 75-76 (1981) - [j3]Norishige Chiba, Takao Nishizeki, Nobuji Saito:
A Linear 5-Coloring Algorithm of Planar Graphs. J. Algorithms 2(4): 317-327 (1981) - [e1]Nobuji Saito, Takao Nishizeki:
Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings. Lecture Notes in Computer Science 108, Springer 1981, ISBN 3-540-10704-5 [contents] - 1980
- [j2]K. Takamizawa, Takao Nishizeki, Nobuji Saito:
An algorithm for finding a short closed spanning walk in a graph. Networks 10(3): 249-263 (1980) - [c3]Norishige Chiba, Takao Nishizeki, Nobuji Saito:
A linear algorithm for five-coloring a planar graph. Graph Theory and Algorithms 1980: 9-19 - [c2]K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs. Graph Theory and Algorithms 1980: 79-94 - [c1]Takao Asano, Shunji Kikuchi, Nobuji Saito:
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. Graph Theory and Algorithms 1980: 182-195
1970 – 1979
- 1978
- [j1]Takao Nishizeki, Nobuji Saito:
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade. J. Comb. Theory B 24(3): 344-361 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
