Atsushi Kaneko

发表

The Connectivities of Leaf Graphs of 2-Connected Graphs

Atsushi Kaneko, Kiyoshi Yoshimoto, A. Kaneko, 1999, J. Comb. Theory, Ser. B.

On a 2-factor with a specified edge in a graph satisfying the Ore condition

Atsushi Kaneko, Kiyoshi Yoshimoto, A. Kaneko, 2002, Discret. Math..

A Rainbow k-Matching in the Complete Graph with r Colors

Shinya Fujita, Kazuhiro Suzuki, Ingo Schiermeyer, 2009, Electron. J. Comb..

Straight line embeddings of rooted star forests in the plane

Mikio Kano, Atsushi Kaneko, M. Kano, 2000, Discret. Appl. Math..

Some results on geometric independency trees

Atsushi Kaneko, Kiyoshi Yoshimoto, Yoshiaki Oda, 1999, CCCG.

On Minimally (n, )-Connected Graphs

Katsuhiro Ota, Atsushi Kaneko, 2000, J. Comb. Theory, Ser. B.

Straight-Line Embeddings of Two Rooted Trees in the Plane

Mikio Kano, Atsushi Kaneko, 1999, Discret. Comput. Geom..

On spanning trees with restricted degrees

Atsushi Kaneko, Kiyoshi Yoshimoto, 2000, Inf. Process. Lett..

C202 Optimization of transcutaneous signal transmission method used for implantable bone conduction hearing aid and evaluation of sound quality

Naoki Hayashi, Takuji Koike, Takuya Hashimoto, 2015 .

Balancing Colored Points on a Line by Exchanging Intervals

Mikio Kano, Mamoru Watanabe, Atsushi Kaneko, 2017, J. Inf. Process..

Paths and cycles concerning independent edges

Atsushi Kaneko, A. Kaneko, 1990, Graphs Comb..

On decomposition of triangle-free graphs under degree constraints

Atsushi Kaneko, 1998, J. Graph Theory.

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, A. Kaneko, 2003, J. Comb. Theory, Ser. B.

Cycles having the same modularity and removable edges in 2-connected graphs

Ken-ichi Kawarabayashi, Akira Saito, Kiyoshi Ando, 2003, Discret. Math..

Parallel optical-path-length-shifting digital holography.

Osamu Matoba, Yasuhiro Awatsuji, Toshihiro Kubota, 2009, Applied optics.

Path factors in claw-free graphs

Ken-ichi Kawarabayashi, Yoshimi Egawa, Kiyoshi Ando, 2002, Discret. Math..

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane

Mikio Kano, Atsushi Kaneko, Kiyoshi Yoshimoto, 2000, Int. J. Comput. Geom. Appl..

On a hamiltonian cycle in which specified vertices are not isolated

Ken-ichi Kawarabayashi, Atsushi Kaneko, Kiyoshi Yoshimoto, 2002, Discret. Math..

Cycles intersecting a prescribed vertex set

Akira Saito, Atsushi Kaneko, 1991, J. Graph Theory.

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph

Mamoru Watanabe, Hiroshi Maehara, Atsushi Kaneko, 1999, J. Comb. Theory, Ser. B.

Parallel two-step phase-shifting digital holography.

Osamu Matoba, Yasuhiro Awatsuji, Toshihiro Kubota, 2008, Applied optics.

Degree Sums and Covering Cycles

Zsolt Tuza, Hikoe Enomoto, Atsushi Kaneko, 1995, J. Graph Theory.

Contractible Edges and Bowties in a k-Connected Graph

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko, 2002, Ars Comb..

Balanced partitions of two sets of points in the plane

Mikio Kano, Atsushi Kaneko, 1999, Comput. Geom..

Integrated Solid Waste Management: 2. Decision Support System

S. Ranji Ranjithan, Subba R. Nishtala, Atsushi Kaneko, 1995 .

Contractible edges in minimally k-connected graphs

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko, 2008, Discret. Math..

On the Maximum Degree of Bipartite Embeddings of Trees in the Plane

Atsushi Kaneko, 1998, JCDCG.

A Balanced Interval of Two Sets of Points on a Line

Mikio Kano, Atsushi Kaneko, 2003, IJCCGGT.

Vertices of degree 6 in a contraction critically 6-connected graph

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko, 2003, Discret. Math..

Contractible edges in minimally k-connected graphs

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko, 2002, Electron. Notes Discret. Math..

A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition

Atsushi Kaneko, Kiyoshi Yoshimoto, A. Kaneko, 2000, Electron. Notes Discret. Math..

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests

