Takao Nishizeki

Citado por

	Todos	Desde 2018
Citações	8186	1738
Índice h	37	16
Índice i10	129	30

340

170

255

19851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202336 26 43 62 70 107 88 105 117 122 161 149 153 171 173 192 178 173 186 242 275 270 291 242 281 291 242 264 274 318 326 304 292 296 298 317 261 282 284

Coautores

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

Seguir

Takao Nishizeki

Tohoku University (Emeritus Professor)

Email confirmado em ecei.tohoku.ac.jp - Página inicial

Algorithm Graph Algorithms Graph Drawing Discrete Mathematics Secret sharing


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Secret sharing scheme realizing general access structure M Ito, A Saito, T Nishizeki Electronics and Communications in Japan (Part III: Fundamental Electronic …, 1989	1095	1989
Arboricity and subgraph listing algorithms N Chiba, T Nishizeki SIAM Journal on computing 14 (1), 210-223, 1985	787	1985
Planar graphs: Theory and algorithms T Nishizeki, N Chiba Elsevier, 1988	535	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	399	1982
Planar graph drawing T Nishizeki, MS Rahman World Scientific, 2004	349	2004
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	343	1985
Drawing plane graphs nicely N Chiba, K Onoguchi, T Nishizeki Acta Informatica 22, 187-201, 1985	169	1985
On the 1.1 edge-coloring of multigraphs T Nishizeki, K Kashiwagi SIAM Journal on Discrete Mathematics 3 (3), 391-410, 1990	140	1990
Linear algorithms for convex drawings of planar graphs N Chiba Progress in graph theory, 153-173, 1984	140	1984
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	138	1980
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	134	1989
Multiple assignment scheme for sharing secret M Ito, A Saito, T Nishizeki Journal of Cryptology 6 (1), 15-20, 1993	122	1993
Algorithms for edge coloring bipartite graphs HN Gabow, O Kariv Proceedings of the tenth annual ACM symposium on Theory of computing, 184-192, 1978	94	1978
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	93	2001
Algorithms for routing around a rectangle A Frank, T Nishizeki, N Saito, H Suzuki, É Tardos Discrete Applied Mathematics 40 (3), 363-378, 1992	92	1992
Lower bounds on the cardinality of the maximum matchings of planar graphs T Nishizeki, I Baybars Discrete Mathematics 28 (3), 255-267, 1979	77	1979
Handbook of graph theory, combinatorial optimization, and algorithms K Thulasiraman, S Arumugam, A Brandstädt (No Title), 2016	75	2016
A better than “best possible” algorithm to edge color multigraphs DS Hochbaum, T Nishizeki, DB Shmoys Journal of Algorithms 7 (1), 79-104, 1986	71	1986
Rectangular grid drawings of plane graphs MS Rahman, S Nakano, T Nishizeki Computational Geometry 10 (3), 203-220, 1998	65	1998
Edge-coloring partialk-trees X Zhou, S Nakano, T Nishizeki Journal of Algorithms 21 (3), 598-617, 1996	65	1996

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores