| 2007 |
| 36 | | Jin Akiyama,
William Y. C. Chen,
Mikio Kano,
Xueliang Li,
Qinglin Yu:
Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers
Springer 2007 |
| 2006 |
| 35 | EE | Jin Akiyama,
Mikio Kano,
Xuehou Tan:
Editorial.
Comput. Geom. 34(1): 1 (2006) |
| 34 | EE | Jin Akiyama,
Koichi Hirata,
Midori Kobayashi,
Gisaku Nakamura:
Convex developments of a regular tetrahedron.
Comput. Geom. 34(1): 2-10 (2006) |
| 2005 |
| 33 | | Jin Akiyama,
Edy Tri Baskoro,
Mikio Kano:
Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers
Springer 2005 |
| 32 | | Jin Akiyama,
Mikio Kano,
Xuehou Tan:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers
Springer 2005 |
| 31 | EE | Jin Akiyama,
Hiroshi Fukuda,
Hiro Ito,
Gisaku Nakamura:
Infinite Series of Generalized Gosper Space Filling Curves.
CJCDGCGT 2005: 1-9 |
| 2004 |
| 30 | EE | Jin Akiyama,
Ferran Hurtado,
Criel Merino,
Jorge Urrutia:
A Problem on Hinged Dissections with Colours.
Graphs and Combinatorics 20(2): 145-159 (2004) |
| 2003 |
| 29 | | Jin Akiyama,
Mikio Kano:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers
Springer 2003 |
| 28 | EE | Jin Akiyama,
Koichi Hirata:
On Convex Developments of a Doubly-Covered Square.
IJCCGGT 2003: 1-13 |
| 27 | EE | Jin Akiyama,
Koichi Hirata,
Mari-Jo P. Ruiz,
Jorge Urrutia:
Flat 2-Foldings of Convex Polygons.
IJCCGGT 2003: 14-24 |
| 26 | EE | Jin Akiyama,
Midori Kobayashi,
Gisaku Nakamura:
Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph.
IJCCGGT 2003: 25-33 |
| 25 | | Jin Akiyama,
Gisaku Nakamura,
Akihiro Nozaki,
Ken'ichi Ozawa,
Toshinori Sakai:
The optimality of a certain purely recursive dissection for a sequentially n-divisible square.
Comput. Geom. 24(1): 27-39 (2003) |
| 2002 |
| 24 | EE | Jin Akiyama,
Hiroshi Fukuda,
Gisaku Nakamura:
Universal Measuring Devices with Rectangular Base.
JCDCG 2002: 1-8 |
| 23 | EE | Jin Akiyama,
Gisaku Nakamura:
Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon.
JCDCG 2002: 14-21 |
| 22 | EE | Jin Akiyama,
Rika Mochizuki,
Nobuaki Mutoh,
Gisaku Nakamura:
Maximin Distance for n Points in a Unit Square or a Unit Circle.
JCDCG 2002: 9-13 |
| 21 | | Midori Kobayashi,
Jin Akiyama,
Gisaku Nakamura:
On Dudeney's Round Table Problem for p + 2.
Ars Comb. 62: (2002) |
| 20 | EE | Jin Akiyama,
Kiyoshi Ando,
Yoshimi Egawa:
Graphs G for which both G and G- are Contraction Critically k-Connected.
Graphs and Combinatorics 18(4): 693-708 (2002) |
| 2001 |
| 19 | | Jin Akiyama,
Mikio Kano,
Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers
Springer 2001 |
| 2000 |
| 18 | | Jin Akiyama,
Mikio Kano,
Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers
Springer 2000 |
| 17 | EE | Jin Akiyama,
Gisaku Nakamura:
Dudeney Dissections of Polygons and Polyhedrons - A Survey.
JCDCG 2000: 1-30 |
| 16 | EE | Jin Akiyama,
Hiroshi Fukuda,
Gisaku Nakamura,
Toshinori Sakai,
Jorge Urrutia,
Carlos Zamora-Cura:
Universal Measuring Devices without Gradations.
JCDCG 2000: 31-40 |
| 15 | EE | Jin Akiyama,
Gisaku Nakamura,
Akihiro Nozaki,
Ken'ichi Ozawa:
A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square.
JCDCG 2000: 41-52 |
| 14 | EE | Jin Akiyama,
Toshinori Sakai,
Jorge Urrutia:
Sequentially Divisible Dissections of Simple Polygons.
JCDCG 2000: 53-66 |
| 1998 |
| 13 | EE | Jin Akiyama,
Gisaku Nakamura,
Eduardo Rivera-Campo,
Jorge Urrutia:
Perfect divisions of a cake.
CCCG 1998 |
| 12 | | Jin Akiyama,
Atsushi Kaneko,
Mikio Kano,
Gisaku Nakamura,
Eduardo Rivera-Campo,
Shin-ichi Tokunaga,
Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane.
JCDCG 1998: 1-13 |
| 11 | | Jin Akiyama,
Gisaku Nakamura:
Dudeney Dissection of Polygons.
JCDCG 1998: 14-29 |
| 1996 |
| 10 | EE | Jin Akiyama,
Y. Ishigami,
Masatsugu Urabe,
Jorge Urrutia:
On circles containing the maximum number of points.
Discrete Mathematics 151(1-3): 15-18 (1996) |
| 1993 |
| 9 | EE | Jin Akiyama,
Kiyoshi Hosono,
Masatsugu Urabe:
Some combinatorial problems.
Discrete Mathematics 116(1-3): 291-298 (1993) |
| 1990 |
| 8 | EE | Jin Akiyama,
Jorge Urrutia:
A note on balanced colourings for lattice points.
Discrete Mathematics 83(1): 123-126 (1990) |
| 7 | EE | Jin Akiyama,
Jorge Urrutia:
Simple alternating path problem.
Discrete Mathematics 84(1): 101-103 (1990) |
| 6 | EE | Jin Akiyama,
Vasek Chvátal:
Packing paths perfectly.
Discrete Mathematics 85(3): 247-255 (1990) |
| 1989 |
| 5 | EE | Jin Akiyama,
Fumi Nakada,
Sinichi Tokunaga:
Packing smaller graphs into a graph.
Discrete Mathematics 75(1-3): 7-9 (1989) |
| 1988 |
| 4 | EE | Jin Akiyama,
Yoshimi Egawa,
Hikoe Enomoto:
Preface.
Discrete Mathematics 72(1-3): 1-2 (1988) |
| 1985 |
| 3 | EE | Jin Akiyama,
Kiyoshi Ando,
David Avis:
Eccentric graphs.
Discrete Mathematics 56(1): 1-6 (1985) |
| 1981 |
| 2 | EE | Jin Akiyama,
Hiroshi Era,
Geoffrey Exoo:
Further results on graph equations for line graphs and n-th power graphs.
Discrete Mathematics 34(3): 209-218 (1981) |
| 1980 |
| 1 | | Jin Akiyama:
A status on the linear arboricity.
Graph Theory and Algorithms 1980: 38-44 |