Mikio Kano, Atsushi Kaneko, 2005, Int. J. Comput. Geom. Appl..

Vertices of Degree 5 in a Contraction Critically 5-connected Graph

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko, 2005, Graphs Comb..

String Decompositions of Graphs

Mamoru Watanabe, Atsushi Kaneko, 1998, Ars Comb..

On Paths in a Complete Bipartite Geometric Graph

Mikio Kano, Atsushi Kaneko, 2000, JCDCG.

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed

Atsushi Kaneko, Kiyoshi Yoshimoto, 2001, J. Comb. Theory, Ser. B.

Vertices of degree 6 in a 6-contraction critical graph

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko, 2001, Electron. Notes Discret. Math..

Spanning trees with constraints on the leaf degree

Atsushi Kaneko, 2001, Discret. Appl. Math..

A mixed version of Menger's theorem

Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto, 1991, Comb..

On geometric independency trees for points in the plane

Atsushi Kaneko, Kiyoshi Yoshimoto, Yoshiaki Oda, 2002, Discret. Math..

Radial Perfect Partitions of Convex Sets in the Plane

Jorge Urrutia, Jin Akiyama, Mikio Kano, 1998, JCDCG.

On packing 3-vertex paths in a graph

Alexander K. Kelmans, Atsushi Kaneko, Tsuyoshi Nishimura, 2001, J. Graph Theory.

Integrated Solid Waste Management: 1. Mathematical Modeling

S. Ranji Ranjithan, Subba R. Nishtala, Atsushi Kaneko, 1995 .

A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition

Atsushi Kaneko, Kiyoshi Yoshimoto, A. Kaneko, 2003, J. Graph Theory.

Generalized Balanced Partitions of Two Sets of Points in the Plane

Mikio Kano, Atsushi Kaneko, 2000, JCDCG.

Long cycles in triangle-free graphs with prescribed independence number and connectivity

Hikoe Enomoto, Akira Saito, Atsushi Kaneko, 2004, J. Comb. Theory, Ser. B.

Relative length of long paths and cycles in graphs with large degree sums

Hikoe Enomoto, Akira Saito, Jan van den Heuvel, 1995, J. Graph Theory.

Mehrsprachiges gleichzeitiges versenden von software

Atsushi Kaneko, Jayant Kulkarni, Daniel Salzer, 2002 .

The bandwidth of a tree with k leaves is at most

Kiyoshi Ando, Severino V. Gervacio, Atsushi Kaneko, 1996, Discret. Math..

A degree condition for the existence of 1-factors in graphs or their complements

Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura, 1999, Discret. Math..

Straight-line embeddings of three rooted trees in the plane

Mikio Kano, Atsushi Kaneko, Shin-ichi Tokunaga, 1998, CCCG.

Rainbow cycles in edge-colored graphs

Zdenek Ryjácek, Atsushi Kaneko, Kiyoshi Yoshimoto, 2016, Discret. Math..

A balanced partition of points in the plane and tree embedding problems

Atsushi Kaneko, 1997, CCCG.

A step towards the Smart Campus: a venture project based on distance learning by a hybrid video conferencing system

Atsushi Kaneko, Toru Suzuki, Shintaro Ishijima, 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

Spanning trees with leaf distance at least four

Kazuhiro Suzuki, Mikio Kano, Atsushi Kaneko, 2007, J. Graph Theory.

On decomposition of triangle-free graphs under degree constraints

Atsushi Kaneko, 1998 .

Path Coverings of Two Sets of Points in the Plane

Atsushi Kaneko, M. Kano, Kazuhiro Suzuki, .

A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition

Atsushi Kaneko, Kiyoshi Yoshimoto, A. Kaneko, 2003 .

Partitioning complete multipartite graphs by monochromatic trees

Mikio Kano, Atsushi Kaneko, Kazuhiro Suzuki, 2005 .

On longest cycles in a balanced bipartite graph with Ore type condition, II

Atsushi Kaneko, Kiyoshi Yoshimoto, A. Kaneko, 2002 .

Spanning trees with leaf distance at least four

Mikio Kano, Atsushi Kaneko, Kazuhiro Suzuki, 2007 .

Discrete Geometry on Red and Blue Points in the Plane — A Survey —

Mikio Kano, Atsushi Kaneko, 2020 .

The Condition of Beineke and Harary on Edge-Disjoint Paths Some of Which are Openly Disjoint

Hikoe Enomoto, Atsushi Kaneko, 1994 .

On packing 3-vertex paths in a graph

Atsushi Kaneko, Tsuyoshi Nishimura, Alexander Kelmans, 2001, Journal of Graph Theory.