The SCEAS System
| |||||||

## Search the dblp DataBase
Atsushi Kaneko:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Atsushi Kaneko
**A balanced partition of points in the plane and tree embedding problems.**[Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf] - Atsushi Kaneko, Mikio Kano
**Balanced partitions of two sets of points in the plane.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga
**Straight-line embeddings of three rooted trees in the plane.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
**Some results on geometric independency trees.**[Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf] - 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.**[Citation Graph (0, 0)][DBLP] JCDCG, 1998, pp:1-13 [Conf] - Atsushi Kaneko, Mikio Kano
**A Balanced Interval of Two Sets of Points on a Line.**[Citation Graph (0, 0)][DBLP] IJCCGGT, 2003, pp:108-112 [Conf] - Atsushi Kaneko, Mikio Kano
**On Paths in a Complete Bipartite Geometric Graph.**[Citation Graph (0, 0)][DBLP] JCDCG, 2000, pp:187-191 [Conf] - Atsushi Kaneko
**On the Maximum Degree of Bipartite Embeddings of Trees in the Plane.**[Citation Graph (0, 0)][DBLP] JCDCG, 1998, pp:166-171 [Conf] - Atsushi Kaneko, Mikio Kano
**Generalized Balanced Partitions of Two Sets of Points in the Plane.**[Citation Graph (0, 0)][DBLP] JCDCG, 2000, pp:176-186 [Conf] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
**Contractible Edges and Bowties in a k-Connected Graph.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:64, n:, pp:239-0 [Journal] - Atsushi Kaneko, Mamoru Watanabe
**String Decompositions of Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:49, n:, pp:- [Journal] - Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
**A mixed version of Menger's theorem.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1991, v:11, n:1, pp:71-74 [Journal] - Atsushi Kaneko, Mikio Kano
**Balanced partitions of two sets of points in the plane.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1999, v:13, n:4, pp:253-261 [Journal] - Atsushi Kaneko
**Spanning trees with constraints on the leaf degree.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:73-76 [Journal] - Atsushi Kaneko, Mikio Kano
**Straight line embeddings of rooted star forests in the plane.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:167-175 [Journal] - Atsushi Kaneko, Mikio Kano
**Straight-Line Embeddings of Two Rooted Trees in the Plane.**[Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 1999, v:21, n:4, pp:603-613 [Journal] - Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
**Path factors in claw-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:195-200 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:265, n:1-3, pp:23-30 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
**Vertices of degree 6 in a contraction critically 6-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:273, n:1-3, pp:55-69 [Journal] - Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto
**On a hamiltonian cycle in which specified vertices are not isolated.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:85-91 [Journal] - Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
**On geometric independency trees for points in the plane.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:93-104 [Journal] - Atsushi Kaneko, Kiyoshi Yoshimoto
**On a 2-factor with a specified edge in a graph satisfying the Ore condition.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:257, n:2-3, pp:445-461 [Journal] - Atsushi Kaneko, Kazuhiro Suzuki
**Packing two copies of a tree into its third power.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:21, pp:2779-2785 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
**Vertices of Degree 5 in a Contraction Critically 5-connected Graph.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2005, v:21, n:1, pp:27-37 [Journal] - Atsushi Kaneko, Mikio Kano
**Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2005, v:15, n:3, pp:229-238 [Journal] - Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
**Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:1, pp:73-78 [Journal] - Atsushi Kaneko, Kiyoshi Yoshimoto
**On spanning trees with restricted degrees.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:5-6, pp:163-165 [Journal] - Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei
**Long cycles in triangle-free graphs with prescribed independence number and connectivity.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2004, v:91, n:1, pp:43-55 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:195-218 [Journal] - Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe
**On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:110-115 [Journal] - Atsushi Kaneko, Katsuhiro Ota
**On Minimally (n, )-Connected Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2000, v:80, n:1, pp:156-171 [Journal] - Atsushi Kaneko, Kiyoshi Yoshimoto
**On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:100-109 [Journal] - Atsushi Kaneko, Kiyoshi Yoshimoto
**The Connectivities of Leaf Graphs of 2-Connected Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:155-169 [Journal] - Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
**Partitioning complete multipartite graphs by monochromatic trees.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:48, n:2, pp:133-141 [Journal] - Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura
**A degree condition for the existence of 1-factors in graphs or their complements.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:203, n:1-3, pp:1-8 [Journal] - Kiyoshi Ando, Atsushi Kaneko
**A remark on the connectivity of the complement of a 3-connected graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:151, n:1-3, pp:39-47 [Journal] **Contractible edges in minimally k-connected graphs.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |