Mikio Kano

Mikio Kano, Aung Kyaw: A Note on Leaf-constrained Spanning Trees in a Graph. Ars Comb. 108: 321-326 (2013)

Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita: Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103: 137-154 (2012)

Mikio Kano, Akira Saito: Star-factors with large components. Discrete Mathematics 312(12-13): 2005-2008 (2012)

Mikio Kano, Hiroo Kishimoto: Spanning k-Trees of n-Connected Graphs. Graphs and Combinatorics 27(3): 413-418 (2011)

Jin Akiyama, Jiang Bo, Mikio Kano, Xuehou Tan (Eds.): Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers. Lecture Notes in Computer Science 7033, Springer 2011, isbn 978-3-642-24982-2

M. Kano, Hongliang Lu, Qinglin Yu: Component factors with large components in graphs. Appl. Math. Lett. 23(4): 385-389 (2010)

Mikio Kano, Yunjian Wu, Qinglin Yu: Star-Uniform Graphs. Graphs and Combinatorics 26(3): 383-394 (2010)

Mikio Kano, Miyuki Uno: Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane. Int. J. Comput. Geometry Appl. 20(5): 527-541 (2010)

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

Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia: Matching Points with Squares. Discrete & Computational Geometry 41(1): 77-95 (2009)

Mikio Kano, Gyula Y. Katona, Jácint Szabó: Elementary Graphs with Respect to f-Parity Factors. Graphs and Combinatorics 25(5): 717-726 (2009)

Miyuki Uno, Tomoharu Kawano, Mikio Kano: Bisections of Two Sets of Points in the Plane Lattice. IEICE Transactions 92-A(2): 502-507 (2009)

S. Fukudo, M. KaManabuzawa, T. Mizuno, T. Hamaguchi, M. Kano, S. Watanabe, Y. Sagami, T. Shoji, Y. Endo, M. Hongo, Y. Itoyama, Kazuhiko Yanai, Manabu Tashiro, M. Aoki: Impact of serotonin transporter gene polymorphism on brain activation by colorectal distention. NeuroImage 47(3): 946-951 (2009)

Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008)

Mikio Kano, Changwoo Lee, Kazuhiro Suzuki: Path and cycle factors of cubic bipartite graphs. Discussiones Mathematicae Graph Theory 28(3): 551-556 (2008)

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics 31: 201-206 (2008)

Mikio Kano, Xueliang Li: Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Graphs and Combinatorics 24(4): 237-263 (2008)

Miyuki Uno, Mikio Kano: Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images. ICISC 2008: 84-97

Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno (Eds.): Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers. Lecture Notes in Computer Science 4535, Springer 2008, isbn 978-3-540-89549-7

Mikio Kano, Gyula Y. Katona: Structure theorem and algorithm on (1, f)-odd subgraph. Discrete Mathematics 307(11-12): 1404-1417 (2007)

Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki: Spanning trees with leaf distance at least four. Journal of Graph Theory 55(1): 83-90 (2007)

Miyuki Uno, M. Kano: Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images. ISPEC 2007: 344-359

Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu (Eds.): 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 Papers. Lecture Notes in Computer Science 4381, Springer 2007, isbn 978-3-540-70665-6

Jin Akiyama, Mikio Kano, Xuehou Tan: Editorial. Comput. Geom. 34(1): 1 (2006)

Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei: Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11(4): 445-454 (2006)

M. Kano, Qinglin Yu: Pan-Factorial Property in Regular Graphs. Electr. J. Comb. 12 (2005)

Atsushi Kaneko, Mikio Kano: Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geometry Appl. 15(3): 229-238 (2005)

Mikio Kano, Criel Merino, Jorge Urrutia: On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93(6): 301-306 (2005)

Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki: Partitioning complete multipartite graphs by monochromatic trees. Journal of Graph Theory 48(2): 133-141 (2005)

M. Kano, Haruhide Matsuda: A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. CJCDGCGT 2005: 70-78

M. Kano, Miyuki Uno: General Balanced Subdivision of Two Sets of Points in the Plane. CJCDGCGT 2005: 79-87

Jin Akiyama, Edy Tri Baskoro, Mikio Kano (Eds.): Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3330, Springer 2005, isbn 3-540-24401-8

