Mikio Kano

VLDB 2026 Research / reviewers in the wild / expert

dblp:k/MikioKano · DBLP profile ↗

← Back

17ranked-venue papers

4as first author

2since 2021 · last 2026

0000-0002-7545-0327ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 8 · 1 first-authorTheory of computation · 7 · 2 first-author · 2 since 2021Computer networks · 1 · 1 first-authorSecurity and privacy · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

Year	Publication	Venue	Position
2026	Factors of bipartite graphs with degree conditions imposed on each partite set Michitaka Furuya, Mikio Kano	Discret. Appl. Math.	2
2022	Factors of bi-regular bipartite graphs Yoshimi Egawa, Michitaka Furuya, Mikio Kano	Discret. Appl. Math.	3
2020	Existence of all generalized fractional (g, f)-factors of graphs Yoshimi Egawa, Mikio Kano, Maho Yokota	Discret. Appl. Math.	2
2018	The hamburger theorem Mikio Kano, Jan Kyncl	Comput. Geom.	1
2015	Balanced partitions of 3-colored geometric sets in the plane Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek	Discret. Appl. Math.	3
2009	Compatible geometric matchings Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García 0002, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez 0001, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood	Comput. Geom.	7
2009	Matching Points with Squares Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia	Discret. Comput. Geom.	5
2008	Encompassing colored planar straight line graphs Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth	Comput. Geom.	2
2007	Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images Miyuki Uno, Mikio Kano	ISPEC	2
2006	Editorial Jin Akiyama, Mikio Kano, Xuehou Tan	Comput. Geom.	2
2005	On plane spanning trees and cycles of multicolored point sets with few intersections Mikio Kano, Criel Merino, Jorge Urrutia	Inf. Process. Lett.	1
2002	Perfect Partitions of Convex Sets in the Plane Atsushi Kaneko, Mikio Kano	Discret. Comput. Geom.	2
2000	Straight line embeddings of rooted star forests in the plane Atsushi Kaneko, Mikio Kano	Discret. Appl. Math.	2
1999	Balanced partitions of two sets of points in the plane Atsushi Kaneko, Mikio Kano	Comput. Geom.	2
1999	Straight-Line Embeddings of Two Rooted Trees in the Plane Atsushi Kaneko, Mikio Kano	Discret. Comput. Geom.	2
1987	Ranking the vertices of an r-partite paired comparison digraph Mikio Kano	Discret. Appl. Math.	1
1983	Ranking the vertices of a weighted digraph using the length of forward arcs abstract Abstract Let D = (V, A ) be a weighted digraph with vertex set V and arc set A , and let α be a one‐to‐one mapping from V onto the set of integers {1, 2, …, \| V \|}. A mapping α is called a ranking of D . According to a ranking α, the arc set A is naturally partitioned into the set of forward arcs of α and that of backward ones. By using these subsets of rankings, we define three kinds of optimal rankings: forward optimal rankings, backward optimal rankings, and mutual optimal rankings. Since many results on the backward optimal rankings are already known, we mainly discuss the properties of the forward optimal rankings and the mutual ones in the present article. Mikio Kano, Akio Sakamoto	Networks	1