Shinichi Nakano
Shinichi Nakano
Professor of Computer Science, Gunma University
Dirección de correo verificada de cs.gunma-u.ac.jp - Página principal
Título
Citado por
Citado por
Año
Discovering frequent substructures in large unordered trees
T Asai, H Arimura, T Uno, SI Nakano
International Conference on Discovery Science, 47-61, 2003
2092003
Minimum-width grid drawings of plane graphs
M Chrobak, SI Nakano
Computational Geometry 11 (1), 29-54, 1998
911998
Efficient generation of plane triangulations without repetitions
Z Li, SI Nakano
International Colloquium on Automata, Languages, and Programming, 433-443, 2001
792001
Efficient generation of rooted trees
S Nakano, T Uno
National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 2003
782003
Efficient generation of plane trees
SI Nakano
Information Processing Letters 84 (3), 167-172, 2002
782002
Constant time generation of trees with specified diameter
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004
742004
A linear-time algorithm for four-partitioning four-connected planar graphs
SI Nakano, MS Rahman, T Nishizeki
Information Processing Letters 62 (6), 315-322, 1997
591997
Edge-Coloring Partialk-Trees
X Zhou, S Nakano, T Nishizeki
Journal of Algorithms 21 (3), 598-617, 1996
591996
Rectangular grid drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 10 (3), 203-220, 1998
581998
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
512002
Generating colored trees
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 249-260, 2005
502005
Grid drawings of 4-connected plane graphs
K Miura, SI Nakano, T Nishizeki
Discrete & Computational Geometry 26 (1), 73-87, 2001
492001
Efficient generation of triconnected plane triangulations
SI Nakano
Computational Geometry 27 (2), 109-122, 2004
432004
Enumerating Floorplans with n Rooms
S Nakano
International Symposium on Algorithms and Computation, 107-115, 2001
382001
Box-rectangular drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Journal of Algorithms 37 (2), 363-398, 2000
332000
Scheduling file transfers under port and channel constraints
SI Nakano, T Nishizeki
International Journal of Foundations of Computer Science 4 (02), 101-115, 1993
321993
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
311999
Minimum-width grid drawings of plane graphs extend abstract
M Chrobak, SI Nakano
International Symposium on Graph Drawing, 104-110, 1994
301994
Constant time generation of set partitions
SI Kawano, SI Nakano
IEICE Transactions on Fundamentals of Electronics, Communications and …, 2005
292005
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20