| 2009 |
|---|
| 61 | EE | Katsuhisa Yamanaka,
Yota Otachi,
Shin-Ichi Nakano:
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).
WALCOM 2009: 141-150 |
| 60 | EE | Mohammad Tanvir Parvez,
Md. Saidur Rahman,
Shin-Ichi Nakano:
Generating All Triangulations of Plane Graphs (Extended Abstract).
WALCOM 2009: 151-164 |
| 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 |
| 58 | EE | Katsuhisa Yamanaka,
Shin-Ichi Nakano:
A Compact Encoding of Plane Triangulations with Efficient Query Supports.
WALCOM 2008: 120-131 |
| 57 | EE | Katsuhisa Yamanaka,
Shin-Ichi Nakano:
Listing All Plane Graphs.
WALCOM 2008: 210-221 |
| 56 | EE | Katsuhisa Yamanaka,
Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
IEICE Transactions 91-A(9): 2284-2291 (2008) |
| 2007 |
|---|
| 55 | EE | Katsuhisa Yamanaka,
Shin-Ichi Nakano:
A Compact Encoding of Rectangular Drawings with Efficient Query Supports.
AAIM 2007: 68-81 |
| 54 | EE | Shin-Ichi Nakano,
Ryuhei Uehara,
Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs.
TAMC 2007: 115-127 |
| 53 | EE | Shin-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 |
| 51 | EE | Katsuhisa Yamanaka,
Shin-ichiro Kawano,
Yosuke Kikuchi,
Shin-Ichi Nakano:
Constant Time Generation of Integer Partitions.
IEICE Transactions 90-A(5): 888-895 (2007) |
| 50 | EE | Shin-Ichi Nakano:
Special Section on Foundations of Computer Science.
IEICE Transactions 90-D(2): 387 (2007) |
| 2006 |
|---|
| 49 | EE | Katsuhisa Yamanaka,
Shin-Ichi Nakano:
Coding Floorplans with Fewer Bits.
IEICE Transactions 89-A(5): 1181-1185 (2006) |
| 48 | EE | Satoshi 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) |
| 47 | EE | Kazuyuki 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 |
|---|
| 46 | EE | Akimitsu Ono,
Shin-Ichi Nakano:
Constant Time Generation of Linear Extensions.
FCT 2005: 445-453 |
| 45 | EE | Shin-Ichi Nakano,
Takeaki Uno:
Generating Colored Trees.
WG 2005: 249-260 |
| 44 | EE | Shin-ichiro Kawano,
Shin-Ichi Nakano:
Constant Time Generation of Set Partitions.
IEICE Transactions 88-A(4): 930-934 (2005) |
| 43 | EE | Shin-ichiro Kawano,
Shin-Ichi Nakano:
Generating All Series-Parallel Graphs.
IEICE Transactions 88-A(5): 1129-1135 (2005) |
| 2004 |
|---|
| 42 | EE | Shin-Ichi Nakano,
Takeaki Uno:
Constant Time Generation of Trees with Specified Diameter.
WG 2004: 33-45 |
| 41 | EE | Shin-Ichi Nakano:
Efficient generation of triconnected plane triangulations.
Comput. Geom. 27(2): 109-122 (2004) |
| 40 | EE | Masahiro Takagi,
Shin-Ichi Nakano:
Listing all rectangular drawings with certain properties.
Systems and Computers in Japan 35(4): 1-8 (2004) |
| 2003 |
|---|
| 39 | EE | Yosuke Kikuchi,
Hiroyuki Tanaka,
Shin-Ichi Nakano,
Yukio Shibata:
How to Obtain the Complete List of Caterpillars (Extended Abstract).
COCOON 2003: 329-338 |
| 38 | EE | Tatsuya Asai,
Hiroki Arimura,
Takeaki Uno,
Shin-Ichi Nakano:
Discovering Frequent Substructures in Large Unordered Trees.
Discovery Science 2003: 47-61 |
| 37 | EE | Shin-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) |
| 35 | EE | Shin-Ichi Nakano:
Efficient generation of plane trees.
Inf. Process. Lett. 84(3): 167-172 (2002) |
| 34 | EE | Atsushi 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 |
|---|
| 33 | EE | Zhangjian Li,
Shin-Ichi Nakano:
Listing all connected plane triangulation.
CCCG 2001: 121-124 |
| 32 | EE | Shin-Ichi Nakano:
Efficient Generation of Triconnected Plane Triangulations.
COCOON 2001: 131-141 |
| 31 | EE | Zhangjian Li,
Shin-Ichi Nakano:
Efficient Generation of Plane Triangulations without Repetitions.
ICALP 2001: 433-443 |
| 30 | EE | Shin-Ichi Nakano:
Enumerating Floorplans with n Rooms.
ISAAC 2001: 107-115 |
| 29 | EE | Kazuyuki Miura,
Shin-Ichi Nakano,
Takao Nishizeki:
Grid Drawings of 4-Connected Plane Graphs.
Discrete & Computational Geometry 26(1): 73-87 (2001) |
| 2000 |
|---|
| 28 | EE | Md. Saidur Rahman,
Shin-Ichi Nakano,
Takao Nishizeki:
Rectangular Drawings of Plane Graphs Without Designated Corners.
COCOON 2000: 85-94 |
| 27 | EE | Shin-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 |
| 26 | EE | Shin-Ichi Nakano,
Takao Nishizeki,
Takeshi Tokuyama,
Shuhei Watanabe:
Labeling Points with Rectangles of Various Shapes.
Graph Drawing 2000: 91-102 |
| 25 | EE | Kazuyuki Miura,
Takao Nishizeki,
Shin-Ichi Nakano:
Convex Grid Drwaings of Four-Connected Plane Graphs.
ISAAC 2000: 254-265 |
| 24 | EE | Sayaka 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 |
| 21 | EE | Kazuyuki Miura,
Shin-Ichi Nakano,
Takao Nishizeki:
Grid Drawings of Four-Connected Plane Graphs.
Graph Drawing 1999: 145-154 |
| 20 | EE | Md. 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) |
| 18 | EE | Md. 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 |
|---|
| 17 | | Kazuyuki 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 |
| 13 | EE | Shin-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 |
|---|
| 9 | | Shin-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 |
| 7 | | Xiao Zhou,
Shin-Ichi Nakano,
Takao Nishizeki:
A Parallel Algorithm for Edge-Coloring Partial k-Trees.
SWAT 1994: 359-369 |
| 1993 |
|---|
| 6 | | Xiao 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) |
