Takao Nishizeki (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Takao Nishizeki" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

451^st place

277^th place

2semanticscholar.org

11^th place

8^th place

low place

low place

9,956^th place

low place

low place

low place

1denseoutliers.blogspot.com

low place

low place

low place

low place

1,185^th place

840^th place

low place

low place

acm.org

awards.acm.org

ACM Fellow award citation, retrieved 2015-03-19.

ams.org

mathscinet.ams.org

Takamizawa, Nishizeki & Saito (1982). Takamizawa, K.; Nishizeki, T.; Saito, N. (1982), "Linear-time computability of combinatorial problems on series–parallel graphs", Journal of the ACM, 29 (3): 623–641, doi:10.1145/322326.322328, MR 0666771, S2CID 16082154.
Chiba & Nishizeki (1985). Chiba, Norishige; Nishizeki, Takao (1985), "Arboricity and subgraph listing algorithms", SIAM Journal on Computing, 14 (1): 210–223, doi:10.1137/0214017, MR 0774940, S2CID 207051803.
Chiba et al. (1985). Chiba, Norishige; Nishizeki, Takao; Abe, Shigenobu; Ozawa, Takao (1985), "A linear algorithm for embedding planar graphs using PQ-trees", Journal of Computer and System Sciences, 30 (1): 54–76, doi:10.1016/0022-0000(85)90004-2, MR 0788831.
Nishizeki & Chiba (1988); Nishizeki & Rahman (2004). Nishizeki, Takao; Rahman, Md. Saidur (2004), Planar Graph Drawing, Lecture Notes Series on Computing, vol. 12, World Scientific, doi:10.1142/5648, ISBN 978-981-256-033-9, MR 2112244.

denseoutliers.blogspot.com

ISAAC Day 1, Joachim Gudmundsson, dense outliers, December 21, 2007, retrieved 2015-03-19.

doi.org

Takamizawa, Nishizeki & Saito (1982). Takamizawa, K.; Nishizeki, T.; Saito, N. (1982), "Linear-time computability of combinatorial problems on series–parallel graphs", Journal of the ACM, 29 (3): 623–641, doi:10.1145/322326.322328, MR 0666771, S2CID 16082154.
Chiba & Nishizeki (1985). Chiba, Norishige; Nishizeki, Takao (1985), "Arboricity and subgraph listing algorithms", SIAM Journal on Computing, 14 (1): 210–223, doi:10.1137/0214017, MR 0774940, S2CID 207051803.
Chiba et al. (1985). Chiba, Norishige; Nishizeki, Takao; Abe, Shigenobu; Ozawa, Takao (1985), "A linear algorithm for embedding planar graphs using PQ-trees", Journal of Computer and System Sciences, 30 (1): 54–76, doi:10.1016/0022-0000(85)90004-2, MR 0788831.
Nishizeki & Chiba (1988); Nishizeki & Rahman (2004). Nishizeki, Takao; Rahman, Md. Saidur (2004), Planar Graph Drawing, Lecture Notes Series on Computing, vol. 12, World Scientific, doi:10.1142/5648, ISBN 978-981-256-033-9, MR 2112244.

ieee-jp.org

1995 New Fellows, IEEE Japan Section, retrieved 2015-03-19.

kwansei.ac.jp

researchers.kwansei.ac.jp

Faculty profile, Kwansei Gakuin University, retrieved 2015-03-19.

org.bd

bas.org.bd

Member profile, Bangladesh Academy of Sciences, retrieved 2015-03-20.

semanticscholar.org

api.semanticscholar.org

Takamizawa, Nishizeki & Saito (1982). Takamizawa, K.; Nishizeki, T.; Saito, N. (1982), "Linear-time computability of combinatorial problems on series–parallel graphs", Journal of the ACM, 29 (3): 623–641, doi:10.1145/322326.322328, MR 0666771, S2CID 16082154.
Chiba & Nishizeki (1985). Chiba, Norishige; Nishizeki, Takao (1985), "Arboricity and subgraph listing algorithms", SIAM Journal on Computing, 14 (1): 210–223, doi:10.1137/0214017, MR 0774940, S2CID 207051803.

tohoku.ac.jp

ecei.tohoku.ac.jp

Biography, Tohoku University, retrieved 2015-03-19.

uniroma3.it

list.dia.uniroma3.it

Okamoto, Yoshio (1 February 2022), "Takao Nishizeki", GDNET