default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikio Kano
Person information
- affiliation: Ibaraki University, Hitachi, Japan
- affiliation: Akashi Technological College, Akashi, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j91]Michitaka Furuya, Mikio Kano:
Degree Factors with Red-Blue Coloring of Regular Graphs. Electron. J. Comb. 31(1) (2024)- 2023
- [j90]Michitaka Furuya, Mikio Kano
:
Factors with Red-Blue Coloring of Claw-Free Graphs and Cubic Graphs. Graphs Comb. 39(4): 85 (2023) - 2022
- [j89]Yoshimi Egawa, Michitaka Furuya, Mikio Kano:
Factors of bi-regular bipartite graphs. Discret. Appl. Math. 322: 268-272 (2022) - 2021
- [j88]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. Discret. Math. 344(7): 112406 (2021) - [j87]Mikio Kano, Jorge Urrutia:
Discrete Geometry on Colored Point Sets in the Plane - A Survey. Graphs Comb. 37(1): 1-53 (2021) - [j86]Mikio Kano, Masao Tsugaki:
Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs. Graphs Comb. 37(5): 1913-1921 (2021) - 2020
- [j85]Mikio Kano, Hajime Matsumura:
Spanning trees with small diameters. AKCE Int. J. Graphs Comb. 17(1): 329-334 (2020) - [j84]Yoshimi Egawa, Mikio Kano, Maho Yokota:
Existence of all generalized fractional (g, f)-factors of graphs. Discret. Appl. Math. 283: 265-271 (2020) - [j83]Yangyang Cheng, Mikio Kano, Guanghui Wang:
Properly colored spanning trees in edge-colored graphs. Discret. Math. 343(1): 111629 (2020) - [j82]Hongliang Lu, Mikio Kano:
Characterization of 1-tough graphs using factors. Discret. Math. 343(8): 111901 (2020) - [j81]Mikio Kano, Shun-ichi Maezawa, Katsuhiro Ota, Masao Tsugaki, Takamasa Yashima:
Color degree sum conditions for properly colored spanning trees in edge-colored graphs. Discret. Math. 343(11): 112042 (2020) - [j80]Mikio Kano, Zheng Yan:
Strong Tutte type conditions and factors of graphs. Discuss. Math. Graph Theory 40(4): 1057-1065 (2020) - [i4]David Flores-Peñaloza, Mikio Kano, Leonardo Martínez-Sandoval, David Orden, Javier Tejel, Csaba D. Tóth, Jorge Urrutia, Birgit Vogtenhuber:
Rainbow polygons for colored point sets in the plane. CoRR abs/2007.10139 (2020)
2010 – 2019
- 2019
- [j79]Nastaran Haghparast, Mikio Kano, Shun-ichi Maezawa, Kenta Ozeki:
Connected odd factors of graphs. Australas. J Comb. 73: 200-206 (2019) - [j78]Roger Yu, Mikio Kano, Hongliang Lu:
Fractional Factors, Component Factors and Isolated Vertex Conditions in Graphs. Electron. J. Comb. 26(4): 4 (2019) - [j77]Hongliang Lu, Mikio Kano, Qinglin Yu:
Characterizations of graphs G having all [1, k]-factors in kG. Discret. Math. 342(12) (2019) - [j76]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
K1,3-covering red and blue points in the plane. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2018
- [j75]Mikio Kano, Jan Kyncl:
The hamburger theorem. Comput. Geom. 68: 167-173 (2018) - [j74]Mikio Kano, Gyula Y. Katona, Kitti Varga:
Decomposition of a Graph into Two Disjoint Odd Subgraphs. Graphs Comb. 34(6): 1581-1588 (2018) - [j73]Jude Buot, Mikio Kano:
Weight-Equitable Subdivision of Red and Blue Points in the Plane. Int. J. Comput. Geom. Appl. 28(1): 39-56 (2018) - [i3]Mikio Kano, Kenta Noguchi, David Orden:
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets. CoRR abs/1812.02866 (2018) - 2017
- [j72]Atsushi Kaneko, Mikio Kano, Mamoru Watanabe:
Balancing Colored Points on a Line by Exchanging Intervals. J. Inf. Process. 25: 551-553 (2017) - [i2]Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
$K_{1, 3}$-covering red and blue points in the plane. CoRR abs/1707.06856 (2017) - [i1]Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. CoRR abs/1708.06062 (2017) - 2016
- [j71]Saieed Akbari, Mikio Kano, Sanaz Zare:
0-Sum and 1-Sum Flows in Regular Graphs. Electron. J. Comb. 23(2): 2 (2016) - [j70]Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan:
m-dominating k-trees of graphs. Discret. Math. 339(2): 729-736 (2016) - [j69]Mikio Kano, Zheng Yan:
Spanning trees with bounded degrees and leaves. Discret. Math. 339(5): 1583-1586 (2016) - [j68]Yoshimi Egawa, Mikio Kano, Zheng Yan:
(1, f)-Factors of Graphs with Odd Property. Graphs Comb. 32(1): 103-110 (2016) - [j67]Radoslaw Cymer, Mikio Kano:
Generalizations of Marriage Theorem for Degree Factors. Graphs Comb. 32(6): 2315-2322 (2016) - 2015
- [j66]Mikio Kano, Kenta Ozeki, Kazuhiro Suzuki, Masao Tsugaki, Tomoki Yamashita:
Spanning $k$-trees of Bipartite Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j65]Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. 181: 21-32 (2015) - [j64]Mikio Kano, Zheng Yan:
Spanning Trees Whose Stems are Spiders. Graphs Comb. 31(6): 1883-1887 (2015) - 2014
- [j63]Mikio Kano, Zheng Yan:
Spanning trees whose stems have at most k leaves. Ars Comb. 117: 417-424 (2014) - [j62]Mikio Kano, Masao Tsugaki, Guiying Yan:
m-dominating k-ended trees of graphs. Discret. Math. 333: 1-5 (2014) - [j61]Yoshimi Egawa, Mikio Kano, Zheng Yan:
Star-cycle factors of graphs. Discuss. Math. Graph Theory 34(1): 193-198 (2014) - [j60]Saieed Akbari, Mikio Kano:
{k, r - k}-Factors of r-Regular Graphs. Graphs Comb. 30(4): 821-826 (2014) - 2013
- [j59]Mikio Kano, Aung Kyaw:
A Note on Leaf-constrained Spanning Trees in a Graph. Ars Comb. 108: 321-326 (2013) - [j58]Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan:
Spanning k-ended trees of bipartite graphs. Discret. Math. 313(24): 2903-2907 (2013) - [c16]Mikio Kano, Kazuhiro Suzuki, Miyuki Uno:
Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane. JCDCGG 2013: 96-111 - [e9]Jin Akiyama, Mikio Kano, Toshinori Sakai:
Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers. Lecture Notes in Computer Science 8296, Springer 2013, ISBN 978-3-642-45280-2 [contents] - 2012
- [j57]Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita:
Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103: 137-154 (2012) - [j56]Sergey Bereg, Mikio Kano:
Balanced Line for a 3-Colored Point Set in the Plane. Electron. J. Comb. 19(1): 33 (2012) - [j55]Mikio Kano, Saieed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr:
The Chromatic Index of a Graph Whose Core has Maximum Degree 2. Electron. J. Comb. 19(1): 58 (2012) - [j54]Mikio Kano, Akira Saito:
Star-factors with large components. Discret. Math. 312(12-13): 2005-2008 (2012) - [c15]Mikio Kano, Tomoki Yamashita, Zheng Yan:
Spanning Caterpillars Having at Most k Leaves. TJJCCGG 2012: 95-100 - 2011
- [j53]Mikio Kano, Hiroo Kishimoto:
Spanning k-Trees of n-Connected Graphs. Graphs Comb. 27(3): 413-418 (2011) - [c14]Mikio Kano, Kazuhiro Suzuki:
Geometric Graphs in the Plane Lattice. EGC 2011: 274-281 - [e8]Jin Akiyama, Bo Jiang, Mikio Kano, Xuehou Tan:
Computational Geometry, Graphs and Applications - 9th International Conference, CGGA 2010, Dalian, China, November 3-6, 2010, Revised Selected Papers. Lecture Notes in Computer Science 7033, Springer 2011, ISBN 978-3-642-24982-2 [contents] - 2010
- [j52]Mikio Kano, Hongliang Lu, Qinglin Yu:
Component factors with large components in graphs. Appl. Math. Lett. 23(4): 385-389 (2010) - [j51]Mikio Kano, Yunjian Wu, Qinglin Yu:
Star-Uniform Graphs. Graphs Comb. 26(3): 383-394 (2010) - [j50]Mikio Kano, Miyuki Uno:
Balanced Subdivisions with Boundary Condition of Two Sets of Points in the Plane. Int. J. Comput. Geom. Appl. 20(5): 527-541 (2010)
2000 – 2009
- 2009
- [j49]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:
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [j48]Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia:
Matching Points with Squares. Discret. Comput. Geom. 41(1): 77-95 (2009) - [j47]Mikio Kano, Gyula Y. Katona, Jácint Szabó:
Elementary Graphs with Respect to f-Parity Factors. Graphs Comb. 25(5): 717-726 (2009) - [j46]Miyuki Uno, Tomoharu Kawano, Mikio Kano:
Bisections of Two Sets of Points in the Plane Lattice. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(2): 502-507 (2009) - 2008
- [j45]Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored planar straight line graphs. Comput. Geom. 39(1): 14-23 (2008) - [j44]Mikio Kano, Changwoo Lee, Kazuhiro Suzuki:
Path and cycle factors of cubic bipartite graphs. Discuss. Math. Graph Theory 28(3): 551-556 (2008) - [j43]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:
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [j42]Mikio Kano, Xueliang Li:
Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Graphs Comb. 24(4): 237-263 (2008) - [c13]Miyuki Uno, Mikio Kano:
Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images. ICISC 2008: 84-97 - [e7]Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno:
Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers. Lecture Notes in Computer Science 4535, Springer 2008, ISBN 978-3-540-89549-7 [contents] - 2007
- [j41]Mikio Kano, Gyula Y. Katona:
Structure theorem and algorithm on (1, f)-odd subgraph. Discret. Math. 307(11-12): 1404-1417 (2007) - [j40]Mikio Kano, Mari-Jo P. Ruiz, Jorge Urrutia:
Jin Akiyama: A Friend and His Mathematics. Graphs Comb. 23(Supplement-1): 1-39 (2007) - [j39]Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
Spanning trees with leaf distance at least four. J. Graph Theory 55(1): 83-90 (2007) - [c12]Miyuki Uno, Mikio Kano:
Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images. ISPEC 2007: 344-359 - [e6]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. Lecture Notes in Computer Science 4381, Springer 2007, ISBN 978-3-540-70665-6 [contents] - 2006
- [j38]Jin Akiyama, Mikio Kano, Xuehou Tan:
Editorial. Comput. Geom. 34(1): 1 (2006) - [j37]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
- [j36]Mikio Kano, Qinglin Yu:
Pan-Factorial Property in Regular Graphs. Electron. J. Comb. 12 (2005) - [j35]Atsushi Kaneko, Mikio Kano:
Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests. Int. J. Comput. Geom. Appl. 15(3): 229-238 (2005) - [j34]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) - [j33]Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48(2): 133-141 (2005) - [c11]Mikio Kano, Haruhide Matsuda:
A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III. CJCDGCGT 2005: 70-78 - [c10]Mikio Kano, Miyuki Uno:
General Balanced Subdivision of Two Sets of Points in the Plane. CJCDGCGT 2005: 79-87 - [e5]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. Lecture Notes in Computer Science 3330, Springer 2005, ISBN 3-540-24401-8 [contents] - [e4]Jin Akiyama, Mikio Kano, Xuehou Tan:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3742, Springer 2005, ISBN 3-540-30467-3 [contents] - 2004
- [j32]Mikio Kano, Gyula Y. Katona, Zoltán Király:
Packing paths of length at least two. Discret. Math. 283(1-3): 129-135 (2004) - [c9]Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored crossing-free geometric graphs. CCCG 2004: 48-52 - [c8]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 - 2003
- [j31]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. Discret. Math. 265(1-3): 23-30 (2003) - [c7]Atsushi Kaneko, Mikio Kano:
A Balanced Interval of Two Sets of Points on a Line. IJCCGGT 2003: 108-112 - [e3]Jin Akiyama, Mikio Kano:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers. Lecture Notes in Computer Science 2866, Springer 2003, ISBN 3-540-20776-7 [contents] - 2002
- [j30]Atsushi Kaneko, Mikio Kano:
Perfect Partitions of Convex Sets in the Plane. Discret. Comput. Geom. 28(2): 211-222 (2002) - [j29]Mikio Kano, Gyula Y. Katona:
Odd subgraphs and matchings. Discret. Math. 250(1-3): 265-272 (2002) - 2001
- [j28]Mikio Kano, Haruhide Matsuda:
Partial Parity (g, f)-Factors and Subgraphs Covering Given Vertex Subsets. Graphs Comb. 17(3): 501-509 (2001) - [e2]Jin Akiyama, Mikio Kano, Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers. Lecture Notes in Computer Science 2098, Springer 2001, ISBN 3-540-42306-0 [contents] - 2000
- [j27]Atsushi Kaneko, Mikio Kano:
Straight line embeddings of rooted star forests in the plane. Discret. Appl. Math. 101(1-3): 167-175 (2000) - [j26]Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto:
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10(1): 73-78 (2000) - [c6]Atsushi Kaneko, Mikio Kano:
Generalized Balanced Partitions of Two Sets of Points in the Plane. JCDCG 2000: 176-186 - [c5]Atsushi Kaneko, Mikio Kano:
On Paths in a Complete Bipartite Geometric Graph. JCDCG 2000: 187-191 - [e1]Jin Akiyama, Mikio Kano, Masatsugu Urabe:
Discrete and Computational Geometry, Japanese Conference, JCDCG'98, Tokyo, Japan, December 9-12, 1998, Revised Papers. Lecture Notes in Computer Science 1763, Springer 2000, ISBN 3-540-67181-1 [contents]
1990 – 1999
- 1999
- [j25]Mao-cheng Cai, Yanjun Li, Mikio Kano:
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electron. J. Comb. 6 (1999) - [j24]Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. Comput. Geom. 13(4): 253-261 (1999) - [j23]Atsushi Kaneko, Mikio Kano:
Straight-Line Embeddings of Two Rooted Trees in the Plane. Discret. Comput. Geom. 21(4): 603-613 (1999) - 1998
- [c4]Atsushi Kaneko, Mikio Kano:
Balanced partitions of two sets of points in the plane. CCCG 1998 - [c3]Atsushi Kaneko, Mikio Kano, Shin-ichi Tokunaga:
Straight-line embeddings of three rooted trees in the plane. CCCG 1998 - [c2]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
- [j22]Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans:
Star partitions of graphs. J. Graph Theory 25(3): 185-190 (1997) - [c1]Mikio Kano:
A straight-line embedding of two or more rooted trees in the plane. CCCG 1997 - 1996
- [j21]Yoshimi Egawa, Mikio Kano:
Sufficient conditions for graphs to have (g, f)-factors. Discret. Math. 151(1-3): 87-90 (1996) - [j20]Mikio Kano:
Edge-removing games of star type. Discret. Math. 151(1-3): 113-119 (1996) - 1995
- [j19]Hikoe Enomoto, Mikio Kano:
Disjoint odd integer subsets having a constant even sum. Discret. Math. 137(1-3): 189-193 (1995) - 1992
- [j18]Mikio Kano, Norihide Tokushige:
Binding numbers and f-factors of graphs. J. Comb. Theory B 54(2): 213-221 (1992) - 1990
- [j17]Mikio Kano:
Sufficient conditions for a graph to have factors. Discret. Math. 80(2): 159-165 (1990) - [j16]Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano:
Disjoint subsets of integers having a constant sum. Discret. Math. 82(1): 7-11 (1990) - [j15]Mikio Kano, Akio Sakamoto:
Spanning trees fixed by automorphisms of a graph. Discret. Math. 82(2): 219-222 (1990) - [j14]Mikio Kano:
A sufficient condition for a graph to have [a, b]-factors. Graphs Comb. 6(3): 245-251 (1990) - [j13]Mikio Kano, Svatopluk Poljak:
Graphs with the balas - uhry property. J. Graph Theory 14(5): 623-628 (1990)
1980 – 1989
- 1988
- [j12]Hikoe Enomoto, Katsuhiro Ota, Mikio Kano:
A sufficient condition for a bipartite graph to have a k-factor. J. Graph Theory 12(1): 141-151 (1988) - [j11]Cui Yuting, Mikio Kano:
Some results on odd factors of graphs. J. Graph Theory 12(3): 327-333 (1988) - 1987
- [j10]Mikio Kano:
Maximum and k-th maximal spanning trees of a weighted graph. Comb. 7(2): 205-214 (1987) - [j9]Mikio Kano:
Ranking the vertices of an r-partite paired comparison digraph. Discret. Appl. Math. 17(3): 245-253 (1987) - 1986
- [j8]Mikio Kano:
Factors of regular graphs. J. Comb. Theory B 41(1): 27-36 (1986) - 1985
- [j7]Jin Akiyama, Mikio Kano:
Factors and factorizations of graphs - a survey. J. Graph Theory 9(1): 1-42 (1985) - [j6]Jin Akiyama, Mikio Kano:
Almost-regular factorization of graphs. J. Graph Theory 9(1): 123-128 (1985) - [j5]Mikio Kano:
[a, b]-factorization of a graph. J. Graph Theory 9(1): 129-146 (1985) - 1983
- [j4]Mikio Kano:
Cycle games and cycle cut games. Comb. 3(2): 201-206 (1983) - [j3]Mikio Kano, Akira Saito:
[a, b]-factors of graphs. Discret. Math. 47: 113-116 (1983) - [j2]Mikio Kano, Akio Sakamoto:
Ranking the vertices of a weighted digraph using the length of forward arcs. Networks 13(1): 143-151 (1983) - 1982
- [j1]Atsushi Amahashi, Mikio Kano:
On factors with given components. Discret. Math. 42(1): 1-6 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
