Folgen
Shinichi Nakano
Shinichi Nakano
Professor of Computer Science, Gunma University
Bestätigte E-Mail-Adresse bei gunma-u.ac.jp - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
2372003
Minimum-width grid drawings of plane graphs
M Chrobak, SI Nakano
Computational Geometry 11 (1), 29-54, 1998
1091998
Efficient generation of rooted trees
S Nakano, T Uno
National Institute for Informatics (Japan), Tech. Rep. NII-2003-005E 8, 4-63, 2003
932003
Efficient generation of plane trees
SI Nakano
Information Processing Letters 84 (3), 167-172, 2002
932002
Constant time generation of trees with specified diameter
S Nakano, T Uno
International Workshop on Graph-Theoretic Concepts in Computer Science, 33-45, 2004
872004
Efficient generation of plane triangulations without repetitions
Z Li, S Nakano
Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001
842001
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
712002
Edge-coloring partialk-trees
X Zhou, S Nakano, T Nishizeki
Journal of Algorithms 21 (3), 598-617, 1996
701996
Grid drawings of 4-connected plane graphs
K Miura, SI Nakano, T Nishizeki
Discrete & Computational Geometry 26, 73-87, 2001
682001
Rectangular grid drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Computational Geometry 10 (3), 203-220, 1998
671998
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
651997
Generating colored trees
S Nakano, T Uno
Graph-Theoretic Concepts in Computer Science: 31st International Workshop …, 2005
632005
On the f-coloring of multigraphs
SI Nakano, T Nishizeki, N Saito
IEEE Transactions on Circuits and Systems 35 (3), 345-353, 1988
561988
Enumerating Floorplans with n Rooms
S Nakano
International Symposium on Algorithms and Computation, 107-115, 2001
522001
Efficient generation of triconnected plane triangulations
S Nakano
Computational Geometry 27 (2), 109-122, 2004
502004
Box-rectangular drawings of plane graphs
MS Rahman, S Nakano, T Nishizeki
Journal of Algorithms 37 (2), 363-398, 2000
482000
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
391999
Rectangular Drawings of Plane Graphs without Designated Corners
MS Rahma, S Nakano, T Nishizeki
Proc. of Korea-Japan Joint Workshop on Algorithms and Computation, WAAC2000 …, 2000
362000
Exact algorithms for the max-min dispersion problem
T Akagi, T Araki, T Horiyama, S Nakano, Y Okamoto, Y Otachi, T Saitoh, ...
International Workshop on Frontiers in Algorithmics, 263-272, 2018
352018
Edge-coloring algorithms
S Nakano, X Zhou, T Nishizeki
Computer Science Today: Recent Trends and Developments, 172-183, 1995
331995
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20