( en | de | ru )

 

Disambiguation of "Kano, Mikio"

Author of the publication

copydeleteadd this publication to your clipboard
Balanced partitions of 3-colored geometric sets in the plane.

, , , , , , , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kano Banjau

Mikio Anzai

Mikio Adachi

Eitoku Kano

Suam Choke Kanokvichitra

 

Other publications of authors with the same name

The hamburger theorem., and . Comput. Geom., (2018)On Paths in a Complete Bipartite Geometric Graph., and . JCDCG, volume 2098 of Lecture Notes in Computer Science, page 187-191. Springer, (2000)Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane., , and . JCDCGG, volume 8845 of Lecture Notes in Computer Science, page 96-111. Springer, (2013)Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images., and . ISPEC, volume 4464 of Lecture Notes in Computer Science, page 344-359. Springer, (2007)General Balanced Subdivision of Two Sets of Points in the Plane., and . CJCDGCGT, volume 4381 of Lecture Notes in Computer Science, page 79-87. Springer, (2005)Rainbow polygons for colored point sets in the plane., , , , , , , and . CoRR, (2020)Spanning trees whose stems have at most k leaves., and . Ars Comb., (2014)Sufficient conditions for a graph to have factors.. Discret. Math., 80 (2): 159-165 (1990)Sufficient conditions for graphs to have (g, f)-factors., and . Discret. Math., 151 (1-3): 87-90 (1996)Structure theorem and algorithm on (1, f)-odd subgraph., and . Discret. Math., 307 (11-12): 1404-1417 (2007)