Shinichi Nakano
Shinichi Nakano
Professor of Computer Science, Gunma University
Email verificata su cs.gunma-u.ac.jp - Home page
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
2222003
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
832003
Efficient generation of plane trees
S Nakano
Information Processing Letters 84 (3), 167-172, 2002
822002
Efficient generation of plane triangulations without repetitions
Z Li, S Nakano
International Colloquium on Automata, Languages, and Programming, 433-443, 2001
782001
Constant time generation of trees with specified diameter
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004
752004
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
611997
Edge-Coloring Partialk-Trees
X Zhou, S Nakano, T Nishizeki
Journal of Algorithms 21 (3), 598-617, 1996
581996
Rectangular grid drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 10 (3), 203-220, 1998
571998
On the f-coloring of multigraphs
SI Nakano, T Nishizeki, N Saito
IEEE Transactions on Circuits and Systems 35 (3), 345-353, 1988
551988
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
522002
Grid drawings of 4-connected plane graphs
K Miura, SI Nakano, T Nishizeki
Discrete & Computational Geometry 26 (1), 73-87, 2001
522001
Generating colored trees
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 249-260, 2005
512005
Efficient generation of triconnected plane triangulations
S Nakano
Computational Geometry 27 (2), 109-122, 2004
412004
Enumerating Floorplans with n Rooms
S Nakano
International Symposium on Algorithms and Computation, 107-115, 2001
402001
Box-rectangular drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Journal of Algorithms 37 (2), 363-398, 2000
342000
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
Minimum-width grid drawings of plane graphs extend abstract
M Chrobak, S Nakano
International Symposium on Graph Drawing, 104-110, 1994
311994
Scheduling file transfers under port and channel constraints
SI Nakano, T Nishizeki
International Journal of Foundations of Computer Science 4 (02), 101-115, 1993
301993
Constant time generation of set partitions
SI Kawano, SI Nakano
IEICE Transactions on Fundamentals of Electronics, Communications and…, 2005
292005
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20