Shinichi Nakano

Citata da

	Tutte	Dal 2016
Citazioni	2011	379
Indice H	23	10
i10-index	50	13

160

120

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020215 8 20 14 8 16 25 43 49 63 73 99 118 94 120 112 135 148 87 87 83 103 63 104 74 66 53 70 10

Coautori

Takao NishizekiTohoku University (Emeritus Professor)Email verificata su ecei.tohoku.ac.jp
Takeaki UnoNational Institute of Informatics, JapanEmail verificata su nii.jp
Md. Saidur RahmanProfessor, Dept. of Computer Science and Engineering, BUET, Dhaka-1000Email verificata su cse.buet.ac.bd
Ryuhei UeharaJapan Advanced Institute of Science and TechnologyEmail verificata su jaist.ac.jp
Yoshio OkamotoUniversity of Electro-CommunicationsEmail verificata su uec.ac.jp
Yota OtachiNagoya UniversityEmail verificata su nagoya-u.jp
Hiroki ArimuraGraduate School of Information Science and Technology, Hokkaido University, ProfessorEmail verificata su ist.hokudai.ac.jp
Tatsuya AsaiFujitsu Laboratories Ltd.Email verificata su nifty.com
Marek ChrobakUniversity of California at RiversideEmail verificata su cs.ucr.edu
Yasuko MatsuiTokai UniversityEmail verificata su tokai-u.jp
Takeshi TokuyamaKwansei Gakuin UniversityEmail verificata su kwansei.ac.jp
Tetsuya ArakiGunma UniversityEmail verificata su gunma-u.ac.jp
Kazuyuki AmanoGunma UniversityEmail verificata su gunma-u.ac.jp
Tetsuo AsanoProfessor of School of Information Science, JAISTEmail verificata su jaist.ac.jp
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail verificata su mit.edu
Kunihiro WasaToyohashi University of TechnologyEmail verificata su cs.tut.ac.jp
Mohammad Tanvir ParvezAssociate Professor, Computer Engineering, Qassim UniversityEmail verificata su qu.edu.sa
Osamu WatanabeTokyo Institute of TechnologyEmail verificata su c.titech.ac.jp
Krishnendu MukhopadhyayaProfessor of Computer Science, Indian Statistical InstituteEmail verificata su isical.ac.in
Koichi YamazakiGunma UniversityEmail verificata su cs.gunma-u.ac.jp

Shinichi Nakano

Professor of Computer Science, Gunma University

Email verificata su cs.gunma-u.ac.jp - Home page

Algorithms


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Discovering frequent substructures in large unordered trees T Asai, H Arimura, T Uno, SI Nakano International Conference on Discovery Science, 47-61, 2003	222	2003
Minimum-width grid drawings of plane graphs M Chrobak, SI Nakano Computational Geometry 11 (1), 29-54, 1998	92	1998
Efficient generation of rooted trees S Nakano, T Uno National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 2003	83	2003
Efficient generation of plane trees S Nakano Information Processing Letters 84 (3), 167-172, 2002	82	2002
Efficient generation of plane triangulations without repetitions Z Li, S Nakano International Colloquium on Automata, Languages, and Programming, 433-443, 2001	78	2001
Constant time generation of trees with specified diameter S Nakano, T Uno International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004	75	2004
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
Edge-Coloring Partialk-Trees X Zhou, S Nakano, T Nishizeki Journal of Algorithms 21 (3), 598-617, 1996	58	1996
Rectangular grid drawings of plane graphs MS Rahman, S Nakano, T Nishizeki Computational Geometry 10 (3), 203-220, 1998	57	1998
On the f-coloring of multigraphs SI Nakano, T Nishizeki, N Saito IEEE Transactions on Circuits and Systems 35 (3), 345-353, 1988	55	1988
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	52	2002
Grid drawings of 4-connected plane graphs K Miura, SI Nakano, T Nishizeki Discrete & Computational Geometry 26 (1), 73-87, 2001	52	2001
Generating colored trees S Nakano, T Uno International Workshop on Graph-Theoretic Concepts in Computer Science, 249-260, 2005	51	2005
Efficient generation of triconnected plane triangulations S Nakano Computational Geometry 27 (2), 109-122, 2004	41	2004
Enumerating Floorplans with n Rooms S Nakano International Symposium on Algorithms and Computation, 107-115, 2001	40	2001
Box-rectangular drawings of plane graphs MS Rahman, S Nakano, T Nishizeki Journal of Algorithms 37 (2), 363-398, 2000	34	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	34	1999
Minimum-width grid drawings of plane graphs extend abstract M Chrobak, S Nakano International Symposium on Graph Drawing, 104-110, 1994	31	1994
Scheduling file transfers under port and channel constraints SI Nakano, T Nishizeki International Journal of Foundations of Computer Science 4 (02), 101-115, 1993	30	1993
Constant time generation of set partitions SI Kawano, SI Nakano IEICE Transactions on Fundamentals of Electronics, Communications and …, 2005	29	2005

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