dblp.uni-trier.dewww.uni-trier.de

Shin-Ichi Nakano Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
62EEKatsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano: Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). WALCOM 2009: 141-150
61EEMohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano: Generating All Triangulations of Plane Graphs (Extended Abstract). WALCOM 2009: 151-164
60EEShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. J. Comput. Sci. Technol. 24(3): 517-533 (2009)
2008
59 Shin-Ichi Nakano, Md. Saidur Rahman: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008. Springer 2008
58EEKatsuhisa Yamanaka, Shin-Ichi Nakano: A Compact Encoding of Plane Triangulations with Efficient Query Supports. WALCOM 2008: 120-131
57EEKatsuhisa Yamanaka, Shin-Ichi Nakano: Listing All Plane Graphs. WALCOM 2008: 210-221
56EEKatsuhisa Yamanaka, Shin-Ichi Nakano: A Compact Encoding of Rectangular Drawings with Efficient Query Supports. IEICE Transactions 91-A(9): 2284-2291 (2008)
2007
55EEKatsuhisa Yamanaka, Shin-Ichi Nakano: A Compact Encoding of Rectangular Drawings with Efficient Query Supports. AAIM 2007: 68-81
54EEShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. TAMC 2007: 115-127
53EEShin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno: Efficient Algorithms for Airline Problem. TAMC 2007: 428-439
52 Akimitsu Ono, Shin-Ichi Nakano: Constant Time Generation of Linear Extensions. WALCOM 2007: 151-161
51EEKatsuhisa Yamanaka, Shin-ichiro Kawano, Yosuke Kikuchi, Shin-Ichi Nakano: Constant Time Generation of Integer Partitions. IEICE Transactions 90-A(5): 888-895 (2007)
50EEShin-Ichi Nakano: Special Section on Foundations of Computer Science. IEICE Transactions 90-D(2): 387 (2007)
2006
49EEKatsuhisa Yamanaka, Shin-Ichi Nakano: Coding Floorplans with Fewer Bits. IEICE Transactions 89-A(5): 1181-1185 (2006)
48EESatoshi Yoshii, Daisuke Chigira, Katsuhisa Yamanaka, Shin-Ichi Nakano: Constant Time Generation of Rectangular Drawings with Exactly n Faces. IEICE Transactions 89-A(9): 2445-2450 (2006)
47EEKazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Convex Grid Drawings of Four-connected Plane Graphs. Int. J. Found. Comput. Sci. 17(5): 1031-1060 (2006)
2005
46EEAkimitsu Ono, Shin-Ichi Nakano: Constant Time Generation of Linear Extensions. FCT 2005: 445-453
45EEShin-Ichi Nakano, Takeaki Uno: Generating Colored Trees. WG 2005: 249-260
44EEShin-ichiro Kawano, Shin-Ichi Nakano: Constant Time Generation of Set Partitions. IEICE Transactions 88-A(4): 930-934 (2005)
43EEShin-ichiro Kawano, Shin-Ichi Nakano: Generating All Series-Parallel Graphs. IEICE Transactions 88-A(5): 1129-1135 (2005)
2004
42EEShin-Ichi Nakano, Takeaki Uno: Constant Time Generation of Trees with Specified Diameter. WG 2004: 33-45
41EEShin-Ichi Nakano: Efficient generation of triconnected plane triangulations. Comput. Geom. 27(2): 109-122 (2004)
40EEMasahiro Takagi, Shin-Ichi Nakano: Listing all rectangular drawings with certain properties. Systems and Computers in Japan 35(4): 1-8 (2004)
2003
39EEYosuke Kikuchi, Hiroyuki Tanaka, Shin-Ichi Nakano, Yukio Shibata: How to Obtain the Complete List of Caterpillars (Extended Abstract). COCOON 2003: 329-338
38EETatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-Ichi Nakano: Discovering Frequent Substructures in Large Unordered Trees. Discovery Science 2003: 47-61
37EEShin-Ichi Nakano, Takeaki Uno: More Efficient Generation of Plane Triangulations. Graph Drawing 2003: 273-282
2002
36 Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular drawings of plane graphs without designated corners. Comput. Geom. 21(3): 121-138 (2002)
35EEShin-Ichi Nakano: Efficient generation of plane trees. Inf. Process. Lett. 84(3): 167-172 (2002)
34EEAtsushi Koike, Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe: Labeling Points with Rectangles of Various Shapes. Int. J. Comput. Geometry Appl. 12(6): 511-528 (2002)
2001
33EEZhangjian Li, Shin-Ichi Nakano: Listing all connected plane triangulation. CCCG 2001: 121-124
32EEShin-Ichi Nakano: Efficient Generation of Triconnected Plane Triangulations. COCOON 2001: 131-141
31EEZhangjian Li, Shin-Ichi Nakano: Efficient Generation of Plane Triangulations without Repetitions. ICALP 2001: 433-443
30EEShin-Ichi Nakano: Enumerating Floorplans with n Rooms. ISAAC 2001: 107-115
29EEKazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Grid Drawings of 4-Connected Plane Graphs. Discrete & Computational Geometry 26(1): 73-87 (2001)
2000
28EEMd. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Drawings of Plane Graphs Without Designated Corners. COCOON 2000: 85-94
27EEShin-Ichi Nakano, Makiko Yoshikawa: A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs (Extended Abstract). Graph Drawing 2000: 296-307
26EEShin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyama, Shuhei Watanabe: Labeling Points with Rectangles of Various Shapes. Graph Drawing 2000: 91-102
25EEKazuyuki Miura, Takao Nishizeki, Shin-Ichi Nakano: Convex Grid Drwaings of Four-Connected Plane Graphs. ISAAC 2000: 254-265
24EESayaka Nagai, Shin-Ichi Nakano: A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs. WG 2000: 290-301
23 Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Box-Rectangular Drawings of Plane Graphs. J. Algorithms 37(2): 363-398 (2000)
1999
22 Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, Takeshi Tokuyama: Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July 26-28, 1999, Proceedings Springer 1999
21EEKazuyuki Miura, Shin-Ichi Nakano, Takao Nishizeki: Grid Drawings of Four-Connected Plane Graphs. Graph Drawing 1999: 145-154
20EEMd. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Box-Rectangular Drawings of Plane Graphs. WG 1999: 250-261
19 Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki: A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs. Int. J. Found. Comput. Sci. 10(2): 195-210 (1999)
18EEMd. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. J. Graph Algorithms Appl. 3(4): 31-62 (1999)
1998
17EEKazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki: A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. WG 1998: 310-323
16 Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular grid drawings of plane graphs. Comput. Geom. 10(3): 203-220 (1998)
15 Marek Chrobak, Shin-Ichi Nakano: Minimum-width grid drawings of plane graphs. Comput. Geom. 11(1): 29-54 (1998)
1997
14 Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs. Graph Drawing 1997: 99-110
13EEShin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki: A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Inf. Process. Lett. 62(6): 315-322 (1997)
1996
12 Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular Grid Drawings of Plane Graphs. COCOON 1996: 92-105
11 Shin-Ichi Nakano, Md. Saidur Rahman, Takao Nishizeki: A Linear-Time Algorithm for Four-Partitioning Four-Connected Planar Graphs. Graph Drawing 1996: 334-344
10 Xiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: Edge-Coloring Partial k-Trees. J. Algorithms 21(3): 598-617 (1996)
1995
9EEShin-Ichi Nakano, Xiao Zhou, Takao Nishizeki: Edge-Coloring Algorithms. Computer Science Today 1995: 172-183
1994
8 Marek Chrobak, Shin-Ichi Nakano: Minimum-Width Grid Drawings of Plane Graphs. Graph Drawing 1994: 104-110
7EEXiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Parallel Algorithm for Edge-Coloring Partial k-Trees. SWAT 1994: 359-369
1993
6EEXiao Zhou, Shin-Ichi Nakano, Takao Nishizeki: A Linear Algorithm for Edge-Coloring Partial k-Trees. ESA 1993: 409-418
5 Shin-Ichi Nakano, Takao Nishizeki: Nearly uniform scheduling of file transfers. IPCO 1993: 425-431
4 Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers Under Port and Channe; Constraints. Int. J. Found. Comput. Sci. 4(2): 101-115 (1993)
1992
3 Xiao Zhou, Shin-Ichi Nakano, Hitoshi Suzuki, Takao Nishizeki: An Efficient Algorithm for Edge-Coloring Series-Parallel Multigraphs. LATIN 1992: 516-529
1991
2 Shin-Ichi Nakano, Takao Nishizeki: Scheduling File Transfers under Port and Channel Constraints. ISA 1991: 43-51
1990
1 Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito: On the fg-coloring of graphs. Combinatorica 10(1): 67-80 (1990)

Coauthor Index

1Hiroki Arimura [38]
2Tatsuya Asai [38]
3Takao Asano [22]
4Daisuke Chigira [48]
5Marek Chrobak [8] [15]
6Hiroshi Imai [22]
7Shin-ichiro Kawano [43] [44] [51]
8Yosuke Kikuchi [39] [51]
9Atsushi Koike [34]
10D. T. Lee (Der-Tsai Lee) [22]
11Zhangjian Li [31] [33]
12Kazuyuki Miura [17] [19] [21] [25] [29] [47]
13Sayaka Nagai [24]
14Takao Nishizeki [1] [2] [3] [4] [5] [6] [7] [9] [10] [11] [12] [13] [14] [16] [17] [18] [19] [20] [21] [23] [25] [26] [28] [29] [34] [36] [47]
15Akimitsu Ono [46] [52]
16Yota Otachi [62]
17Mohammad Tanvir Parvez [61]
18Md. Saidur Rahman [11] [12] [13] [14] [16] [18] [20] [23] [28] [36] [59] [61]
19Nobuji Saito [1]
20Yukio Shibata [39]
21Hitoshi Suzuki [3]
22Masahiro Takagi [40]
23Daishiro Takahashi [17] [19]
24Hiroyuki Tanaka [39]
25Takeshi Tokuyama [22] [26] [34]
26Ryuhei Uehara [53] [54] [60]
27Takeaki Uno [37] [38] [42] [45] [53] [54] [60]
28Shuhei Watanabe [26] [34]
29Katsuhisa Yamanaka [48] [49] [51] [55] [56] [57] [58] [62]
30Satoshi Yoshii [48]
31Makiko Yoshikawa [27]
32Xiao Zhou [3] [6] [7] [9] [10]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)