The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mikio Kano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
    Encompassing colored crossing-free geometric graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:48-52 [Conf]
  2. Atsushi Kaneko, Mikio Kano
    Balanced partitions of two sets of points in the plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. 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]
  4. 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. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:1-15 [Conf]
  5. 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]
  6. 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]
  7. Atsushi Kaneko, Mikio Kano
    On Paths in a Complete Bipartite Geometric Graph. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:187-191 [Conf]
  8. 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]
  9. Mikio Kano
    Cycle games and cycle cut games. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:2, pp:201-206 [Journal]
  10. Mikio Kano
    Maximum and k-th maximal spanning trees of a weighted graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:205-214 [Journal]
  11. Mao-cheng Cai, Yanjun Li, Mikio Kano
    A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  12. Jin Akiyama, Mikio Kano, Xuehou Tan
    Editorial. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:1- [Journal]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Mikio Kano, Gyula Y. Katona
    Odd subgraphs and matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:265-272 [Journal]
  18. Mikio Kano, Gyula Y. Katona, Zoltán Király
    Packing paths of length at least two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:129-135 [Journal]
  19. Mikio Kano, Gyula Y. Katona
    Structure theorem and algorithm on (1, f)-odd subgraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1404-1417 [Journal]
  20. 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]
  21. 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]
  22. Mikio Kano, Criel Merino, Jorge Urrutia
    On plane spanning trees and cycles of multicolored point sets with few intersections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:6, pp:301-306 [Journal]
  23. Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei
    Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:4, pp:445-454 [Journal]
  24. Mikio Kano
    Factors of regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:27-36 [Journal]
  25. Mikio Kano, Norihide Tokushige
    Binding numbers and f-factors of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:2, pp:213-221 [Journal]
  26. 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]
  27. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
    Encompassing colored planar straight line graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:14-23 [Journal]
  28. Atsushi Amahashi, Mikio Kano
    On factors with given components. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:1-6 [Journal]
  29. Mikio Kano, Akira Saito
    [a, b]-factors of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:113-116 [Journal]
  30. Mikio Kano
    Sufficient conditions for a graph to have factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:159-165 [Journal]
  31. Kiyoshi Ando, Severino V. Gervacio, Mikio Kano
    Disjoint subsets of integers having a constant sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:82, n:1, pp:7-11 [Journal]
  32. Yoshimi Egawa, Mikio Kano
    Sufficient conditions for graphs to have (g, f)-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:87-90 [Journal]
  33. Mikio Kano
    Edge-removing games of star type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:113-119 [Journal]
  34. Hikoe Enomoto, Mikio Kano
    Disjoint odd integer subsets having a constant even sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:189-193 [Journal]

  35. Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images. [Citation Graph (, )][DBLP]


  36. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  37. Matching Points with Squares. [Citation Graph (, )][DBLP]


Search in 0.042secs, Finished in 0.043secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002