Atsushi Kaneko

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 4

Top Topics

Robot Navigation

Quadruped Robot

Adjacency Graph

Top Venues

J. Inf. Process.

Living Machines

Publications

Atsushi Kaneko, Dai Owaki, Masahiro Shimizu, Takuya Umedachi
One-Piece 3D-Printed Legs Using Compliant Mechanisms That Produce Effective Propulsive Force for Hexapod Robot Locomotion. RoboSoft (2023)
Atsushi Kaneko, Masahiro Shimizu, Takuya Umedachi
Conversion of Elastic Energy Stored in the Legs of a Hexapod Robot into Propulsive Force. Living Machines (2022)
Atsushi Kaneko, Mikio Kano, Mamoru Watanabe
Balancing Colored Points on a Line by Exchanging Intervals. J. Inf. Process. 25 (2017)
Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto
Rainbow cycles in edge-colored graphs. Discret. Math. 339 (4) (2016)
Shinya Fujita, Atsushi Kaneko, Ingo Schiermeyer, Kazuhiro Suzuki
A Rainbow k-Matching in the Complete Graph with r Colors. Electron. J. Comb. 16 (1) (2009)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Contractible edges in minimally k-connected graphs. Discret. Math. 308 (4) (2008)
Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
Spanning trees with leaf distance at least four. J. Graph Theory 55 (1) (2007)
Atsushi Kaneko, Kazuhiro Suzuki
Packing two copies of a tree into its third power. Discret. Math. 306 (21) (2006)
Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48 (2) (2005)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. 21 (1) (2005)
Atsushi Kaneko, Mikio Kano
Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geom. Appl. 15 (3) (2005)
Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory, Ser. B 91 (1) (2004)
Atsushi Kaneko
A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Comb. Theory, Ser. B 88 (2) (2003)
Atsushi Kaneko, Kiyoshi Yoshimoto
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. J. Graph Theory 43 (4) (2003)
Atsushi Kaneko, Mikio Kano
A Balanced Interval of Two Sets of Points on a Line. IJCCGGT (2003)
Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito
Cycles having the same modularity and removable edges in 2-connected graphs. Discret. Math. 265 (1-3) (2003)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. 273 (1-3) (2003)
Atsushi Kaneko, Kiyoshi Yoshimoto
On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discret. Math. 257 (2-3) (2002)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. 11 (2002)
Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
Path factors in claw-free graphs. Discret. Math. 243 (1-3) (2002)
Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto
On a hamiltonian cycle in which specified vertices are not isolated. Discret. Math. 258 (1-3) (2002)
Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
On geometric independency trees for points in the plane. Discret. Math. 258 (1-3) (2002)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64 (2002)
Atsushi Kaneko, M. Kano
Perfect Partitions of Convex Sets in the Plane. Discret. Comput. Geom. 28 (2) (2002)
Atsushi Kaneko, Kiyoshi Yoshimoto
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. J. Comb. Theory, Ser. B 81 (1) (2001)
Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. 10 (2001)
Atsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura
On packing 3-vertex paths in a graph. J. Graph Theory 36 (4) (2001)
Atsushi Kaneko
Spanning trees with constraints on the leaf degree. Discret. Appl. Math. 115 (1-3) (2001)
Atsushi Kaneko, Kiyoshi Yoshimoto
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. Electron. Notes Discret. Math. 5 (2000)
Atsushi Kaneko, Kiyoshi Yoshimoto
On spanning trees with restricted degrees. Inf. Process. Lett. 73 (5-6) (2000)
Atsushi Kaneko, Noboru Sugino, Toru Suzuki, Shintaro Ishijima
A step towards the Smart Campus: a venture project based on distance learning by a hybrid video conferencing system. SMC (2000)
Atsushi Kaneko, Mikio Kano
On Paths in a Complete Bipartite Geometric Graph. JCDCG (2000)
Atsushi Kaneko, Mikio Kano
Straight line embeddings of rooted star forests in the plane. Discret. Appl. Math. 101 (1-3) (2000)
Atsushi Kaneko, Katsuhiro Ota
On Minimally (n, )-Connected Graphs. J. Comb. Theory, Ser. B 80 (1) (2000)
Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Atsushi Kaneko, Mikio Kano
Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG (2000)
Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. J. Comb. Theory, Ser. B 75 (1) (1999)
Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
Some results on geometric independency trees. CCCG (1999)
Atsushi Kaneko, Mikio Kano
Balanced partitions of two sets of points in the plane. Comput. Geom. 13 (4) (1999)
Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura
A degree condition for the existence of 1-factors in graphs or their complements. Discret. Math. 203 (1-3) (1999)
Atsushi Kaneko, Mikio Kano
Straight-Line Embeddings of Two Rooted Trees in the Plane. Discret. Comput. Geom. 21 (4) (1999)
Atsushi Kaneko, Kiyoshi Yoshimoto
The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory, Ser. B 76 (2) (1999)
Atsushi Kaneko
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. JCDCG (1998)
Atsushi Kaneko
On decomposition of triangle-free graphs under degree constraints. J. Graph Theory 27 (1) (1998)
Atsushi Kaneko, Mikio Kano
Balanced partitions of two sets of points in the plane. 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)
Atsushi Kaneko, Mamoru Watanabe
String Decompositions of Graphs. Ars Comb. 49 (1998)
Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga
Straight-line embeddings of three rooted trees in the plane. CCCG (1998)
Atsushi Kaneko
A balanced partition of points in the plane and tree embedding problems. CCCG (1997)
Kiyoshi Ando, Atsushi Kaneko, Severino Villanueva Gervacio
The bandwidth of a tree with k leaves is at most. Discret. Math. 150 (1-3) (1996)
Kiyoshi Ando, Atsushi Kaneko
A remark on the connectivity of the complement of a 3-connected graph. Discret. Math. 151 (1-3) (1996)
Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza
Degree Sums and Covering Cycles. J. Graph Theory 20 (4) (1995)
Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito
Relative length of long paths and cycles in graphs with large degree sums. J. Graph Theory 20 (2) (1995)
Atsushi Kaneko, Akira Saito
Cycles intersecting a prescribed vertex set. J. Graph Theory 15 (6) (1991)
Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
A mixed version of Menger's theorem. Comb. 11 (1) (1991)
Atsushi Kaneko
Paths and cycles concerning independent edges. Graphs Comb. 6 (4) (1990)