( en | de | ru )

 

Disambiguation of "Nakano, Shin-Ichi"

Author of the publication

copydeleteadd this publication to your clipboard
Box-Rectangular Drawings of Plane Graphs.

, , and . J. Algorithms, 37 (2): 363-398 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tomoyo Nakano

Victoria Ichizli

Takashi Ichinose

Toshiyuki Ichiba

Yasuhisa Ichihashi

 

Other publications of authors with the same name

Constant Time Generation of Set Partitions., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 88-A (4): 930-934 (2005)Efficient Enumeration of All Ladder Lotteries with k Bars., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 97-A (6): 1163-1170 (2014)Constant Time Generation of Rectangular Drawings with Exactly n Faces., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 89-A (9): 2445-2450 (2006)Special Section on Foundations of Computer Science.. IEICE Trans. Inf. Syst., 90-D (2): 387 (2007)Enumerating All Rooted Trees Including k Leaves., , , and . IEICE Trans. Inf. Syst., 95-D (3): 763-768 (2012)Constant Time Generation of Integer Partitions., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (5): 888-895 (2007)Constant Time Generation of Trees with Specified Diameter., and . WG, volume 3353 of Lecture Notes in Computer Science, page 33-45. Springer, (2004)Box-Rectangular Drawings of Plane Graphs., , and . J. Algorithms, 37 (2): 363-398 (2000)A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs., , and . Inf. Process. Lett., 62 (6): 315-322 (1997)Enumerating Highly-Edge-Connected Spanning Subgraphs., , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 102-A (9): 1002-1006 (2019)