The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests. - Jin Akiyama; Takashi Hamada (Discret. Math., 1979)

A status on the linear arboricity. - Jin Akiyama (Graph Theory and Algorithms, 1980)

Balancing signed graphs. - Jin Akiyama; David Avis; Vasek Chvátal; Hiroshi Era (Discret. Appl. Math., 1981)

Further results on graph equations for line graphs and n-th power graphs. - Jin Akiyama; Hiroshi Era; Geoffrey Exoo (Discret. Math., 1981)

A graph and its complement with specified properties. IV. Counting self-complementary blocks. - Jin Akiyama; Frank Harary (J. Graph Theory, 1981)

The cohesiveness of a point of a graph. - Jin Akiyama; Frank Boesch; Hiroshi Era; Frank Harary; Ralph Tindell (Networks, 1981)

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

Eccentric graphs. - Jin Akiyama; Kiyoshi Ando; David Avis (Discret. Math., 1985)

On the size of graphs with complete-factors. - Jin Akiyama; Peter Frankl (J. Graph Theory, 1985)

Factors and factorizations of graphs - a survey. - Jin Akiyama; Mikio Kano (J. Graph Theory, 1985)

Almost-regular factorization of graphs. - Jin Akiyama; Mikio Kano (J. Graph Theory, 1985)

Maximum induced forests of planar graphs. - Jin Akiyama; Mamoru Watanabe (Graphs Comb., 1987)

Preface. - Jin Akiyama; Yoshimi Egawa; Hikoe Enomoto (Discret. Math., 1988)

Packing smaller graphs into a graph. - Jin Akiyama; Fumi Nakada; Sinichi Tokunaga (Discret. Math., 1989)

Path chromatic numbers of graphs. - Jin Akiyama; Hiroshi Era; Severino Villanueva Gervacio; Mamoru Watanabe (J. Graph Theory, 1989)

Packing paths perfectly. - Jin Akiyama; Vasek Chvátal (Discret. Math., 1990)

A note on balanced colourings for lattice points. - Jin Akiyama; Jorge Urrutia (Discret. Math., 1990)

Simple alternating path problem. - Jin Akiyama; Jorge Urrutia (Discret. Math., 1990)

Some combinatorial problems. - Jin Akiyama; Kiyoshi Hosono; Masatsugu Urabe (Discret. Math., 1993)

From the managing editor. - Jin Akiyama (Graphs Comb., 1993)

On circles containing the maximum number of points. - Jin Akiyama; Y. Ishigami; Masatsugu Urabe; Jorge Urrutia (Discret. Math., 1996)

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

Radial Perfect Partitions of Convex Sets in the Plane. - Jin Akiyama; Atsushi Kaneko; Mikio Kano; Gisaku Nakamura; Eduardo Rivera-Campo; Shin-ichi Tokunaga; Jorge Urrutia (JCDCG, 1998)

Dudeney Dissection of Polygons. - Jin Akiyama; Gisaku Nakamura (JCDCG, 1998)

Universal Measuring Devices without Gradations. - Jin Akiyama; Hiroshi Fukuda; Gisaku Nakamura; Toshinori Sakai; Jorge Urrutia; Carlos Zamora-Cura (JCDCG, 2000)

Dudeney Dissections of Polygons and Polyhedrons - A Survey. - Jin Akiyama; Gisaku Nakamura (JCDCG, 2000)

A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square. - Jin Akiyama; Gisaku Nakamura; Akihiro Nozaki; Ken'ichi Ozawa (JCDCG, 2000)

Sequentially Divisible Dissections of Simple Polygons. - Jin Akiyama; Toshinori Sakai; Jorge Urrutia (JCDCG, 2000)

Universal Measuring Devices with Rectangular Base. - Jin Akiyama; Hiroshi Fukuda; Gisaku Nakamura (JCDCG, 2002)

Maximin Distance for n Points in a Unit Square or a Unit Circle. - Jin Akiyama; Rika Mochizuki; Nobuaki Mutoh; Gisaku Nakamura (JCDCG, 2002)

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

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

Congruent Dudeney Dissections of Polygons I: All the Hinge Points are Vertices of the Polygon. - Jin Akiyama; Gisaku Nakamura (Electron. Notes Discret. Math., 2002)

Graphs G for which both G and G- are Contraction Critically k-Connected. - Jin Akiyama; Kiyoshi Ando; Yoshimi Egawa (Graphs Comb., 2002)

On Convex Developments of a Doubly-Covered Square. - Jin Akiyama; Koichi Hirata (IJCCGGT, 2003)

Flat 2-Foldings of Convex Polygons. - Jin Akiyama; Koichi Hirata; Mari-Jo P. Ruiz; Jorge Urrutia (IJCCGGT, 2003)

Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph. - Jin Akiyama; Midori Kobayashi; Gisaku Nakamura (IJCCGGT, 2003)

