![]() | ![]() |
M. Kano
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
51 | EE | 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) |
2008 | ||
50 | EE | Miyuki Uno, Mikio Kano: Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images. ICISC 2008: 84-97 |
49 | EE | Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008) |
48 | EE | Oswin 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: Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics 31: 201-206 (2008) |
2007 | ||
47 | Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu: 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 Springer 2007 | |
46 | EE | Miyuki Uno, M. Kano: Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images. ISPEC 2007: 344-359 |
45 | EE | Mikio Kano, Gyula Y. Katona: Structure theorem and algorithm on (1, f)-odd subgraph. Discrete Mathematics 307(11-12): 1404-1417 (2007) |
44 | EE | Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki: Spanning trees with leaf distance at least four. Journal of Graph Theory 55(1): 83-90 (2007) |
2006 | ||
43 | EE | Jin Akiyama, Mikio Kano, Xuehou Tan: Editorial. Comput. Geom. 34(1): 1 (2006) |
42 | EE | 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) |
2005 | ||
41 | Jin Akiyama, Edy Tri Baskoro, Mikio Kano: Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers Springer 2005 | |
40 | Jin Akiyama, Mikio Kano, Xuehou Tan: Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers Springer 2005 | |
39 | EE | M. Kano, Haruhide Matsuda: A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. CJCDGCGT 2005: 70-78 |
38 | EE | M. Kano, Miyuki Uno: General Balanced Subdivision of Two Sets of Points in the Plane. CJCDGCGT 2005: 79-87 |
37 | EE | M. Kano, Qinglin Yu: Pan-Factorial Property in Regular Graphs. Electr. J. Comb. 12: (2005) |
36 | EE | 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) |
35 | EE | 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) |
34 | EE | Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki: Partitioning complete multipartite graphs by monochromatic trees. Journal of Graph Theory 48(2): 133-141 (2005) |
2004 | ||
33 | EE | Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth: Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52 |
32 | EE | 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 |
31 | EE | Mikio Kano, Gyula Y. Katona, Zoltán Király: Packing paths of length at least two. Discrete Mathematics 283(1-3): 129-135 (2004) |
2003 | ||
30 | Jin Akiyama, Mikio Kano: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers Springer 2003 | |
29 | EE | Atsushi Kaneko, Mikio Kano: A Balanced Interval of Two Sets of Points on a Line. IJCCGGT 2003: 108-112 |
28 | EE | 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) |
2002 | ||
27 | EE | Mikio Kano, Gyula Y. Katona: Odd subgraphs and matchings. Discrete Mathematics 250(1-3): 265-272 (2002) |
2001 | ||
26 | Jin Akiyama, Mikio Kano, Masatsugu Urabe: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers Springer 2001 | |
25 | EE | M. Kano, Haruhide Matsuda: Partial Parity (g, ?f )-Factors and Subgraphs Covering Given Vertex Subsets. Graphs and Combinatorics 17(3): 501-509 (2001) |
2000 | ||
24 | Jin Akiyama, Mikio Kano, Masatsugu Urabe: Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers Springer 2000 | |
23 | EE | Atsushi Kaneko, Mikio Kano: Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG 2000: 176-186 |
22 | EE | Atsushi Kaneko, Mikio Kano: On Paths in a Complete Bipartite Geometric Graph. JCDCG 2000: 187-191 |
21 | Atsushi Kaneko, Mikio Kano: Straight line embeddings of rooted star forests in the plane. Discrete Applied Mathematics 101(1-3): 167-175 (2000) | |
20 | 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) | |
1999 | ||
19 | Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999) | |
18 | EE | Atsushi Kaneko, Mikio Kano: Straight-Line Embeddings of Two Rooted Trees in the Plane. Discrete & Computational Geometry 21(4): 603-613 (1999) |
17 | EE | Mao-cheng Cai, Yanjun Li, Mikio Kano: A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electr. J. Comb. 6: (1999) |
1998 | ||
16 | EE | Atsushi Kaneko, Mikio Kano: Balanced partitions of two sets of points in the plane. CCCG 1998 |
15 | EE | Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga: Straight-line embeddings of three rooted trees in the plane. CCCG 1998 |
14 | 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 | |
1997 | ||
13 | M. Kano: A straight-line embedding of two or more rooted trees in the plane. CCCG 1997 | |
1996 | ||
12 | EE | Mikio Kano: Edge-removing games of star type. Discrete Mathematics 151(1-3): 113-119 (1996) |
11 | EE | Yoshimi Egawa, Mikio Kano: Sufficient conditions for graphs to have (g, f)-factors. Discrete Mathematics 151(1-3): 87-90 (1996) |
1995 | ||
10 | EE | Hikoe Enomoto, Mikio Kano: Disjoint odd integer subsets having a constant even sum. Discrete Mathematics 137(1-3): 189-193 (1995) |
1992 | ||
9 | EE | Mikio Kano, Norihide Tokushige: Binding numbers and f-factors of graphs. J. Comb. Theory, Ser. B 54(2): 213-221 (1992) |
1990 | ||
8 | EE | Mikio Kano: Sufficient conditions for a graph to have factors. Discrete Mathematics 80(2): 159-165 (1990) |
7 | EE | Kiyoshi Ando, Severino V. Gervacio, Mikio Kano: Disjoint subsets of integers having a constant sum. Discrete Mathematics 82(1): 7-11 (1990) |
6 | EE | M. Kano, A. Sakamoto: Spanning trees fixed by automorphisms of a graph. Discrete Mathematics 82(2): 219-222 (1990) |
1987 | ||
5 | Mikio Kano: Maximum and k-th maximal spanning trees of a weighted graph. Combinatorica 7(2): 205-214 (1987) | |
1986 | ||
4 | EE | Mikio Kano: Factors of regular graphs. J. Comb. Theory, Ser. B 41(1): 27-36 (1986) |
1983 | ||
3 | Mikio Kano: Cycle games and cycle cut games. Combinatorica 3(2): 201-206 (1983) | |
2 | EE | Mikio Kano, Akira Saito: [a, b]-factors of graphs. Discrete Mathematics 47: 113-116 (1983) |
1982 | ||
1 | EE | Atsushi Amahashi, Mikio Kano: On factors with given components. Discrete Mathematics 42(1): 1-6 (1982) |