Jin Akiyama

Jin Akiyama, Hiro Ito, Midori Kobayashi, Gisaku Nakamura: Arrangements of n Points whose Incident-Line-Numbers are at most n/2. Graphs and Combinatorics 27(3): 321-326 (2011)

Jin Akiyama, Jiang Bo, Mikio Kano, Xuehou Tan (Eds.): Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers. Lecture Notes in Computer Science 7033, Springer 2011, isbn 978-3-642-24982-2

Jin Akiyama, Takayasu Kuwata, Stefan Langerman, Kenji Okawa, Ikuro Sato, Geoffrey C. Shephard: Determination of All Tessellation Polyhedra with Regular Polygonal Faces. CGGA 2010: 1-11

Jin Akiyama, Hiroshi Fukuda, Chie Nara, Toshinori Sakai, Jorge Urrutia: Universal Measuring Boxes with Triangular Bases. The American Mathematical Monthly 115(3): 195-201 (2008)

Jin Akiyama: Tile-Makers and Semi-Tile-Makers. The American Mathematical Monthly 114(7): 602-609 (2007)

Jin Akiyama, Midori Kobayashi, Gisaku Nakamura: Dudeney Transformation of Normal Tiles. KyotoCGGT 2007: 1-13

Jin Akiyama, Chie Nara: Chromatic Numbers of Specified Isohedral Tilings. KyotoCGGT 2007: 14-24

Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu (Eds.): 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. Lecture Notes in Computer Science 4381, Springer 2007, isbn 978-3-540-70665-6

Jin Akiyama, Mikio Kano, Xuehou Tan: Editorial. Comput. Geom. 34(1): 1 (2006)

Jin Akiyama, Koichi Hirata, Midori Kobayashi, Gisaku Nakamura: Convex developments of a regular tetrahedron. Comput. Geom. 34(1): 2-10 (2006)

Jin Akiyama, Hiroshi Fukuda, Hiro Ito, Gisaku Nakamura: Infinite Series of Generalized Gosper Space Filling Curves. CJCDGCGT 2005: 1-9

Jin Akiyama, Edy Tri Baskoro, Mikio Kano (Eds.): Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3330, Springer 2005, isbn 3-540-24401-8

Jin Akiyama, Mikio Kano, Xuehou Tan (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, isbn 3-540-30467-3

Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia: A Problem on Hinged Dissections with Colours. Graphs and Combinatorics 20(2): 145-159 (2004)

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)

Jin Akiyama, Koichi Hirata: On Convex Developments of a Doubly-Covered Square. IJCCGGT 2003: 1-13

Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia: Flat 2-Foldings of Convex Polygons. IJCCGGT 2003: 14-24

Jin Akiyama, Midori Kobayashi, Gisaku Nakamura: Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph. IJCCGGT 2003: 25-33

Jin Akiyama, Mikio Kano (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Lecture Notes in Computer Science 2866, Springer 2003, isbn 3-540-20776-7

Midori Kobayashi, Jin Akiyama, Gisaku Nakamura: On Dudeney's Round Table Problem for p + 2. Ars Comb. 62 (2002)

Jin Akiyama, Gisaku Nakamura: Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon. Electronic Notes in Discrete Mathematics 11: 12-19 (2002)

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)

Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura: Universal Measuring Devices with Rectangular Base. JCDCG 2002: 1-8

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

Jin Akiyama, Gisaku Nakamura: Congruent Dudeney Dissections of Polygons: All the Hinge Points on Vertices of the Polygon. JCDCG 2002: 14-21

Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers. Lecture Notes in Computer Science 2098, Springer 2001, isbn 3-540-42306-0

Jin Akiyama, Gisaku Nakamura: Dudeney Dissections of Polygons and Polyhedrons - A Survey. JCDCG 2000: 1-30

Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura: Universal Measuring Devices without Gradations. JCDCG 2000: 31-40

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

Jin Akiyama, Toshinori Sakai, Jorge Urrutia: Sequentially Divisible Dissections of Simple Polygons. JCDCG 2000: 53-66

Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers. Lecture Notes in Computer Science 1763, Springer 2000, isbn 3-540-67181-1

Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia: Perfect divisions of a cake. CCCG 1998

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

Jin Akiyama, Gisaku Nakamura: Dudeney Dissection of Polygons. JCDCG 1998: 14-29

Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia: On circles containing the maximum number of points. Discrete Mathematics 151(1-3): 15-18 (1996)

Jin Akiyama, Kiyoshi Hosono, Masatsugu Urabe: Some combinatorial problems. Discrete Mathematics 116(1-3): 291-298 (1993)

Jin Akiyama: From the managing editor. Graphs and Combinatorics 9(1): 1 (1993)

Jin Akiyama, Jorge Urrutia: A note on balanced colourings for lattice points. Discrete Mathematics 83(1): 123-126 (1990)

Jin Akiyama, Jorge Urrutia: Simple alternating path problem. Discrete Mathematics 84(1): 101-103 (1990)

Jin Akiyama, Vasek Chvátal: Packing paths perfectly. Discrete Mathematics 85(3): 247-255 (1990)

Jin Akiyama, Fumi Nakada, Sinichi Tokunaga: Packing smaller graphs into a graph. Discrete Mathematics 75(1-3): 7-9 (1989)

Jin Akiyama, Hiroshi Era, Severino V. Gervacio, Mamoru Watanabe: Path chromatic numbers of graphs. Journal of Graph Theory 13(5): 571-573 (1989)

Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto: Preface. Discrete Mathematics 72(1-3): 1-2 (1988)

Jin Akiyama, Mamoru Watanabe: Maximum induced forests of planar graphs. Graphs and Combinatorics 3(1): 201-202 (1987)

Jin Akiyama, Kiyoshi Ando, David Avis: Eccentric graphs. Discrete Mathematics 56(1): 1-6 (1985)

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)

Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell: The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981)

Jin Akiyama, Geoffrey Exoo, Frank Harary: Covering and packing in graphs IV: Linear arboricity. Networks 11(1): 69-72 (1981)

Jin Akiyama: A status on the linear arboricity. Graph Theory and Algorithms 1980: 38-44