A feedback queueing model for an interactive computer system. - Gisaku Nakamura (AFIPS Fall Joint Computing Conference, 1971)

A perfect one-factorization ofK36. - Midori Kobayashi; Hitoshi Awoki; Yoshimi Nakazaki; Gisaku Nakamura (Graphs Comb., 1989)

Dudeney's round table problem. - Katherine Heinrich; Midori Kobayashi; Gisaku Nakamura (Discret. Math., 1991)

Resolvable Coverings of 2-Paths by 4-Cycles. - Midori Kobayashi; Gisaku Nakamura (J. Comb. Theory A, 1992)

Exact Coverings of 2-Paths by Hamilton Cycles. - Midori Kobayashi; Gisaku Nakamura (J. Comb. Theory A, 1992)

A Solution of Dudeney's Round Table Problem for an Even Number of People. - Midori Kobayashi; Kiyasu-Zen'iti; Gisaku Nakamura (J. Comb. Theory A, 1993)

On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. - Midori Kobayashi; Gisaku Nakamura (Graphs Comb., 1994)

A solution of Dudeney's round table problem for p^eq^f + 1. - Katherine Heinrich; Midori Kobayashi; Gisaku Nakamura (Ars Comb., 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)

Visibility of Disks on the Lattice Points. - Nobuaki Mutoh; 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)

A Thinning Algorithm for Digital Figures of Characters. - Michio Shimizu; Hiroshi Fukuda; Gisaku Nakamura (SSIAI, 2000)

New infinite classes of 1-factorizations of complete graphs. - Midori Kobayashi; Nobuaki Mutoh; Gisaku Nakamura (Australas. J Comb., 2000)

Uniform coverings of 2-paths by 4-paths. - Midori Kobayashi; Gisaku Nakamura (Australas. J Comb., 2001)

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)

Double Dudeney sets for an odd number of vertices. - Midori Kobayashi; Nobuaki Mutoh; Kiyasu-Zen'iti; Gisaku Nakamura (Australas. J Comb., 2002)

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

New Series of Dudeney Sets for p + 2 Vertices. - Midori Kobayashi; Nobuaki Mutoh; Kiyasu-Zen'iti; 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)

Resolvable Coverings of 2-Paths by Cycles. - Midori Kobayashi; Gisaku Nakamura (Graphs Comb., 2002)

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

Uniform coverings of 2-paths with 5-paths in K2n. - Midori Kobayashi; Gisaku Nakamura; Chie Nara (Australas. J Comb., 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)

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

Uniform coverings of 2-paths with 5-paths in the complete graph. - Midori Kobayashi; Gisaku Nakamura; Chie Nara (Discret. Math., 2005)

Uniform coverings of 2-paths with 6-cycles in the complete graph. - Midori Kobayashi; Gisaku Nakamura (Australas. J Comb., 2006)

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

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

Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry. - Hiroshi Fukuda; Nobuaki Mutoh; Gisaku Nakamura; Doris Schattschneider (KyotoCGGT, 2007)

A Method to Generate Polyominoes and Polyiamonds for Tilings with Rotational Symmetry. - Hiroshi Fukuda; Nobuaki Mutoh; Gisaku Nakamura; Doris Schattschneider (Graphs Comb., 2007)

Semi-Distance Codes and Steiner Systems. - Hiro Ito; Midori Kobayashi; Gisaku Nakamura (Graphs Comb., 2007)

Winning Ways of Weighted Poset Games. - Hiro Ito; Gisaku Nakamura; Satoshi Takata (Graphs Comb., 2007)

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

Polyominoes and Polyiamonds as Fundamental Domains for Isohedral Tilings of Crystal Class D2. - Hiroshi Fukuda; Chiaki Kanomata; Nobuaki Mutoh; Gisaku Nakamura; Doris Schattschneider (Symmetry, 2011)

Polyominoes and Polyiamonds as Fundamental Domains of Isohedral Tilings with Rotational Symmetry. - Hiroshi Fukuda; Chiaki Kanomata; Nobuaki Mutoh; Gisaku Nakamura; Doris Schattschneider (Symmetry, 2011)

3-Perfect hamiltonian decomposition of the complete graph. - Midori Kobayashi; Brendan D. McKay; Nobuaki Mutoh; Gisaku Nakamura; Chie Nara (Australas. J Comb., 2013)

Uniform coverings of 2-paths with 4-cycles. - Midori Kobayashi; Keiko Kotani; Nobuaki Mutoh; Gisaku Nakamura (AKCE Int. J. Graphs Comb., 2015)