Jin Akiyama, Mikio Kano, Xuehou Tan (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, isbn 3-540-30467-3

Mikio Kano, Gyula Y. Katona, Zoltán Király: Packing paths of length at least two. Discrete Mathematics 283(1-3): 129-135 (2004)

Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52

Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia: Matching Points with Circles and Squares. JCDCG 2004: 1-15

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. Discrete Mathematics 265(1-3): 23-30 (2003)

Atsushi Kaneko, Mikio Kano: A Balanced Interval of Two Sets of Points on a Line. IJCCGGT 2003: 108-112

Jin Akiyama, Mikio Kano (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Lecture Notes in Computer Science 2866, Springer 2003, isbn 3-540-20776-7

Mikio Kano, Gyula Y. Katona: Odd subgraphs and matchings. Discrete Mathematics 250(1-3): 265-272 (2002)

M. Kano, Haruhide Matsuda: Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. Graphs and Combinatorics 17(3): 501-509 (2001)

Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers. Lecture Notes in Computer Science 2098, Springer 2001, isbn 3-540-42306-0

Atsushi Kaneko, Mikio Kano: Straight line embeddings of rooted star forests in the plane. Discrete Applied Mathematics 101(1-3): 167-175 (2000)

Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto: Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geometry Appl. 10(1): 73-78 (2000)

Atsushi Kaneko, Mikio Kano: Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG 2000: 176-186

Atsushi Kaneko, Mikio Kano: On Paths in a Complete Bipartite Geometric Graph. JCDCG 2000: 187-191

Jin Akiyama, Mikio Kano, Masatsugu Urabe (Eds.): Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers. Lecture Notes in Computer Science 1763, Springer 2000, isbn 3-540-67181-1

Mao-cheng Cai, Yanjun Li, Mikio Kano: A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electr. J. Comb. 6 (1999)

Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999)

Atsushi Kaneko, Mikio Kano: Straight-Line Embeddings of Two Rooted Trees in the Plane. Discrete & Computational Geometry 21(4): 603-613 (1999)

Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. CCCG 1998

Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga: Straight-line embeddings of three rooted trees in the plane. CCCG 1998

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

Yoshimi Egawa, M. Kano, Alexander K. Kelmans: Star partitions of graphs. Journal of Graph Theory 25(3): 185-190 (1997)

M. Kano: A straight-line embedding of two or more rooted trees in the plane. CCCG 1997

Yoshimi Egawa, Mikio Kano: Sufficient conditions for graphs to have (g, f)-factors. Discrete Mathematics 151(1-3): 87-90 (1996)

Mikio Kano: Edge-removing games of star type. Discrete Mathematics 151(1-3): 113-119 (1996)

Hikoe Enomoto, Mikio Kano: Disjoint odd integer subsets having a constant even sum. Discrete Mathematics 137(1-3): 189-193 (1995)

Mikio Kano, Norihide Tokushige: Binding numbers and f-factors of graphs. J. Comb. Theory, Ser. B 54(2): 213-221 (1992)

Mikio Kano: Sufficient conditions for a graph to have factors. Discrete Mathematics 80(2): 159-165 (1990)

Kiyoshi Ando, Severino V. Gervacio, Mikio Kano: Disjoint subsets of integers having a constant sum. Discrete Mathematics 82(1): 7-11 (1990)

Mikio Kano, Akio Sakamoto: Spanning trees fixed by automorphisms of a graph. Discrete Mathematics 82(2): 219-222 (1990)

Mikio Kano: A sufficient condition for a graph to have [a, b]-factors. Graphs and Combinatorics 6(3): 245-251 (1990)

M. Kano, Svatopluk Poljak: Graphs with the balas - uhry property. Journal of Graph Theory 14(5): 623-628 (1990)

Hikoe Enomoto, Katsuhiro Ota, Mikio Kano: A sufficient condition for a bipartite graph to have a k-factor. Journal of Graph Theory 12(1): 141-151 (1988)

Cui Yuting, Mikio Kano: Some results on odd factors of graphs. Journal of Graph Theory 12(3): 327-333 (1988)

Mikio Kano: Maximum and k-th maximal spanning trees of a weighted graph. Combinatorica 7(2): 205-214 (1987)

Mikio Kano: Factors of regular graphs. J. Comb. Theory, Ser. B 41(1): 27-36 (1986)

Mikio Kano: Cycle games and cycle cut games. Combinatorica 3(2): 201-206 (1983)

Mikio Kano, Akira Saito: [a, b]-factors of graphs. Discrete Mathematics 47: 113-116 (1983)

Mikio Kano, Akio Sakamoto: Ranking the vertices of a weighted digraph using the length of forward arcs. Networks 13(1): 143-151 (1983)

Atsushi Amahashi, Mikio Kano: On factors with given components. Discrete Mathematics 42(1): 1-6 (1982)