Paths and cycles concerning independent edges. - Atsushi Kaneko (Graphs Comb., 1990)

A mixed version of Menger's theorem. - Yoshimi Egawa; Atsushi Kaneko; Makoto Matsumoto (Comb., 1991)

Cycles intersecting a prescribed vertex set. - Atsushi Kaneko; Akira Saito (J. Graph Theory, 1991)

Relative length of long paths and cycles in graphs with large degree sums. - Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito (J. Graph Theory, 1995)

Degree Sums and Covering Cycles. - Hikoe Enomoto; Atsushi Kaneko; Mekkia Kouider; Zsolt Tuza (J. Graph Theory, 1995)

A remark on the connectivity of the complement of a 3-connected graph. - Kiyoshi Ando; Atsushi Kaneko (Discret. Math., 1996)

The bandwidth of a tree with k leaves is at most. - Kiyoshi Ando; Atsushi Kaneko; Severino Villanueva Gervacio (Discret. Math., 1996)

A balanced partition of points in the plane and tree embedding problems. - Atsushi Kaneko (CCCG, 1997)

Straight-line embeddings of three rooted trees in the plane. - Atsushi Kaneko; Mikio Kano; Shin-ichi Tokunaga (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)

On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. - Atsushi Kaneko (JCDCG, 1998)

String Decompositions of Graphs. - Atsushi Kaneko; Mamoru Watanabe (Ars Comb., 1998)

On decomposition of triangle-free graphs under degree constraints. - Atsushi Kaneko (J. Graph Theory, 1998)

Some results on geometric independency trees. - Atsushi Kaneko; Yoshiaki Oda; Kiyoshi Yoshimoto (CCCG, 1999)

Balanced partitions of two sets of points in the plane. - Atsushi Kaneko; Mikio Kano (Comput. Geom., 1999)

Straight-Line Embeddings of Two Rooted Trees in the Plane. - Atsushi Kaneko; Mikio Kano (Discret. Comput. Geom., 1999)

A degree condition for the existence of 1-factors in graphs or their complements. - Kiyoshi Ando; Atsushi Kaneko; Tsuyoshi Nishimura (Discret. Math., 1999)

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. - Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe (J. Comb. Theory B, 1999)

The Connectivities of Leaf Graphs of 2-Connected Graphs. - Atsushi Kaneko; Kiyoshi Yoshimoto (J. Comb. Theory B, 1999)

Generalized Balanced Partitions of Two Sets of Points in the Plane. - Atsushi Kaneko; Mikio Kano (JCDCG, 2000)

On Paths in a Complete Bipartite Geometric Graph. - Atsushi Kaneko; Mikio Kano (JCDCG, 2000)

A step towards the Smart Campus: a venture project based on distance learning by a hybrid video conferencing system. - Atsushi Kaneko; Noboru Sugino; Toru Suzuki; Shintaro Ishijima (SMC, 2000)

Straight line embeddings of rooted star forests in the plane. - Atsushi Kaneko; Mikio Kano (Discret. Appl. Math., 2000)

A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. - Atsushi Kaneko; Kiyoshi Yoshimoto (Electron. Notes Discret. Math., 2000)

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. - Atsushi Kaneko; Mikio Kano; Kiyoshi Yoshimoto (Int. J. Comput. Geom. Appl., 2000)

On spanning trees with restricted degrees. - Atsushi Kaneko; Kiyoshi Yoshimoto (Inf. Process. Lett., 2000)

On Minimally (n, )-Connected Graphs. - Atsushi Kaneko; Katsuhiro Ota (J. Comb. Theory B, 2000)

Spanning trees with constraints on the leaf degree. - Atsushi Kaneko (Discret. Appl. Math., 2001)

Vertices of degree 6 in a 6-contraction critical graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2001)

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. - Atsushi Kaneko; Kiyoshi Yoshimoto (J. Comb. Theory B, 2001)

