Takao Nishizeki

引用先

	すべて	2019 年以来
引用	8763	1794
h 指標	39	17
i10 指標	131	29

380

190

285

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202442 30 42 78 78 119 89 110 119 129 163 159 158 177 180 206 184 178 192 250 284 265 295 253 297 305 243 278 280 321 330 309 299 317 311 307 271 292 378 235

共著者

Md. Saidur RahmanProfessor, Dept. of Computer Science and Engineering, BUET, Dhaka-1000確認したメールアドレス: cse.buet.ac.bd
Shinichi NakanoProfessor of Computer Science, Gunma University確認したメールアドレス: gunma-u.ac.jp
Norishige ChibaProfessor Emeritus at Iwate University確認したメールアドレス: iwate-u.ac.jp
Takaaki MizukiTohoku University確認したメールアドレス: cc.tohoku.ac.jp
Yasuhito AsanoKyoto University確認したメールアドレス: i.kyoto-u.ac.jp
Tetsuo AsanoProfessor of School of Information Science, JAIST確認したメールアドレス: jaist.ac.jp
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany 確認したメールアドレス: uni-rostock.de
K. ThulasiramanUniversity of Oklahoma確認したメールアドレス: ou.edu
Jens VygenProfessor of Discrete Mathematics, University of Bonn確認したメールアドレス: or.uni-bonn.de
Eva TardosProfessor of Computer Science, Cornell University確認したメールアドレス: cornell.edu
András FrankProfessor emeritus, Eötvös University Budapest確認したメールアドレス: cs.elte.hu
Takeaki UnoNational Institute of Informatics, Japan確認したメールアドレス: nii.jp
David ShmoysProfessor of Operations Research & Information Engineering and of Computer Science確認したメールアドレス: cs.cornell.edu
Dorit S. HOCHBAUMUC Berkeley確認したメールアドレス: ieor.berkeley.edu
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology確認したメールアドレス: mit.edu
Takeshi TokuyamaKwansei Gakuin University確認したメールアドレス: kwansei.ac.jp
Marek ChrobakUniversity of California at Riverside確認したメールアドレス: cs.ucr.edu
David S. JohnsonVisiting Professor, Columbia University Computer Science Department確認したメールアドレス: research.att.com
周暁tohoku university確認したメールアドレス: tohoku.ac.jp
Masashi ToyodaInstitute of Industrial Science, The University of Tokyo確認したメールアドレス: acm.org

フォロー

Takao Nishizeki

Tohoku University (Emeritus Professor)

確認したメールアドレス: ecei.tohoku.ac.jp - ホームページ

Algorithm Graph Algorithms Graph Drawing Discrete Mathematics Secret sharing


タイトル引用回数順公開年順タイトル順	引用先引用先	年
Secret sharing scheme realizing general access structure M Ito, A Saito, T Nishizeki Electronics and Communications in Japan (Part III: Fundamental Electronic …, 1989	1176	1989
Arboricity and subgraph listing algorithms N Chiba, T Nishizeki SIAM Journal on computing 14 (1), 210-223, 1985	851	1985
Planar graphs: Theory and algorithms T Nishizeki, N Chiba Elsevier, 1988	552	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	419	1982
Planar graph drawing T Nishizeki, MS Rahman World Scientific, 2004	365	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	351	1985
Algorithms for edge coloring bipartite graphs HN Gabow, O Kariv Proceedings of the tenth annual ACM symposium on Theory of computing, 184-192, 1978	291	1978
Drawing plane graphs nicely N Chiba, K Onoguchi, T Nishizeki Acta Informatica 22, 187-201, 1985	179	1985
Linear algorithms for convex drawings of planar graphs N Chiba Progress in graph theory, 153-173, 1984	146	1984
On the 1.1 edge-coloring of multigraphs T Nishizeki, K Kashiwagi SIAM Journal on Discrete Mathematics 3 (3), 391-410, 1990	145	1990
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	144	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	137	1989
Multiple assignment scheme for sharing secret M Ito, A Saito, T Nishizeki Journal of Cryptology 6 (1), 15-20, 1993	129	1993
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	97	2001
Algorithms for routing around a rectangle A Frank, T Nishizeki, N Saito, H Suzuki, É Tardos Discrete Applied Mathematics 40 (3), 363-378, 1992	94	1992
Lower bounds on the cardinality of the maximum matchings of planar graphs T Nishizeki, I Baybars Discrete Mathematics 28 (3), 255-267, 1979	84	1979
Handbook of graph theory, combinatorial optimization, and algorithms K Thulasiraman, S Arumugam, A Brandstädt (No Title), 2016	78	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	77	1986
Orthogonal drawings of plane graphs without bends MS Rahman, T Nishizeki, M Naznin Journal of Graph Algorithms and Applications 7 (4), 335-362, 2003	67	2003
Grid drawings of 4-connected plane graphs K Miura, SI Nakano, T Nishizeki Discrete & Computational Geometry 26, 73-87, 2001	67	2001

現在システムで処理を実行できません。しばらくしてからもう一度お試しください。

論文 1–20

年間引用数

重複した引用

結合された引用

共著者を追加共著者

フォロー

引用先

共著者