Shinichi Nakano

Citado por

	Todos	Desde 2018
Citações	2302	431
Índice h	25	10
Índice i10	56	12

160

120

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220236 10 25 16 8 17 27 38 45 70 71 104 126 95 127 109 133 157 84 78 94 103 65 113 76 78 44 65 85 75 83

Coautores

Takao NishizekiTohoku University (Emeritus Professor)Email confirmado em ecei.tohoku.ac.jp
Takeaki UnoNational Institute of Informatics, JapanEmail confirmado em nii.jp
Md. Saidur RahmanProfessor, Dept. of Computer Science and Engineering, BUET, Dhaka-1000Email confirmado em cse.buet.ac.bd
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyEmail confirmado em jaist.ac.jp
Yoshio OkamotoUniversity of Electro-CommunicationsEmail confirmado em uec.ac.jp
Tetsuya ArakiGunma UniversityEmail confirmado em gunma-u.ac.jp
Yota OtachiNagoya UniversityEmail confirmado em nagoya-u.jp
Hiroki ArimuraGraduate School of Information Science and Technology, Hokkaido University, ProfessorEmail confirmado em ist.hokudai.ac.jp
Tatsuya AsaiFujitsu Laboratories Ltd.Email confirmado em nifty.com
Yasuko MatsuiTokai UniversityEmail confirmado em tokai-u.jp
Marek ChrobakUniversity of California at RiversideEmail confirmado em cs.ucr.edu
Takeshi TokuyamaKwansei Gakuin UniversityEmail confirmado em kwansei.ac.jp
Kunihiro WasaHosei UniversityEmail confirmado em hosei.ac.jp
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail confirmado em mit.edu
Kazuyuki AmanoGunma UniversityEmail confirmado em gunma-u.ac.jp
Shareef AhmedPhD student, University of North Carolina at Chapel HillEmail confirmado em cs.unc.edu
Kei UchizawaEmail confirmado em ecei.tohoku.ac.jp
Yasuaki KobayashiHokkaido UniversityEmail confirmado em ist.hokudai.ac.jp
Mohammad Tanvir ParvezAssociate Professor, Computer Engineering, Qassim UniversityEmail confirmado em qu.edu.sa
Osamu WatanabeTokyo Institute of TechnologyEmail confirmado em c.titech.ac.jp

Seguir

Shinichi Nakano

Professor of Computer Science, Gunma University

Email confirmado em gunma-u.ac.jp - Página inicial

Algorithms


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Discovering frequent substructures in large unordered trees T Asai, H Arimura, T Uno, SI Nakano Discovery Science: 6th International Conference, DS 2003, Sapporo, Japan …, 2003	227	2003
Minimum-width grid drawings of plane graphs M Chrobak, SI Nakano Computational Geometry 11 (1), 29-54, 1998	100	1998
Efficient generation of plane trees SI Nakano Information Processing Letters 84 (3), 167-172, 2002	90	2002
Efficient generation of rooted trees S Nakano, T Uno National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 4-63, 2003	89	2003
Constant time generation of trees with specified diameter S Nakano, T Uno International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004	82	2004
Efficient generation of plane triangulations without repetitions Z Li, S Nakano Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001	81	2001
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
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	64	1997
A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs MS Rahman, S Nakano, T Nishizeki Graph Algorithms And Applications I, 343-374, 2002	63	2002
Grid drawings of 4-connected plane graphs K Miura, SI Nakano, T Nishizeki Discrete & Computational Geometry 26, 73-87, 2001	61	2001
On the f-coloring of multigraphs SI Nakano, T Nishizeki, N Saito IEEE Transactions on Circuits and Systems 35 (3), 345-353, 1988	58	1988
Generating colored trees S Nakano, T Uno Graph-Theoretic Concepts in Computer Science: 31st International Workshop …, 2005	55	2005
Enumerating Floorplans with n Rooms S Nakano Algorithms and Computation: 12th International Symposium, ISAAC 2001 …, 2001	49	2001
Efficient generation of triconnected plane triangulations S Nakano Computational Geometry 27 (2), 109-122, 2004	45	2004
Box-rectangular drawings of plane graphs MS Rahman, S Nakano, T Nishizeki Journal of Algorithms 37 (2), 363-398, 2000	38	2000
A linear-time algorithm to find four independent spanning trees in four connected planar graphs K Miura, D Takahashi, SI Nakano, T Nishizeki International Journal of Foundations of Computer Science 10 (02), 195-210, 1999	36	1999
Scheduling file transfers under port and channel constraints S Nakano, T Nishizeki International Journal of Foundations of Computer Science 4 (02), 101-115, 1993	35	1993
Rectangular drawings of plane graphs without designated corners MS Rahman, S Nakano, T Nishizeki Computational Geometry 21 (3), 121-138, 2002	33	2002
Minimum-width grid drawings of plane graphs extend abstract M Chrobak, S Nakano Graph Drawing: DIMACS International Workshop, GD'94 Princeton, New Jersey …, 1995	32	1995

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