default search action
Atsushi Kaneko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c12]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: 1-7 - 2022
- [c11]Atsushi Kaneko
, Masahiro Shimizu
Conversion of Elastic Energy Stored in the Legs of a Hexapod Robot into Propulsive Force. Living Machines 2022: 91-102
2010 – 2019
- 2017
- [j44]Atsushi Kaneko, Mikio Kano, Mamoru Watanabe:
Balancing Colored Points on a Line by Exchanging Intervals. J. Inf. Process. 25: 551-553 (2017) - 2016
- [j43]Roman Cada
Rainbow cycles in edge-colored graphs. Discret. Math. 339(4): 1387-1392 (2016)
2000 – 2009
- 2009
- [j42]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) - 2008
- [j41]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Discret. Math. 308(4): 597-602 (2008) - 2007
- [j40]Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
Spanning trees with leaf distance at least four. J. Graph Theory 55(1): 83-90 (2007) - 2006
- [j39]Atsushi Kaneko, Kazuhiro Suzuki:
Packing two copies of a tree into its third power. Discret. Math. 306(21): 2779-2785 (2006) - 2005
- [j38]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. 21(1): 27-37 (2005) - [j37]Atsushi Kaneko, Mikio Kano:
Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geom. Appl. 15(3): 229-238 (2005) - [j36]Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48(2): 133-141 (2005) - 2004
- [j35]Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory B 91(1): 43-55 (2004) - 2003
- [j34]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): 23-30 (2003) - [j33]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. 273(1-3): 55-69 (2003) - [j32]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 B 88(2): 195-218 (2003) - [j31]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): 269-279 (2003) - [c10]Atsushi Kaneko, Mikio Kano:
A Balanced Interval of Two Sets of Points on a Line. IJCCGGT 2003: 108-112 - 2002
- [j30]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto:
Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002) - [j29]Atsushi Kaneko, Mikio Kano:
Perfect Partitions of Convex Sets in the Plane. Discret. Comput. Geom. 28(2): 211-222 (2002) - [j28]Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
Path factors in claw-free graphs. Discret. Math. 243(1-3): 195-200 (2002) - [j27]Atsushi Kaneko, Kiyoshi Yoshimoto:
On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discret. Math. 257(2-3): 445-461 (2002) - [j26]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): 85-91 (2002) - [j25]Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
On geometric independency trees for points in the plane. Discret. Math. 258(1-3): 93-104 (2002) - [j24]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. 11: 20-29 (2002) - 2001
- [j23]Atsushi Kaneko:
Spanning trees with constraints on the leaf degree. Discret. Appl. Math. 115(1-3): 73-76 (2001) - [j22]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. 10: 2-6 (2001) - [j21]Atsushi Kaneko, Kiyoshi Yoshimoto:
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. J. Comb. Theory B 81(1): 100-109 (2001) - [j20]Atsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura:
On packing 3-vertex paths in a graph. J. Graph Theory 36(4): 175-197 (2001) - 2000
- [j19]Atsushi Kaneko, Mikio Kano:
Straight line embeddings of rooted star forests in the plane. Discret. Appl. Math. 101(1-3): 167-175 (2000) - [j18]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: 198-200 (2000) - [j17]Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto:
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10(1): 73-78 (2000) - [j16]Atsushi Kaneko, Kiyoshi Yoshimoto:
On spanning trees with restricted degrees. Inf. Process. Lett. 73(5-6): 163-165 (2000) - [j15]Atsushi Kaneko, Katsuhiro Ota:
On Minimally (n, )-Connected Graphs. J. Comb. Theory B 80(1): 156-171 (2000) - [c9]Atsushi Kaneko, Mikio Kano:
Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG 2000: 176-186 - [c8]Atsushi Kaneko, Mikio Kano:
On Paths in a Complete Bipartite Geometric Graph. JCDCG 2000: 187-191 - [c7]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: 38-43
1990 – 1999
- 1999
- [j14]Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999) - [j13]Atsushi Kaneko, Mikio Kano:
Straight-Line Embeddings of Two Rooted Trees in the Plane. Discret. Comput. Geom. 21(4): 603-613 (1999) - [j12]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): 1-8 (1999) - [j11]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 B 75(1): 110-115 (1999) - [j10]Atsushi Kaneko, Kiyoshi Yoshimoto:
The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory B 76(2): 155-169 (1999) - [c6]Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
Some results on geometric independency trees. CCCG 1999 - 1998
- [j9]Atsushi Kaneko, Mamoru Watanabe:
String Decompositions of Graphs. Ars Comb. 49 (1998) - [j8]Atsushi Kaneko:
On decomposition of triangle-free graphs under degree constraints. J. Graph Theory 27(1): 7-9 (1998) - [c5]Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. CCCG 1998 - [c4]Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga:
Straight-line embeddings of three rooted trees in the plane. CCCG 1998 - [c3]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: 1-13 - [c2]Atsushi Kaneko:
On the Maximum Degree of Bipartite Embeddings of Trees in the Plane. JCDCG 1998: 166-171 - 1997
- [c1]Atsushi Kaneko:
A balanced partition of points in the plane and tree embedding problems. CCCG 1997 - 1996
- [j7]Kiyoshi Ando, Atsushi Kaneko, Severino Villanueva Gervacio:
The bandwidth of a tree with k leaves is at most. Discret. Math. 150(1-3): 403-406 (1996) - [j6]Kiyoshi Ando, Atsushi Kaneko:
A remark on the connectivity of the complement of a 3-connected graph. Discret. Math. 151(1-3): 39-47 (1996) - 1995
- [j5]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): 213-225 (1995) - [j4]Hikoe Enomoto, Atsushi Kaneko, Mekkia Kouider, Zsolt Tuza:
Degree Sums and Covering Cycles. J. Graph Theory 20(4): 419-422 (1995) - 1991
- [j3]Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto:
A mixed version of Menger's theorem. Comb. 11(1): 71-74 (1991) - [j2]Atsushi Kaneko, Akira Saito:
Cycles intersecting a prescribed vertex set. J. Graph Theory 15(6): 655-664 (1991) - 1990
- [j1]Atsushi Kaneko:
Paths and cycles concerning independent edges. Graphs Comb. 6(4): 339-363 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: