Takao Nishizeki

Citata da

	Tutte	Dal 2016
Citazioni	7179	1523
Indice H	36	16
i10-index	118	30

340

170

255

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202130 26 38 53 59 91 71 100 108 116 139 135 137 162 166 185 175 174 191 231 241 260 295 251 289 298 251 279 261 318 326 284 272 287 298 330 51

Coautori

Shinichi NakanoProfessor of Computer Science, Gunma UniversityEmail verificata su cs.gunma-u.ac.jp
Md. Saidur RahmanProfessor, Dept. of Computer Science and Engineering, BUET, Dhaka-1000Email verificata su cse.buet.ac.bd
Norishige ChibaProfessor Emeritus at Iwate UniversityEmail verificata su iwate-u.ac.jp
Takaaki MizukiTohoku UniversityEmail verificata su cc.tohoku.ac.jp
Tetsuo AsanoProfessor of School of Information Science, JAISTEmail verificata su jaist.ac.jp
Yasuhito AsanoKyoto UniversityEmail verificata su i.kyoto-u.ac.jp
Kei UchizawaEmail verificata su ecei.tohoku.ac.jp
Takeshi TokuyamaKwansei Gakuin UniversityEmail verificata su kwansei.ac.jp
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Email verificata su uni-rostock.de
Eva TardosProfessor of Computer Science, Cornell UniversityEmail verificata su cornell.edu
Andras FrankProfessor of Mathematics, Eotvos University BudapestEmail verificata su cs.elte.hu
Jens VygenProfessor of Discrete Mathematics, University of BonnEmail verificata su or.uni-bonn.de
Masashi ToyodaInstitute of Industrial Science, University of TokyoEmail verificata su acm.org
David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceEmail verificata su cs.cornell.edu
Dorit S. HOCHBAUMUC BerkeleyEmail verificata su ieor.berkeley.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Takeaki UnoNational Institute of Informatics, JapanEmail verificata su nii.jp
Marek ChrobakUniversity of California at RiversideEmail verificata su cs.ucr.edu
K. ThulasiramanUniversity of OklahomaEmail verificata su ou.edu
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentEmail verificata su research.att.com

Takao Nishizeki

Tohoku University (Emeritus Professor)

Email verificata su ecei.tohoku.ac.jp - Home page

Algorithm Graph Algorithms Graph Drawing Discrete Mathematics Secret sharing


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Secret sharing scheme realizing general access structure M Ito, A Saito, T Nishizeki Electronics and Communications in Japan (Part III: Fundamental Electronic …, 1989	937	1989
Arboricity and subgraph listing algorithms N Chiba, T Nishizeki SIAM Journal on computing 14 (1), 210-223, 1985	632	1985
Planar graphs: Theory and algorithms T Nishizeki, N Chiba Elsevier, 1988	479	1988
Linear-time computability of combinatorial problems on series-parallel graphs K Takamizawa, T Nishizeki, N Saito Journal of the ACM (JACM) 29 (3), 623-641, 1982	350	1982
A linear algorithm for embedding planar graphs using PQ-trees N Chiba, T Nishizeki, S Abe, T Ozawa Journal of computer and system sciences 30 (1), 54-76, 1985	309	1985
Planar graph drawing T Nishizeki, MS Rahman World Scientific, 2004	283	2004
Drawing plane graphs nicely N Chiba, K Onoguchi, T Nishizeki Acta Informatica 22 (2), 187-201, 1985	141	1985
On the 1.1 edge-coloring of multigraphs T Nishizeki, K Kashiwagi SIAM Journal on Discrete Mathematics 3 (3), 391-410, 1990	138	1990
Linear algorithms for convex drawings of planar graphs N Chiba, T Yamanouchi, T Nishizeki Progress in graph theory 173, 153-173, 1984	123	1984
The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs N Chiba, T Nishizeki Journal of Algorithms 10 (2), 187-211, 1989	122	1989
NP-completeness of the Hamiltonian cycle problem for bipartite graphs T Akiyama, T Nishizeki, N Saito Journal of Information processing 3 (2), 73-76, 1980	113	1980
Multiple assignment scheme for sharing secret M Ito, A Saito, T Nishizeki Journal of Cryptology 6 (1), 15-20, 1993	105	1993
Algorithms for routing around a rectangle A Frank, T Nishizeki, N Saito, H Suzuki, É Tardos Discrete Applied Mathematics 40 (3), 363-378, 1992	88	1992
The edge-disjoint paths problem is NP-complete for series–parallel graphs T Nishizeki, J Vygen, X Zhou Discrete Applied Mathematics 115 (1-3), 177-186, 2001	84	2001
Lower bounds on the cardinality of the maximum matchings of planar graphs T Nishizeki, I Baybars Discrete Mathematics 28 (3), 255-267, 1979	70	1979
A better than “best possible” algorithm to edge color multigraphs DS Hochbaum, T Nishizeki, DB Shmoys Journal of Algorithms 7 (1), 79-104, 1986	67	1986
Algorithms for edge-coloring graphs HN Gabow Technical Report, 1985	63	1985
Analysis and design of univariate subdivision schemes M Sabin Springer Science & Business Media, 2010	62	2010
A linear-time algorithm for four-partitioning four-connected planar graphs S Nakano, MS Rahman, T Nishizeki Information Processing Letters 62 (6), 315-322, 1997	61	1997
A linear algorithm for bipartition of biconnected graphs H Suzuki, N Takahashi, T Nishizeki Information Processing Letters 33 (5), 227-231, 1990	60	1990

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori