Mikio Kano - RankMe

124 papers C 1Misc 1Journal 99Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Factors of bipartite graphs with degree conditions imposed on each partite set. Discret. Appl. Math. Michitaka Furuya, Mikio Kano
2026	J	`jnl`	Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees. Discret. Math. Shinya Fujita, Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Kiyoshi Yoshimoto
2025	J	`jnl`	Odd-Even Factors of Graphs. Graphs Comb. Mikio Kano, Hajime Matsumura
2025	J	`jnl`	Spanning Path-Cycle Systems with Given End-Vertices in Regular Graphs. Graphs Comb. Yoshimi Egawa, Mikio Kano, Kenta Ozeki
2024	J	`jnl`	Degree Factors with Red-Blue Coloring of Regular Graphs. Electron. J. Comb. Michitaka Furuya, Mikio Kano
2023	J	`jnl`	Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs. Graphs Comb. Michitaka Furuya, Mikio Kano
2022	J	`jnl`	Factors of bi-regular bipartite graphs. Discret. Appl. Math. Yoshimi Egawa, Michitaka Furuya, Mikio Kano
2021	J	`jnl`	Discrete Geometry on Colored Point Sets in the Plane - A Survey. Graphs Comb. Mikio Kano, Jorge Urrutia
2021	J	`jnl`	Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs. Graphs Comb. Mikio Kano, Masao Tsugaki
2021	J	`jnl`	Rainbow polygons for colored point sets in the plane. Discret. Math. David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber
2020	J	`jnl`	Characterization of 1-tough graphs using factors. Discret. Math. Hongliang Lu, Mikio Kano
2020	J	`jnl`	Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima
2020	J	`jnl`	Existence of all generalized fractional (g, f)-factors of graphs. Discret. Appl. Math. Yoshimi Egawa, Mikio Kano, Maho Yokota
2020	J	`jnl`	Properly colored spanning trees in edge-colored graphs. Discret. Math. Yangyang Cheng, Mikio Kano, Guanghui Wang
2020	J	`jnl`	Rainbow polygons for colored point sets in the plane. CoRR David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber
2020	J	`jnl`	Spanning trees with small diameters. AKCE Int. J. Graphs Comb. Mikio Kano, Hajime Matsumura
2020	J	`jnl`	Strong Tutte type conditions and factors of graphs. Discuss. Math. Graph Theory Mikio Kano, Zheng Yan
2019	J	`jnl`	Characterizations of graphs G having all [1, k]-factors in kG. Discret. Math. Hongliang Lu, Mikio Kano, Qinglin Yu
2019	J	`jnl`	Connected odd factors of graphs. Australas. J Comb. Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki
2019	J	`jnl`	Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs. Electron. J. Comb. Roger Yu, Mikio Kano, Hongliang Lu
2019	J	`jnl`	K Discret. Math. Theor. Comput. Sci. Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel
2018	J	`jnl`	Decomposition of a Graph into Two Disjoint Odd Subgraphs. Graphs Comb. Mikio Kano, Gyula Y. Katona, Kitti Varga
2018	J	`jnl`	Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets. CoRR Mikio Kano, Kenta Noguchi, David Orden
2018	J	`jnl`	The hamburger theorem. Comput. Geom. Mikio Kano, Jan Kyncl
2018	J	`jnl`	Weight-Equitable Subdivision of Red and Blue Points in the Plane. Int. J. Comput. Geom. Appl. Jude Buot, Mikio Kano
2017	J	`jnl`	$K_{1, 3}$-covering red and blue points in the plane. CoRR Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel
2017	J	`jnl`	Balanced partitions of 3-colored geometric sets in the plane. CoRR Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek
2017	J	`jnl`	Balancing Colored Points on a Line by Exchanging Intervals. J. Inf. Process. Atsushi Kaneko, Mikio Kano, Mamoru Watanabe
2016	J	`jnl`	(1, f)-Factors of Graphs with Odd Property. Graphs Comb. Yoshimi Egawa, Mikio Kano, Zheng Yan
2016	J	`jnl`	0-Sum and 1-Sum Flows in Regular Graphs. Electron. J. Comb. Saieed Akbari, Mikio Kano, Sanaz Zare
2016	J	`jnl`	Generalizations of Marriage Theorem for Degree Factors. Graphs Comb. Radoslaw Cymer, Mikio Kano
2016	J	`jnl`	Spanning trees with bounded degrees and leaves. Discret. Math. Mikio Kano, Zheng Yan
2016	J	`jnl`	m-dominating k-trees of graphs. Discret. Math. Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan
2015	J	`jnl`	Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek
2015	J	`jnl`	Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita
2015	J	`jnl`	Spanning Trees Whose Stems are Spiders. Graphs Comb. Mikio Kano, Zheng Yan
2014	J	`jnl`	Spanning trees whose stems have at most k leaves. Ars Comb. Mikio Kano, Zheng Yan
2014	J	`jnl`	Star-cycle factors of graphs. Discuss. Math. Graph Theory Yoshimi Egawa, Mikio Kano, Zheng Yan
2014	J	`jnl`	m-dominating k-ended trees of graphs. Discret. Math. Mikio Kano, Masao Tsugaki, Guiying Yan
2014	J	`jnl`	{k, r - k}-Factors of r-Regular Graphs. Graphs Comb. Saieed Akbari, Mikio Kano
2013	J	`jnl`	A Note on Leaf-constrained Spanning Trees in a Graph. Ars Comb. Mikio Kano, Aung Kyaw
2013	—	`ed.`	Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers TJJCCGG Jin Akiyama, Mikio Kano, Toshinori Sakai
2013	—	`conf`	Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane. JCDCGG Mikio Kano, Kazuhiro Suzuki, Miyuki Uno
2013	J	`jnl`	Spanning Discret. Math. Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan
2012	J	`jnl`	Balanced Line for a 3-Colored Point Set in the Plane. Electron. J. Comb. Sergey Bereg, Mikio Kano
2012	—	`conf`	Spanning Caterpillars Having at Most k Leaves. TJJCCGG Mikio Kano, Tomoki Yamashita, Zheng Yan
2012	J	`jnl`	Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita
2012	J	`jnl`	Star-factors with large components. Discret. Math. Mikio Kano, Akira Saito
2012	J	`jnl`	The Chromatic Index of a Graph Whose Core has Maximum Degree 2. Electron. J. Comb. Mikio Kano, Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr
2011	—	`ed.`	Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers CGGA Jin Akiyama, Bo Jiang, Mikio Kano, Xuehou Tan
2011	—	`conf`	Geometric Graphs in the Plane Lattice. EGC Mikio Kano, Kazuhiro Suzuki
2011	J	`jnl`	Spanning Graphs Comb. Mikio Kano, Hiroo Kishimoto
2010	J	`jnl`	Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane. Int. J. Comput. Geom. Appl. Mikio Kano, Miyuki Uno
2010	J	`jnl`	Component factors with large components in graphs. Appl. Math. Lett. Mikio Kano, Hongliang Lu, Qinglin Yu
2010	J	`jnl`	Star-Uniform Graphs. Graphs Comb. Mikio Kano, Yunjian Wu, Qinglin Yu
2009	J	`jnl`	Bisections of Two Sets of Points in the Plane Lattice. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Miyuki Uno, Tomoharu Kawano, Mikio Kano
2009	J	`jnl`	Compatible geometric matchings. Comput. Geom. 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
2009	J	`jnl`	Elementary Graphs with Respect to Graphs Comb. Mikio Kano, Gyula Y. Katona, Jácint Szabó
2009	J	`jnl`	Matching Points with Squares. Discret. Comput. Geom. Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
2008	J	`jnl`	Compatible Geometric Matchings. Electron. Notes Discret. Math. 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
2008	—	`ed.`	Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers KyotoCGGT Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno
2008	J	`jnl`	Encompassing colored planar straight line graphs. Comput. Geom. Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
2008	J	`jnl`	Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Graphs Comb. Mikio Kano, Xueliang Li
2008	J	`jnl`	Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory Mikio Kano, Changwoo Lee, Kazuhiro Suzuki
2008	Misc	`conf`	Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images. ICISC Miyuki Uno, Mikio Kano
2007	—	`ed.`	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 CJCDGCGT Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu
2007	J	`jnl`	Jin Akiyama: A Friend and His Mathematics. Graphs Comb. Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia
2007	J	`jnl`	Spanning trees with leaf distance at least four. J. Graph Theory Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
2007	J	`jnl`	Structure theorem and algorithm on (1, f)-odd subgraph. Discret. Math. Mikio Kano, Gyula Y. Katona
2007	C	`conf`	Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images. ISPEC Miyuki Uno, Mikio Kano
2006	J	`jnl`	Editorial. Comput. Geom. Jin Akiyama, Mikio Kano, Xuehou Tan
2006	J	`jnl`	Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei
2005	—	`conf`	A Neighborhood Condition for Graphs to Have [ CJCDGCGT Mikio Kano, Haruhide Matsuda
2005	—	`ed.`	Combinatorial Geometry and Graph Theory, Indonesia-Japan Joint Conference,IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers IJCCGGT Jin Akiyama, Edy Tri Baskoro, Mikio Kano
2005	—	`ed.`	Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers JCDCG Jin Akiyama, Mikio Kano, Xuehou Tan
2005	—	`conf`	General Balanced Subdivision of Two Sets of Points in the Plane. CJCDGCGT Mikio Kano, Miyuki Uno
2005	J	`jnl`	On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. Mikio Kano, Criel Merino, Jorge Urrutia
2005	J	`jnl`	Pan-Factorial Property in Regular Graphs. Electron. J. Comb. Mikio Kano, Qinglin Yu
2005	J	`jnl`	Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
2005	J	`jnl`	Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geom. Appl. Atsushi Kaneko, Mikio Kano
2004	—	`conf`	Encompassing colored crossing-free geometric graphs. CCCG Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth
2004	—	`conf`	Matching Points with Circles and Squares. JCDCG Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia
2004	J	`jnl`	Packing paths of length at least two. Discret. Math. Mikio Kano, Gyula Y. Katona, Zoltán Király
2003	—	`conf`	A Balanced Interval of Two Sets of Points on a Line. IJCCGGT Atsushi Kaneko, Mikio Kano
2003	J	`jnl`	Cycles having the same modularity and removable edges in 2-connected graphs. Discret. Math. Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito
2003	—	`ed.`	Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers JCDCG Jin Akiyama, Mikio Kano
2002	J	`jnl`	Odd subgraphs and matchings. Discret. Math. Mikio Kano, Gyula Y. Katona
2002	J	`jnl`	Perfect Partitions of Convex Sets in the Plane. Discret. Comput. Geom. Atsushi Kaneko, Mikio Kano
2001	—	`ed.`	Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers JCDCG Jin Akiyama, Mikio Kano, Masatsugu Urabe
2001	J	`jnl`	Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. Graphs Comb. Mikio Kano, Haruhide Matsuda
2000	J	`jnl`	Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
2000	—	`ed.`	Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers JCDCG Jin Akiyama, Mikio Kano, Masatsugu Urabe
2000	—	`conf`	Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG Atsushi Kaneko, Mikio Kano
2000	—	`conf`	On Paths in a Complete Bipartite Geometric Graph. JCDCG Atsushi Kaneko, Mikio Kano
2000	J	`jnl`	Straight line embeddings of rooted star forests in the plane. Discret. Appl. Math. Atsushi Kaneko, Mikio Kano
1999	J	`jnl`	A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electron. J. Comb. Mao-cheng Cai, Yanjun Li, Mikio Kano
1999	J	`jnl`	Balanced partitions of two sets of points in the plane. Comput. Geom. Atsushi Kaneko, Mikio Kano
1999	J	`jnl`	Straight-Line Embeddings of Two Rooted Trees in the Plane. Discret. Comput. Geom. Atsushi Kaneko, Mikio Kano
1998	—	`conf`	Balanced partitions of two sets of points in the plane. CCCG Atsushi Kaneko, Mikio Kano
1998	—	`conf`	Radial Perfect Partitions of Convex Sets in the Plane. JCDCG Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia
1998	—	`conf`	Straight-line embeddings of three rooted trees in the plane. CCCG Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga
1997	—	`conf`	A straight-line embedding of two or more rooted trees in the plane. CCCG Mikio Kano
1997	J	`jnl`	Star partitions of graphs. J. Graph Theory Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans
1996	J	`jnl`	Edge-removing games of star type. Discret. Math. Mikio Kano
1996	J	`jnl`	Sufficient conditions for graphs to have (g, f)-factors. Discret. Math. Yoshimi Egawa, Mikio Kano
1995	J	`jnl`	Disjoint odd integer subsets having a constant even sum. Discret. Math. Hikoe Enomoto, Mikio Kano
1992	J	`jnl`	Binding numbers and J. Comb. Theory B Mikio Kano, Norihide Tokushige
1990	J	`jnl`	A sufficient condition for a graph to have [ Graphs Comb. Mikio Kano
1990	J	`jnl`	Disjoint subsets of integers having a constant sum. Discret. Math. Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano
1990	J	`jnl`	Graphs with the balas - uhry property. J. Graph Theory Mikio Kano, Svatopluk Poljak
1990	J	`jnl`	Spanning trees fixed by automorphisms of a graph. Discret. Math. Mikio Kano, Akio Sakamoto
1990	J	`jnl`	Sufficient conditions for a graph to have factors. Discret. Math. Mikio Kano
1988	J	`jnl`	A sufficient condition for a bipartite graph to have a J. Graph Theory Hikoe Enomoto, Katsuhiro Ota, Mikio Kano
1988	J	`jnl`	Some results on odd factors of graphs. J. Graph Theory Cui Yuting, Mikio Kano
1987	J	`jnl`	Maximum and k-th maximal spanning trees of a weighted graph. Comb. Mikio Kano
1987	J	`jnl`	Ranking the vertices of an r-partite paired comparison digraph. Discret. Appl. Math. Mikio Kano
1986	J	`jnl`	Factors of regular graphs. J. Comb. Theory B Mikio Kano
1985	J	`jnl`	Almost-regular factorization of graphs. J. Graph Theory Jin Akiyama, Mikio Kano
1985	J	`jnl`	Factors and factorizations of graphs - a survey. J. Graph Theory Jin Akiyama, Mikio Kano
1985	J	`jnl`	[ J. Graph Theory Mikio Kano
1983	J	`jnl`	Cycle games and cycle cut games. Comb. Mikio Kano
1983	J	`jnl`	Ranking the vertices of a weighted digraph using the length of forward arcs. Networks Mikio Kano, Akio Sakamoto
1983	J	`jnl`	[a, b]-factors of graphs. Discret. Math. Mikio Kano, Akira Saito
1982	J	`jnl`	On factors with given components. Discret. Math. Atsushi Amahashi, Mikio Kano