On packing 3-vertex paths in a graph. - Atsushi Kaneko; Alexander K. Kelmans; Tsuyoshi Nishimura (J. Graph Theory, 2001)

Contractible Edges and Bowties in a k-Connected Graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi; Kiyoshi Yoshiomoto (Ars Comb., 2002)

Perfect Partitions of Convex Sets in the Plane. - Atsushi Kaneko; Mikio Kano (Discret. Comput. Geom., 2002)

Path factors in claw-free graphs. - Kiyoshi Ando; Yoshimi Egawa; Atsushi Kaneko; Ken-ichi Kawarabayashi; Haruhide Matsuda (Discret. Math., 2002)

On a hamiltonian cycle in which specified vertices are not isolated. - Atsushi Kaneko; Ken-ichi Kawarabayashi; Katsuhiro Ota; Kiyoshi Yoshimoto (Discret. Math., 2002)

On geometric independency trees for points in the plane. - Atsushi Kaneko; Yoshiaki Oda; Kiyoshi Yoshimoto (Discret. Math., 2002)

On a 2-factor with a specified edge in a graph satisfying the Ore condition. - Atsushi Kaneko; Kiyoshi Yoshimoto (Discret. Math., 2002)

Contractible edges in minimally k-connected graphs. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Electron. Notes Discret. Math., 2002)

A Balanced Interval of Two Sets of Points on a Line. - Atsushi Kaneko; Mikio Kano (IJCCGGT, 2003)

Cycles having the same modularity and removable edges in 2-connected graphs. - Kiyoshi Ando; Mariko Hagita; Atsushi Kaneko; Mikio Kano; Ken-ichi Kawarabayashi; Akira Saito (Discret. Math., 2003)

Vertices of degree 6 in a contraction critically 6-connected graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Discret. Math., 2003)

A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. - Atsushi Kaneko (J. Comb. Theory B, 2003)

A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. - Atsushi Kaneko; Kiyoshi Yoshimoto (J. Graph Theory, 2003)

Long cycles in triangle-free graphs with prescribed independence number and connectivity. - Hikoe Enomoto; Atsushi Kaneko; Akira Saito; Bing Wei 001 (J. Comb. Theory B, 2004)

Vertices of Degree 5 in a Contraction Critically 5-connected Graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi (Graphs Comb., 2005)

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. - Atsushi Kaneko; Mikio Kano (Int. J. Comput. Geom. Appl., 2005)

Partitioning complete multipartite graphs by monochromatic trees. - Atsushi Kaneko; Mikio Kano; Kazuhiro Suzuki (J. Graph Theory, 2005)

Packing two copies of a tree into its third power. - Atsushi Kaneko; Kazuhiro Suzuki (Discret. Math., 2006)

Spanning trees with leaf distance at least four. - Atsushi Kaneko; Mikio Kano; Kazuhiro Suzuki (J. Graph Theory, 2007)

A Rainbow k-Matching in the Complete Graph with r Colors. - Shinya Fujita 001; Atsushi Kaneko; Ingo Schiermeyer; Kazuhiro Suzuki (Electron. J. Comb., 2009)

Rainbow cycles in edge-colored graphs. - Roman Cada; Atsushi Kaneko; Zdenek Ryjácek; Kiyoshi Yoshimoto (Discret. Math., 2016)

Balancing Colored Points on a Line by Exchanging Intervals. - Atsushi Kaneko; Mikio Kano; Mamoru Watanabe (J. Inf. Process., 2017)

Conversion of Elastic Energy Stored in the Legs of a Hexapod Robot into Propulsive Force. - Atsushi Kaneko; Masahiro Shimizu; Takuya Umedachi (Living Machines, 2022)

One-Piece 3D-Printed Legs Using Compliant Mechanisms That Produce Effective Propulsive Force for Hexapod Robot Locomotion. - Atsushi Kaneko; Dai Owaki; Masahiro Shimizu; Takuya Umedachi (RoboSoft, 2023)