The optimality of a certain purely recursive dissection for a sequentially n-divisible square. - Jin Akiyama; Gisaku Nakamura; Akihiro Nozaki; Ken'ichi Ozawa; Toshinori Sakai (Comput. Geom., 2003)

Determination of All Convex Polygons which are Chameleons-Congruent Dudeney Dissections of Polygons-. - Jin Akiyama; Gisaku Nakamura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

A Problem on Hinged Dissections with Colours. - Jin Akiyama; Ferran Hurtado; Criel Merino; Jorge Urrutia (Graphs Comb., 2004)

Infinite Series of Generalized Gosper Space Filling Curves. - Jin Akiyama; Hiroshi Fukuda; Hiro Ito; Gisaku Nakamura (CJCDGCGT, 2005)

Convex developments of a regular tetrahedron. - Jin Akiyama; Koichi Hirata; Midori Kobayashi; Gisaku Nakamura (Comput. Geom., 2006)

Editorial. - Jin Akiyama; Mikio Kano; Xuehou Tan (Comput. Geom., 2006)

Dudeney Transformation of Normal Tiles. - Jin Akiyama; Midori Kobayashi; Gisaku Nakamura (KyotoCGGT, 2007)

Chromatic Numbers of Specified Isohedral Tilings. - Jin Akiyama; Chie Nara (KyotoCGGT, 2007)

Tile-Makers and Semi-Tile-Makers. - Jin Akiyama (Am. Math. Mon., 2007)

Universal Measuring Boxes with Triangular Bases. - Jin Akiyama; Hiroshi Fukuda; Chie Nara; Toshinori Sakai; Jorge Urrutia (Am. Math. Mon., 2008)

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

On Reversibility among Parallelohedra. - Jin Akiyama; Ikuro Sato; Hyunwoo Seong (EGC, 2011)

Arrangements of n Points whose Incident-Line-Numbers are at most n/2. - Jin Akiyama; Hiro Ito; Midori Kobayashi; Gisaku Nakamura (Graphs Comb., 2011)

Operators which Preserve Reversibility. - Jin Akiyama; Hyunwoo Seong (TJJCCGG, 2012)

An Algorithm for Determining Whether a Pair of Polygons Is Reversible. - Jin Akiyama; Hyunwoo Seong (FAW-AAIM, 2013)

Tessellabilities, Reversibilities, and Decomposabilities of Polytopes - (A Survey). - Jin Akiyama; Ikuro Sato; Hyunwoo Seong (GSI, 2013)

A decision algorithm for reversible pairs of polygons. - Jin Akiyama; David Rappaport; Hyunwoo Seong (Discret. Appl. Math., 2014)

Reversible Nets of Polyhedra. - Jin Akiyama; Stefan Langerman; Kiyoko Matsunaga (JCDCGG, 2015)

A Criterion for a Pair of Convex Polygons to be Reversible. - Jin Akiyama; Hyunwoo Seong (Graphs Comb., 2015)

Pentadral Complices. - Jin Akiyama; Hyunwoo Seong (J. Inf. Process., 2015)

Reversibility and foldability of Conway tiles. - Jin Akiyama; Kiyoko Matsunaga (Comput. Geom., 2017)

Generalization of Haberdasher's Puzzle. - Jin Akiyama; Kiyoko Matsunaga (Discret. Comput. Geom., 2017)

A recursive Algorithm for the k-face Numbers of Wythoffian-n-polytopes Constructed from Regular Polytopes. - Jin Akiyama; Sin Hitotumatu; Motonaga Ishii; Akihiro Matsuura; Ikuro Sato; Shun Toyoshima (J. Inf. Process., 2017)

Unfoldings of an envelope. - Jin Akiyama; Kiyoko Matsunaga (Eur. J. Comb., 2019)

Polyhedral Characterization of Reversible Hinged Dissections. - Jin Akiyama; Erik D. Demaine; Stefan Langerman (Graphs Comb., 2020)

Twenty Years of Progress of ${JCDCG}^3$. - Jin Akiyama; Hiro Ito; Toshinori Sakai; Yushi Uno (Graphs Comb., 2020)

An Algorithm for Folding a Conway Tile into an Isotetrahedron or a Rectangle Dihedron. - Jin Akiyama; Kiyoko Matsunaga (J. Inf. Process., 2020)

Memorial for Mari-Jo P. Ruiz - A Colleague and Friend in Art and Math. - Jin Akiyama (JCDCGGG, 2022)

Unveil the Secret Hidden in the Haberdasher's Puzzle - - Survey on Reversibility -. - Jin Akiyama; Stefan Langerman; Kiyoko Matsunaga (JCDCGGG, 2022)

High-Resolution Point Cloud Registration Method for Three-Dimensional Piping Measurements. - Jin Akiyama; Yuan Zong; Naoki Shinada; Taro Suzuki; Yoshiharu Amano (J. Robotics Mechatronics, 2023)

Determination of all graphs whose eccentric graphs are clusters. - Jin Akiyama; Takako Kodate; Kiyoko Matsunaga (Electron. J. Graph Theory Appl., 2024)