Takao Nishizeki

Citované v

	Všetky	Od 2019
Citácie	8853	1843
h-index	39	17
i10-index	132	29

380

190

285

198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202442 30 42 78 78 118 89 112 123 130 163 158 158 177 180 206 184 178 192 250 289 265 295 253 297 305 243 278 280 322 351 310 299 317 312 307 272 297 380 275

Spoluautori

Md. Saidur RahmanProfessor, Dept. of Computer Science and Engineering, BUET, Dhaka-1000Overená e-mailová adresa na: cse.buet.ac.bd
Shinichi NakanoProfessor of Computer Science, Gunma UniversityOverená e-mailová adresa na: gunma-u.ac.jp
Norishige ChibaProfessor Emeritus at Iwate UniversityOverená e-mailová adresa na: iwate-u.ac.jp
Takaaki MizukiTohoku UniversityOverená e-mailová adresa na: cc.tohoku.ac.jp
Yasuhito AsanoKyoto UniversityOverená e-mailová adresa na: i.kyoto-u.ac.jp
Tetsuo AsanoProfessor of School of Information Science, JAISTOverená e-mailová adresa na: jaist.ac.jp
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Overená e-mailová adresa na: uni-rostock.de
K. ThulasiramanUniversity of OklahomaOverená e-mailová adresa na: ou.edu
Jens VygenProfessor of Discrete Mathematics, University of BonnOverená e-mailová adresa na: or.uni-bonn.de
Eva TardosProfessor of Computer Science, Cornell UniversityOverená e-mailová adresa na: cornell.edu
András FrankProfessor emeritus, Eötvös University BudapestOverená e-mailová adresa na: cs.elte.hu
Takeaki UnoNational Institute of Informatics, JapanOverená e-mailová adresa na: nii.jp
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyOverená e-mailová adresa na: mit.edu
David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceOverená e-mailová adresa na: cs.cornell.edu
Dorit S. HOCHBAUMUC BerkeleyOverená e-mailová adresa na: ieor.berkeley.edu
Takeshi TokuyamaKwansei Gakuin UniversityOverená e-mailová adresa na: kwansei.ac.jp
Marek ChrobakUniversity of California at RiversideOverená e-mailová adresa na: cs.ucr.edu
David S. JohnsonVisiting Professor, Columbia University Computer Science DepartmentOverená e-mailová adresa na: research.att.com
周暁tohoku universityOverená e-mailová adresa na: tohoku.ac.jp
Masashi ToyodaInstitute of Industrial Science, The University of TokyoOverená e-mailová adresa na: acm.org

Sledovať

Takao Nishizeki

Tohoku University (Emeritus Professor)

Overená e-mailová adresa na: ecei.tohoku.ac.jp - Domovská stránka

Algorithm Graph Algorithms Graph Drawing Discrete Mathematics Secret sharing


Názov Zoradiť podľa citácií Zoradiť podľa roka Zoradiť podľa názvu	Citované v Citované v	Rok
Secret sharing scheme realizing general access structure M Ito, A Saito, T Nishizeki Electronics and Communications in Japan (Part III: Fundamental Electronic …, 1989	1187	1989
Arboricity and subgraph listing algorithms N Chiba, T Nishizeki SIAM Journal on computing 14 (1), 210-223, 1985	862	1985
Planar graphs: Theory and algorithms T Nishizeki, N Chiba Elsevier, 1988	559	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	422	1982
Planar graph drawing T Nishizeki, MS Rahman World Scientific, 2004	370	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	353	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	293	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	147	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	145	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	130	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	98	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	85	1979
Handbook of graph theory, combinatorial optimization, and algorithms K Thulasiraman, S Arumugam, A Brandstädt (No Title), 2016	79	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	68	2003
Grid drawings of 4-connected plane graphs K Miura, SI Nakano, T Nishizeki Discrete & Computational Geometry 26, 73-87, 2001	68	2001

Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.

Články 1–20

Citácie za rok

Duplicitné citácie

Zlúčené citácie

Pridať spoluautorovSpoluautori

Sledovať

Citované v

Spoluautori