default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYaping Mao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j86]Chenxu Yang, Yaping Mao, Ralf Klasing, Gang Yang, Yuzhi Xiao, Xiaoyan Zhang:
Fault-tolerance in distance-edge-monitoring sets. Acta Informatica 62(1): 9 (2025)- [j85]Wen Li, Ralf Klasing, Yaping Mao, Bo Ning:
Monitoring the edges of product networks using distances. J. Comput. Syst. Sci. 148: 103602 (2025) - 2024
- [j84]Gang Yang, Jiannan Zhou, Changxiang He, Yaping Mao:
Distance-edge-monitoring sets of networks. Acta Informatica 61(2): 183-198 (2024) - [j83]Sainan Guo, Yannan Chen, Yaping Mao, Xiaoyan Zhang:
Online Single-Processor Scheduling with an Unexpected Breakdown. Asia Pac. J. Oper. Res. 41(1): 2350005:1-2350005:15 (2024) - [j82]Chenxu Yang
, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. Discret. Appl. Math. 342: 153-167 (2024) - [j81]Zhen Ji, Ralf Klasing, Wen Li, Yaping Mao, Xiaoyan Zhang:
Erdös-Gallai-type problems for distance-edge-monitoring numbers. Discret. Appl. Math. 342: 275-285 (2024) - [j80]Zhiqiang Ma, Yaping Mao, Ingo Schiermeyer, Meiqin Wei:
Complete bipartite graphs without small rainbow subgraphs. Discret. Appl. Math. 346: 248-262 (2024) - [j79]Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation Results for Distance-edge-monitoring Numbers. Fundam. Informaticae 191(2): 141-163 (2024) - [j78]Yaping Mao:
Gallai-Ramsey Multiplicity. Graphs Comb. 40(3): 54 (2024) - [j77]Ping Li, Yaping Mao, Ingo Schiermeyer, Yifan Yao:
Gallai-Ramsey Numbers for Paths. Graphs Comb. 40(6): 115 (2024) - [j76]Xiaojuan Zhang, Gang Yang, Changxiang He, Ralf Klasing, Yaping Mao:
The number of spanning trees for Sierpiński graphs and data center networks. Inf. Comput. 300: 105194 (2024) - [j75]Chenxu Yang, Gang Yang, Sun-Yuan Hsieh, Yaping Mao, Ralf Klasing:
Monitoring the edges of a graph using distances with given girth. J. Comput. Syst. Sci. 143: 103528 (2024) - [j74]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Ralf Klasing, Yuzhi Xiao:
The g-extra connectivity of graph products. J. Comput. Syst. Sci. 145: 103552 (2024) - [j73]Eddie Cheng, Longkun Guo, Yaping Mao, Xiaoyan Zhang:
A Commentary on the Progress of Big Data in Combinatorial Optimization. Parallel Process. Lett. 34(1): 2475001:1-2475001:6 (2024) - [j72]Zhen Ji, Yaping Mao, Eddie Cheng, Xiaoyan Zhang:
Realizability problem of distance-edge-monitoring numbers. RAIRO Oper. Res. 58(5): 3715-3732 (2024) - [c5]Limin Wang, Zhao Zhang, Donglei Du, Yaping Mao, Xiaoyan Zhang:
A Distributed Approximation Algorithm for the Total Dominating Set Problem. AAIM (1) 2024: 122-132 - 2023
- [j71]Jiannan Zhou, Zhihui Li, Yaping Mao, Meiqin Wei:
Ramsey and Gallai-Ramsey numbers for the union of paths and stars. Discret. Appl. Math. 325: 297-308 (2023) - [j70]Weizhen Chen, Meng Ji, Yaping Mao, Meiqin Wei:
Complete bipartite graphs without small rainbow stars. Discret. Appl. Math. 340: 14-20 (2023) - [j69]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey numbers for fans. Discret. Math. 346(5): 113338 (2023) - [j68]Hengzhe Li, Huayue Liu, Jianbing Liu, Yaping Mao:
Edge-Disjoint Steiner Trees and Connectors in Graphs. Graphs Comb. 39(2): 23 (2023) - [j67]Jinyu Zou, Zhao Wang, Hong-Jian Lai, Yaping Mao:
Gallai-Ramsey Numbers Involving a Rainbow 4-Path. Graphs Comb. 39(3): 54 (2023) - [j66]Yaping Mao:
Size Gallai-Ramsey Number. Graphs Comb. 39(6): 126 (2023) - [j65]Yaping Mao, Kenta Ozeki, Aaron Robertson, Zhao Wang:
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings. J. Comb. Theory A 193: 105672 (2023) - [j64]Guowei Dai, Yannan Chen, Yaping Mao, Dachuan Xu, Xiaoyan Zhang, Zan-Bo Zhang:
A distributed message passing algorithm for computing perfect demand matching. J. Parallel Distributed Comput. 179: 104706 (2023) - [i9]Chenxu Yang, Ralf Klasing, Changxiang He, Yaping Mao:
Perturbation results for distance-edge-monitoring numbers. CoRR abs/2301.02507 (2023) - [i8]Chenxu Yang, Ping Li, Yaping Mao, Eddie Cheng, Ralf Klasing:
Constructing disjoint Steiner trees in Sierpiński graphs. CoRR abs/2310.16463 (2023) - [i7]Wenqi Wang, Gregory Z. Gutin, Yaping Mao, Donglei Du, Xiaoyan Zhang:
Streaming Algorithms for the k-Submodular Cover Problem. CoRR abs/2312.03593 (2023) - 2022
- [j63]Changxiang He, Yuru Liu, Hao Li, Hui Zhang, Yaping Mao, Xiaofei Qin, Lele Liu, Xuedian Zhang:
Multi-type feature fusion based on graph neural network for drug-drug interaction prediction. BMC Bioinform. 23(1): 224 (2022) - [j62]Jinyu Zou, Yaping Mao, Zhao Wang, Eddie Cheng:
Fractional matching preclusion number of graphs. Discret. Appl. Math. 311: 142-153 (2022) - [j61]Meiqin Wei, Changxiang He, Yaping Mao, Xiangqian Zhou:
Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. Discret. Math. 345(11): 113092 (2022) - [j60]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey Number for Wheels. Graphs Comb. 38(2): 42 (2022) - [j59]Yaping Mao:
Steiner 3-diameter, maximum degree and size of a graph. Int. J. Comput. Math. Comput. Syst. Theory 7(2): 95-111 (2022) - [j58]Zhao Wang, Yaping Mao, Yue Li, Boris Furtula:
On relations between Sombor and other degree-based indices. J. Appl. Math. Comput. 68(1): 1-17 (2022) - [j57]Tianlong Ma, Eddie Cheng, Yaping Mao, Xu Wang:
A note on maximum fractional matchings of graphs. J. Comb. Optim. 43(1): 253-264 (2022) - [j56]Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen:
A general approach to deriving diagnosability results of interconnection networks. Int. J. Parallel Emergent Distributed Syst. 37(4): 369-397 (2022) - [i6]Eddie Cheng, Yaping Mao, Ke Qiu, Zhizhang Shen:
A general approach to deriving diagnosability results of interconnection networks. CoRR abs/2205.01631 (2022) - [i5]Chengxu Yang, Ralf Klasing, Yaping Mao, Xingchao Deng:
On the distance-edge-monitoring numbers of graphs. CoRR abs/2211.04920 (2022) - [i4]Wen Li, Ralf Klasing, Yaping Mao, Bo Ning:
Monitoring the edges of product networks using distances. CoRR abs/2211.10743 (2022) - 2021
- [j55]Yaping Mao, Peter Dankelmann, Zhao Wang:
Steiner diameter, maximum degree and size of a graph. Discret. Math. 344(8): 112468 (2021) - [j54]Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu:
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. Discuss. Math. Graph Theory 41(2): 559-587 (2021) - [j53]Zhao Wang, Yaping Mao, Colton Magnant, Jinyu Zou:
Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. Graphs Comb. 37(1): 337-354 (2021) - [j52]Zhiwei Guo, Yaping Mao, Nan Jia, He Li:
Strong Equitable Vertex Arboricity in Cartesian Product Networks. J. Interconnect. Networks 21(2): 2150010:1-2150010:13 (2021) - [j51]Yaping Mao:
Preface. J. Interconnect. Networks 21(4): 2102001:1 (2021) - [j50]Nan Jia, Yaping Mao, Zhao Wang, Eddie Cheng:
Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree. Math. Comput. Sci. 15(4): 743-755 (2021) - 2020
- [j49]Yaping Mao, Zhao Wang, Colton Magnant, Ingo Schiermeyer:
Ramsey and Gallai-Ramsey numbers for stars with extra independent edges. Discret. Appl. Math. 285: 153-172 (2020) - [j48]Stanislav Jendrol', Xueliang Li, Yaping Mao, Yingying Zhang, Haixing Zhao, Xiaoyu Zhu:
Conflict-free vertex-connections of graphs. Discuss. Math. Graph Theory 40(1): 51-65 (2020) - [j47]Colton Magnant, Yaping Mao:
On Cycles that Alternate Through Selected Sets of Vertices. Graphs Comb. 36(5): 1517-1523 (2020) - [j46]Tianlong Ma, Yaping Mao, Eddie Cheng, Ping Han:
A note on the strong matching preclusion problem for data center networks. Inf. Process. Lett. 164: 106007 (2020) - [j45]Zhao Wang, Yaping Mao, Kinkar Chandra Das, Yilun Shang:
Nordhaus-Gaddum-Type Results for the Steiner Gutman Index of Graphs. Symmetry 12(10): 1711 (2020) - [j44]Zhao Wang, Yaping Mao, Sun-Yuan Hsieh, Jichang Wu:
On the g-good-neighbor connectivity of graphs. Theor. Comput. Sci. 804: 139-148 (2020) - [j43]Ran Gu, Yaping Mao, Guoju Ye:
Note on matching preclusion number of random graphs. Theor. Comput. Sci. 833: 1-10 (2020)
2010 – 2019
- 2019
- [j42]Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao, Haixing Zhao:
On conflict-free connection of graphs. Discret. Appl. Math. 255: 167-182 (2019) - [j41]Jinyu Zou, Yaping Mao, Colton Magnant, Zhao Wang, Chengfu Ye:
Gallai-Ramsey numbers for books. Discret. Appl. Math. 268: 164-177 (2019) - [j40]Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang:
Fractional matching preclusion for arrangement graphs. Discret. Appl. Math. 270: 181-189 (2019) - [j39]Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian:
Fractional matching preclusion for generalized augmented cubes. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j38]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona, Cluster, and Threshold Graphs. J. Inf. Sci. Eng. 35(4): 721-735 (2019) - [j37]Eddie Cheng, Yaping Mao:
Preface. J. Interconnect. Networks 19(3): 1902002:1-1902002:1 (2019) - [j36]Yaping Mao, Eddie Cheng:
A Concise Survey of Matching Preclusion in Interconnection Networks. J. Interconnect. Networks 19(3): 1940006:1-1940006:13 (2019) - [j35]Zhao Wang, Christopher Melekian, Eddie Cheng, Yaping Mao:
Matching preclusion number in product graphs. Theor. Comput. Sci. 755: 38-47 (2019) - [j34]Zhao Wang, Yaping Mao, Eddie Cheng, Jinyu Zou:
Matching preclusion number of graphs. Theor. Comput. Sci. 759: 61-71 (2019) - [j33]Yuzhi Xiao, Haixing Zhao, Yaping Mao, Guanrong Chen:
Invulnerability of planar two-tree networks. Theor. Comput. Sci. 767: 16-25 (2019) - 2018
- [j32]Yaping Mao, Eddie Cheng, Zhao Wang, Zhiwei Guo:
The k-independence number of graph products. Art Discret. Appl. Math. 1(1): #P1.01 (2018) - [j31]Yaping Mao:
Constructing internally disjoint pendant Steiner trees in Cartesian product networks. Australas. J Comb. 70: 28-51 (2018) - [j30]Ivan Gutman, Xueliang Li, Yaping Mao:
Inverse problem on the Steiner Wiener index. Discuss. Math. Graph Theory 38(1): 83-95 (2018) - [j29]Yaping Mao, Eddie Cheng, Zhao Wang:
Steiner Distance in Product Networks. Discret. Math. Theor. Comput. Sci. 20(2) (2018) - [j28]Yaping Mao, Christopher Melekian, Eddie Cheng:
A note on the Steiner -diameter of a graph. Int. J. Comput. Math. Comput. Syst. Theory 3(1): 41-46 (2018) - [j27]Zhao Wang, Yaping Mao, Hengzhe Li, Chengfu Ye:
On the Steiner 4-Diameter of Graphs. J. Interconnect. Networks 18(1): 1850002:1-1850002:15 (2018) - [j26]Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang:
Fractional Matching Preclusion for (n, k)-Star Graphs. Parallel Process. Lett. 28(4): 1850017:1-1850017:15 (2018) - [j25]Yaping Mao, Zhao Wang, Eddie Cheng, Christopher Melekian:
Strong matching preclusion number of graphs. Theor. Comput. Sci. 713: 11-20 (2018) - [c4]Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian:
Fractional Matching Preclusion for (Burnt) Pancake Graphs. I-SPAN 2018: 133-141 - 2017
- [j24]Yaping Mao:
Constructing edge-disjoint Steiner paths in lexicographic product networks. Appl. Math. Comput. 308: 1-10 (2017) - [j23]Yaping Mao, Chengfu Ye, Hengzhe Li, Shumin Zhang:
The chromatic equivalence class of graph ψn3(n-3, 1). Ars Comb. 135: 399-421 (2017) - [j22]Yaping Mao, Zhao Wang, Ivan Gutman, He Li:
Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs. Discret. Appl. Math. 219: 167-175 (2017) - [j21]Yuzhi Xiao, Haixing Zhao, Zhen Liu, Yaping Mao:
Trees with large numbers of subtrees. Int. J. Comput. Math. 94(2): 372-385 (2017) - [j20]Lily Chen, Xueliang Li, Mengmeng Liu, Yaping Mao:
A solution to a conjecture on the generalized connectivity of graphs. J. Comb. Optim. 33(1): 275-282 (2017) - [j19]Zhao Wang, Yaping Mao, Chengfu Ye, Haixing Zhao:
Super Edge-Connectivity of Strong Product Graphs. J. Interconnect. Networks 17(2): 1750007:1-1750007:14 (2017) - [c3]Bo Deng, Wenjing Li, Xueliang Li, Yaping Mao, Haixing Zhao:
Conflict-Free Connection Numbers of Line Graphs. COCOA (1) 2017: 141-151 - [c2]Zhao Wang, Yaping Mao, Christopher Melekian, Eddie Cheng:
Steiner Distance in Join, Corona and Threshold Graphs. ISPAN-FCST-ISCC 2017: 100-104 - 2016
- [j18]Yaping Mao, Chengfu Ye:
The fifth coefficient of adjoint polynomial and a new invariant. Ars Comb. 128: 83-102 (2016) - [j17]Yaping Mao, Zhao Wang, Fengnan Yanling, Chengfu Ye:
Monochromatic connectivity and graph products. Discret. Math. Algorithms Appl. 8(1): 1650011:1-1650011:18 (2016) - [j16]Ivan Gutman, Xueliang Li, Yaping Mao:
The Steiner Wiener index of a graph. Discuss. Math. Graph Theory 36(2): 455-465 (2016) - [j15]Yaping Mao:
The vertex-rainbow index of a graph. Discuss. Math. Graph Theory 36(3): 669-681 (2016) - [j14]Xueliang Li, Yaping Mao:
Graphs with large generalized (edge-)connectivity. Discuss. Math. Graph Theory 36(4): 931-958 (2016) - [j13]Yaping Mao:
Path-connectivity of lexicographic product graphs. Int. J. Comput. Math. 93(1): 27-39 (2016) - [j12]Yaping Mao, Fengnan Yanling, Zhao Wang, Chengfu Ye:
Rainbow vertex-connection and graph products. Int. J. Comput. Math. 93(7): 1078-1092 (2016) - [j11]Yaping Mao, Zhiwei Guo, Nan Jia, He Li:
Linear k-Arboricity in Product Networks. J. Interconnect. Networks 16(3-4): 1650008:1-1650008:25 (2016) - 2015
- [j10]Xueliang Li, Yaping Mao:
The minimal size of a graph with given generalized 3-edge-connectivity. Ars Comb. 118: 63-72 (2015) - [j9]Xueliang Li, Yaping Mao:
Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs. Discret. Appl. Math. 185: 102-112 (2015) - [j8]Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue:
Note on the spanning-tree packing number of lexicographic product graphs. Discret. Math. 338(5): 669-673 (2015) - [j7]Yaping Mao, Yongtang Shi:
The complexity of determining the vertex-rainbow index of graphs. Discret. Math. Algorithms Appl. 7(4): 1550047:1-1550047:16 (2015) - [j6]Zhiwei Guo, Haixing Zhao, Yaping Mao:
On the equitable vertex arboricity of complete tripartite graphs. Discret. Math. Algorithms Appl. 7(4): 1550056:1-1550056:22 (2015) - [j5]Xueliang Li, Yaping Mao:
On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. Graphs Comb. 31(6): 2231-2259 (2015) - [j4]Zhiwei Guo, Haixing Zhao, Yaping Mao:
The equitable vertex arboricity of complete tripartite graphs. Inf. Process. Lett. 115(12): 977-982 (2015) - [c1]Xueliang Li, Yaping Mao, Meiqin Wei, Ruihu Li:
Searching for (near) Optimal Codes. COCOA 2015: 521-536 - 2014
- [j3]Xueliang Li, Yaping Mao, Yuefang Sun:
On the generalized (edge-)connectivity of graphs. Australas. J Comb. 58: 304-319 (2014) - [j2]Hengzhe Li, Xueliang Li, Yaping Mao, Yuefang Sun:
Note on the generalized connectivity. Ars Comb. 114: 193-202 (2014) - [j1]Xueliang Li, Yaping Mao:
The generalized 3-connectivity of Lexicographic product graphs. Discret. Math. Theor. Comput. Sci. 16(1): 339-354 (2014) - [i3]Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei:
Formally self-dual linear binary codes from circulant graphs. CoRR abs/1402.6399 (2014) - [i2]Ruihu Li, Xueliang Li, Yaping Mao, Meiqin Wei:
Additive codes over $GF(4)$ from circulant graphs. CoRR abs/1403.7933 (2014) - 2012
- [i1]Xueliang Li, Yaping Mao:
A survey on the generalized connectivity of graphs. CoRR abs/1207.1838 (2012)
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 2025-01-08 20:32 CET 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:
