Shinichi Nakano
Shinichi Nakano
Professor of Computer Science, Gunma University
Verified email at cs.gunma-u.ac.jp - Homepage
Title
Cited by
Cited by
Year
Discovering frequent substructures in large unordered trees
T Asai, H Arimura, T Uno, SI Nakano
International Conference on Discovery Science, 47-61, 2003
2252003
Minimum-width grid drawings of plane graphs
M Chrobak, SI Nakano
Computational Geometry 11 (1), 29-54, 1998
921998
Efficient generation of rooted trees
S Nakano, T Uno
National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 2003
852003
Efficient generation of plane trees
S Nakano
Information Processing Letters 84 (3), 167-172, 2002
852002
Efficient generation of plane triangulations without repetitions
Z Li, S Nakano
International Colloquium on Automata, Languages, and Programming, 433-443, 2001
802001
Constant time generation of trees with specified diameter
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004
792004
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
621997
Rectangular grid drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 10 (3), 203-220, 1998
581998
Edge-Coloring Partialk-Trees
X Zhou, S Nakano, T Nishizeki
Journal of Algorithms 21 (3), 598-617, 1996
571996
On the f-coloring of multigraphs
SI Nakano, T Nishizeki, N Saito
IEEE Transactions on Circuits and Systems 35 (3), 345-353, 1988
561988
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
552002
Grid drawings of 4-connected plane graphs
K Miura, SI Nakano, T Nishizeki
Discrete & Computational Geometry 26 (1), 73-87, 2001
542001
Generating colored trees
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 249-260, 2005
532005
Enumerating Floorplans with n Rooms
S Nakano
International Symposium on Algorithms and Computation, 107-115, 2001
442001
Efficient generation of triconnected plane triangulations
S Nakano
Computational Geometry 27 (2), 109-122, 2004
422004
Box-rectangular drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Journal of Algorithms 37 (2), 363-398, 2000
352000
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
341999
Rectangular drawings of plane graphs without designated corners
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 21 (3), 121-138, 2002
302002
Edge-coloring algorithms
S Nakano, X Zhou, T Nishizeki
Computer Science Today, 172-183, 1995
301995
Minimum-width grid drawings of plane graphs extend abstract
M Chrobak, S Nakano
International Symposium on Graph Drawing, 104-110, 1994
301994
The system can't perform the operation now. Try again later.
Articles 1–20