Atsushi Kaneko

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