Mikio Kano - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Spanning ::::k::::-Trees of ::::n::::-Connected GraphsMikio Kano, Hiroo Kishimoto. gc, 27(3):413-418, 2011. [doi]

2010

Balanced Subdivisions with Boundary Condition of Two Sets of Points in the PlaneMikio Kano, Miyuki Uno. ijcga, 20(5):527-541, 2010. [doi]

Star-Uniform GraphsMikio Kano, Yunjian Wu, Qinglin Yu. gc, 26(3):383-394, 2010. [doi]

2009

Compatible geometric matchingsOswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood. comgeo, 42(6-7):617-626, 2009. [doi]

Elementary Graphs with Respect to ::::f::::-Parity FactorsMikio Kano, Gyula Y. Katona, Jácint Szabó. gc, 25(5):717-726, 2009. [doi]

Bisections of Two Sets of Points in the Plane LatticeMiyuki Uno, Tomoharu Kawano, Mikio Kano. ieicet, 92-A(2):502-507, 2009. [doi]

Matching Points with SquaresBernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia. dcg, 41(1):77-95, 2009. [doi]

2008

Compatible Geometric MatchingsOswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood. endm, 31:201-206, 2008. [doi]

Encompassing colored planar straight line graphsFerran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth. comgeo, 39(1):14-23, 2008. [doi]

Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected PapersHiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno, editors, Volume 4535 of Lecture Notes in Computer Science, Springer, 2008. [doi]

Path and cycle factors of cubic bipartite graphsMikio Kano, Changwoo Lee, Kazuhiro Suzuki. dmgt, 28(3):551-556, 2008. [doi]

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A SurveyMikio Kano, Xueliang Li. gc, 24(4):237-263, 2008. [doi]

Visual Secret Sharing Schemes with Cyclic Access Structure for Many ImagesMiyuki Uno, Mikio Kano. icisc 2009: 84-97 [doi]

2007

Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi an, China, November 22-24, 2005, Revised Selected PapersJin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu, editors, Volume 4381 of Lecture Notes in Computer Science, Springer, 2007.

Spanning trees with leaf distance at least fourAtsushi Kaneko, Mikio Kano, Kazuhiro Suzuki. jgt, 55(1):83-90, 2007. [doi]

Structure theorem and algorithm on (1, f)-odd subgraphMikio Kano, Gyula Y. Katona. DM, 307(11-12):1404-1417, 2007. [doi]

2006

EditorialJin Akiyama, Mikio Kano, Xuehou Tan. comgeo, 34(1):1, 2006. [doi]

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and treesZemin Jin, Mikio Kano, Xueliang Li, Bing Wei. jco, 11(4):445-454, 2006. [doi]

2005

Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected PapersJin Akiyama, Mikio Kano, Xuehou Tan, editors, Volume 3742 of Lecture Notes in Computer Science, Springer, 2005.

Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected PapersJin Akiyama, Edy Tri Baskoro, Mikio Kano, editors, Volume 3330 of Lecture Notes in Computer Science, Springer, 2005.

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted ForestsAtsushi Kaneko, Mikio Kano. ijcga, 15(3):229-238, 2005. [doi]

Partitioning complete multipartite graphs by monochromatic treesAtsushi Kaneko, Mikio Kano, Kazuhiro Suzuki. jgt, 48(2):133-141, 2005. [doi]

On plane spanning trees and cycles of multicolored point sets with few intersectionsMikio Kano, Criel Merino, Jorge Urrutia. ipl, 93(6):301-306, 2005. [doi]

2004

2003

Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised PapersJin Akiyama, Mikio Kano, editors, Volume 2866 of Lecture Notes in Computer Science, Springer, 2003.

Cycles having the same modularity and removable edges in 2-connected graphsKiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito. DM, 265(1-3):23-30, 2003. [doi]

A Balanced Interval of Two Sets of Points on a LineAtsushi Kaneko, Mikio Kano. jcdcg 2005: 108-112 [doi]

2002

Odd subgraphs and matchingsMikio Kano, Gyula Y. Katona. DM, 250(1-3):265-272, 2002. [doi]

2001

Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised PapersJin Akiyama, Mikio Kano, Masatsugu Urabe, editors, Volume 2098 of Lecture Notes in Computer Science, Springer, 2001.

2000

Discrete and Computational Geometry, Japanese Conference, JCDCG 98, Tokyo, Japan, December 9-12, 1998, Revised PapersJin Akiyama, Mikio Kano, Masatsugu Urabe, editors, Volume 1763 of Lecture Notes in Computer Science, Springer, 2000.

Alternating Hamilton Cycles with Minimum Number of Crossings in the PlaneAtsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto. ijcga, 10(1):73-78, 2000.

Straight line embeddings of rooted star forests in the planeAtsushi Kaneko, Mikio Kano. DAM, 101(1-3):167-175, 2000.

Generalized Balanced Partitions of Two Sets of Points in the PlaneAtsushi Kaneko, Mikio Kano. jcdcg 2001: 176-186 [doi]

On Paths in a Complete Bipartite Geometric GraphAtsushi Kaneko, Mikio Kano. jcdcg 2001: 187-191 [doi]

1999

A [k, k+1]-Factor Containing A Given Hamiltonian CycleMao-cheng Cai, Yanjun Li, Mikio Kano. combinatorics, 6, 1999. [doi]

Straight-Line Embeddings of Two Rooted Trees in the PlaneAtsushi Kaneko, Mikio Kano. dcg, 21(4):603-613, 1999. [doi]

Balanced partitions of two sets of points in the planeAtsushi Kaneko, Mikio Kano. comgeo, 13(4):253-261, 1999.

1998

1996

Sufficient conditions for graphs to have (g, f)-factorsYoshimi Egawa, Mikio Kano. DM, 151(1-3):87-90, 1996. [doi]

Edge-removing games of star typeMikio Kano. DM, 151(1-3):113-119, 1996. [doi]

1995

Disjoint odd integer subsets having a constant even sumHikoe Enomoto, Mikio Kano. DM, 137(1-3):189-193, 1995. [doi]

1992

Binding numbers and ::::f::::-factors of graphsMikio Kano, Norihide Tokushige. JCT, 54(2):213-221, 1992. [doi]

1990

Disjoint subsets of integers having a constant sumKiyoshi Ando, Severino V. Gervacio, Mikio Kano. DM, 82(1):7-11, 1990. [doi]

Sufficient conditions for a graph to have factorsMikio Kano. DM, 80(2):159-165, 1990. [doi]

1987

Maximum and k-th maximal spanning trees of a weighted graphMikio Kano. combinatorica, 7(2):205-214, 1987.

1986

Factors of regular graphsMikio Kano. JCT, 41(1):27-36, 1986. [doi]

1983

Cycle games and cycle cut gamesMikio Kano. combinatorica, 3(2):201-206, 1983.

[a, b]-factors of graphsMikio Kano, Akira Saito. DM, 47:113-116, 1983. [doi]

1982

On factors with given componentsAtsushi Amahashi, Mikio Kano. DM, 42(1):1-6, 1982. [doi]