Follow
Shinichi Nakano
Shinichi Nakano
Professor of Computer Science, Gunma University
Verified email at 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
Discovery Science: 6th International Conference, DS 2003, Sapporo, Japan …, 2003
2292003
Minimum-width grid drawings of plane graphs
M Chrobak, SI Nakano
Computational Geometry 11 (1), 29-54, 1998
1021998
Efficient generation of plane trees
SI Nakano
Information Processing Letters 84 (3), 167-172, 2002
912002
Efficient generation of rooted trees
S Nakano, T Uno
National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 4-63, 2003
902003
Constant time generation of trees with specified diameter
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004
822004
Efficient generation of plane triangulations without repetitions
Z Li, S Nakano
Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001
812001
Edge-coloring partialk-trees
X Zhou, S Nakano, T Nishizeki
Journal of Algorithms 21 (3), 598-617, 1996
681996
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
652002
Rectangular grid drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 10 (3), 203-220, 1998
651998
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
641997
Grid drawings of 4-connected plane graphs
K Miura, SI Nakano, T Nishizeki
Discrete & Computational Geometry 26, 73-87, 2001
632001
On the f-coloring of multigraphs
SI Nakano, T Nishizeki, N Saito
IEEE Transactions on Circuits and Systems 35 (3), 345-353, 1988
591988
Generating colored trees
S Nakano, T Uno
Graph-Theoretic Concepts in Computer Science: 31st International Workshop …, 2005
552005
Enumerating Floorplans with n Rooms
S Nakano
Algorithms and Computation: 12th International Symposium, ISAAC 2001 …, 2001
492001
Efficient generation of triconnected plane triangulations
S Nakano
Computational Geometry 27 (2), 109-122, 2004
452004
Box-rectangular drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Journal of Algorithms 37 (2), 363-398, 2000
402000
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
361999
Scheduling file transfers under port and channel constraints
S Nakano, T Nishizeki
International Journal of Foundations of Computer Science 4 (02), 101-115, 1993
351993
Rectangular drawings of plane graphs without designated corners
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 21 (3), 121-138, 2002
332002
Minimum-width grid drawings of plane graphs extend abstract
M Chrobak, S Nakano
Graph Drawing: DIMACS International Workshop, GD'94 Princeton, New Jersey …, 1995
321995
The system can't perform the operation now. Try again later.
Articles 1–20