Atsushi Kaneko

Orcid: 0000-0003-1377-3312

According to our database1, Atsushi Kaneko authored at least 54 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
One-Piece 3D-Printed Legs Using Compliant Mechanisms That Produce Effective Propulsive Force for Hexapod Robot Locomotion.
Proceedings of the IEEE International Conference on Soft Robotics, 2023

2022
Conversion of Elastic Energy Stored in the Legs of a Hexapod Robot into Propulsive Force.
Proceedings of the Biomimetic and Biohybrid Systems - 11th International Conference, 2022

2017
Balancing Colored Points on a Line by Exchanging Intervals.
J. Inf. Process., 2017

2016
Rainbow cycles in edge-colored graphs.
Discret. Math., 2016

2009
A Rainbow k-Matching in the Complete Graph with r Colors.
Electron. J. Comb., 2009

2007
Spanning trees with leaf distance at least four.
J. Graph Theory, 2007

2006
Packing two copies of a tree into its third power.
Discret. Math., 2006

2005
Partitioning complete multipartite graphs by monochromatic trees.
J. Graph Theory, 2005

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests.
Int. J. Comput. Geom. Appl., 2005

Vertices of Degree 5 in a Contraction Critically 5-connected Graph.
Graphs Comb., 2005

2004
Long cycles in triangle-free graphs with prescribed independence number and connectivity.
J. Comb. Theory B, 2004

2003
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
J. Graph Theory, 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.
J. Comb. Theory B, 2003

Vertices of degree 6 in a contraction critically 6-connected graph.
Discret. Math., 2003

Cycles having the same modularity and removable edges in 2-connected graphs.
Discret. Math., 2003

A Balanced Interval of Two Sets of Points on a Line.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
Contractible edges in minimally k-connected graphs.
Electron. Notes Discret. Math., 2002

On a 2-factor with a specified edge in a graph satisfying the Ore condition.
Discret. Math., 2002

On geometric independency trees for points in the plane.
Discret. Math., 2002

On a hamiltonian cycle in which specified vertices are not isolated.
Discret. Math., 2002

Path factors in claw-free graphs.
Discret. Math., 2002

Perfect Partitions of Convex Sets in the Plane.
Discret. Comput. Geom., 2002

Contractible Edges and Bowties in a k-Connected Graph.
Ars Comb., 2002

2001
On packing 3-vertex paths in a graph.
J. Graph Theory, 2001

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed.
J. Comb. Theory B, 2001

Vertices of degree 6 in a 6-contraction critical graph.
Electron. Notes Discret. Math., 2001

Spanning trees with constraints on the leaf degree.
Discret. Appl. Math., 2001

2000
On Minimally (n, )-Connected Graphs.
J. Comb. Theory B, 2000

On spanning trees with restricted degrees.
Inf. Process. Lett., 2000

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.
Int. J. Comput. Geom. Appl., 2000

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

Straight line embeddings of rooted star forests in the plane.
Discret. Appl. Math., 2000

A step towards the Smart Campus: a venture project based on distance learning by a hybrid video conferencing system.
Proceedings of the IEEE International Conference on Systems, 2000

On Paths in a Complete Bipartite Geometric Graph.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Generalized Balanced Partitions of Two Sets of Points in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
The Connectivities of Leaf Graphs of 2-Connected Graphs.
J. Comb. Theory B, 1999

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph.
J. Comb. Theory B, 1999

A degree condition for the existence of 1-factors in graphs or their complements.
Discret. Math., 1999

Straight-Line Embeddings of Two Rooted Trees in the Plane.
Discret. Comput. Geom., 1999

Balanced partitions of two sets of points in the plane.
Comput. Geom., 1999

Some results on geometric independency trees.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

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

String Decompositions of Graphs.
Ars Comb., 1998

On the Maximum Degree of Bipartite Embeddings of Trees in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Radial Perfect Partitions of Convex Sets in the Plane.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Straight-line embeddings of three rooted trees in the plane.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997
A balanced partition of points in the plane and tree embedding problems.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
The bandwidth of a tree with k leaves is at most.
Discret. Math., 1996

A remark on the connectivity of the complement of a 3-connected graph.
Discret. Math., 1996

1995
Degree Sums and Covering Cycles.
J. Graph Theory, 1995

Relative length of long paths and cycles in graphs with large degree sums.
J. Graph Theory, 1995

1991
Cycles intersecting a prescribed vertex set.
J. Graph Theory, 1991

A mixed version of Menger's theorem.
Comb., 1991

1990
Paths and cycles concerning independent edges.
Graphs Comb., 1990


  Loading...