default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMao-cheng Cai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j46]Mao-cheng Cai, Liying Kang
:
Solution to a Forcible Version of a Graphic Sequence Problem. Graphs Comb. 38(3): 97 (2022)
2010 – 2019
- 2018
- [j45]Mao-cheng Cai, Liying Kang:
A Characterization of Box-bounded Degree Sequences of Graphs. Graphs Comb. 34(4): 599-606 (2018) - 2016
- [r2]Mao-cheng Cai, Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market. Encyclopedia of Algorithms 2016: 141-145 - 2011
- [j44]Franz-Josef Brandenburg, Mao-cheng Cai:
Shortest path and maximum flow problems in networks with additive losses and gains. Theor. Comput. Sci. 412(4-5): 391-401 (2011)
2000 – 2009
- 2009
- [c9]Franz-Josef Brandenburg, Mao-cheng Cai:
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. FAW 2009: 4-15 - 2008
- [j43]Mao-cheng Cai, C. W. Duin, Xiaoguang Yang, Jianzhong Zhang:
The partial inverse minimum spanning tree problem when weight increase is forbidden. Eur. J. Oper. Res. 188(2): 348-353 (2008) - [c8]Mao-cheng Cai, Qizhi Fang:
Restricted Core Stability of Flow Games. WINE 2008: 454-464 - [r1]Mao-cheng Cai, Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market. Encyclopedia of Algorithms 2008 - 2006
- [j42]Mao-cheng Cai, Xiaotie Deng, Zhongfei Li:
Computation of arbitrage in frictional bond markets. Theor. Comput. Sci. 363(3): 248-256 (2006) - 2005
- [c7]Mao-cheng Cai, Xiaotie Deng, Zhongfei Li:
Computation of Arbitrage in a Financial Market with Various Types of Frictions. AAIM 2005: 270-280 - 2004
- [j41]Mao-cheng Cai, Xiaotie Deng, Lusheng Wang:
Minimum k Arborescences with Bandwidth Constraints. Algorithmica 38(4): 529-537 (2004) - [j40]Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
A Network Improvement Problem Under Different Norms. Comput. Optim. Appl. 27(3): 305-319 (2004) - [j39]Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
Inapproximability and a polynomially solvable special case of a network improvement problem. Eur. J. Oper. Res. 155(1): 251-257 (2004) - 2003
- [j38]Qizhi Fang, Mao-cheng Cai, Xiaotie Deng:
Total Balancedness Condition for Steiner Tree Games. Discret. Appl. Math. 127(3): 555-563 (2003) - [j37]Mao-cheng Cai, Xiaotie Deng, Lusheng Wang:
Approximate sequencing for variable length tasks. Theor. Comput. Sci. 290(3): 2037-2044 (2003) - [c6]Mao-cheng Cai, Xiaotie Deng:
Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market. CATS 2003: 293-302 - 2002
- [j36]Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan:
Upper bounds for the k-subdomination number of graphs. Discret. Math. 247(1-3): 229-234 (2002) - [j35]Xiaoguang Yang, Shuo Tao, Rongjun Liu, Mao-cheng Cai:
Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective. Int. J. Found. Comput. Sci. 13(5): 671-679 (2002) - [j34]Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng:
On computational complexity of membership test in flow games and linear production games. Int. J. Game Theory 31(1): 39-45 (2002) - [j33]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets. Math. Oper. Res. 27(2): 361-371 (2002) - [c5]Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. IPCO 2002: 304-314 - 2001
- [j32]Mao-cheng Cai, Evelyne Flandrin, Hao Li:
On quasifactorability in graphs. Discret. Math. 233(1-3): 85-92 (2001) - [c4]Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng:
Membership for Core of LP Games and Other Games. COCOON 2001: 247-256 - 2000
- [j31]Xudong Yuan, Mao-cheng Cai:
Vertices of degree k in a minimally k-edge-connected digraph. Discret. Math. 218(1-3): 293-298 (2000) - [j30]Liying Kang, Mao-cheng Cai:
Upper minus domination in regular graphs. Discret. Math. 219(1-3): 135-144 (2000) - [j29]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
Solution to a problem on degree sequences of graphs. Discret. Math. 219(1-3): 253-257 (2000) - [j28]Xudong Yuan, Liying Kang, Mao-cheng Cai:
The number of vertices of degree k in a minimally k-edge-connected digraph. J. Graph Theory 33(2): 94-108 (2000) - [j27]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
An Approximation Algorithm for Feedback Vertex Sets in Tournaments. SIAM J. Comput. 30(6): 1993-2007 (2000)
1990 – 1999
- 1999
- [j26]Mao-cheng Cai, Yanjun Li, Mikio Kano:
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electron. J. Comb. 6 (1999) - [j25]Mao-cheng Cai, Odile Favaron, Hao Li:
(2, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15(2): 137-142 (1999) - [j24]Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron:
(3, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15(4): 463-471 (1999) - [j23]Mao-cheng Cai, Xiaoguang Yang, Yanjun Li:
Inverse Polymatroidal Flow Problem. J. Comb. Optim. 3(1): 115-126 (1999) - [j22]Mao-cheng Cai:
Inverse Problems of Matroid Intersection. J. Comb. Optim. 3(4): 465-474 (1999) - [j21]Mao-cheng Cai, Xiaoguang Yang, Jianzhong Zhang:
The Complexity Analysis of the Inverse Center Location Problem. J. Glob. Optim. 15(2): 213-218 (1999) - [c3]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets. IPCO 1999: 73-86 - [c2]Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai:
Reverse Center Location Problem. ISAAC 1999: 279-294 - 1998
- [j20]Yanjun Li, Mao-cheng Cai:
A degree condition for a graph to have [a, b]-factors. J. Graph Theory 27(1): 1-6 (1998) - [j19]Jianzhong Zhang, Mao-cheng Cai:
Inverse problem of minimum cuts. Math. Methods Oper. Res. 47(1): 51-58 (1998) - [c1]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A TDI System and its Application to Approximation Algorithms. FOCS 1998: 227-243 - 1997
- [j18]Mao-cheng Cai:
Connected [k, k + 1]-factors of graphs. Discret. Math. 169(1-3): 1-16 (1997) - [j17]Mao-cheng Cai, Yanjun Li:
Inverse Matroid Intersection Problem. Math. Methods Oper. Res. 45(2): 235-243 (1997) - 1996
- [j16]Yanjun Li, Mao-cheng Cai:
A degree condition for the existence of connected factors. Australas. J Comb. 14: 77-84 (1996) - 1995
- [j15]Mao-cheng Cai, Herbert Fleischner:
An eulerian trail traversing specified edges in given order. J. Graph Theory 19(2): 137-144 (1995) - 1994
- [j14]Mao-cheng Cai:
An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order. Discret. Appl. Math. 55(3): 233-239 (1994) - 1993
- [j13]Mao-cheng Cai:
An algorithm for optimum common root functions of two digraphs. Discret. Math. 119(1-3): 13-20 (1993) - [j12]Mao-cheng Cai:
The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph. J. Comb. Theory B 58(2): 225-239 (1993) - 1992
- [j11]Mao-cheng Cai:
A remark on the number of vertices of degree k in a minimally k-edge-connected graph. Discret. Math. 104(3): 221-226 (1992) - 1991
- [j10]Mao-cheng Cai:
On some factor theorems of graphs. Discret. Math. 98(3): 223-229 (1991) - 1990
- [j9]Mao-cheng Cai:
Restricted covering of digraphs with arborescences. Discret. Math. 82(2): 143-152 (1990) - [j8]Mao-cheng Cai:
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. Discret. Math. 85(1): 43-52 (1990)
1980 – 1989
- 1989
- [j7]Mao-cheng Cai:
Common root functions of two digraphs. J. Graph Theory 13(2): 249-256 (1989) - 1984
- [j6]Mao-cheng Cai:
On a problem of Katona on minimal completely separating systems with restrictions. Discret. Math. 48(1): 121-123 (1984) - [j5]Mao-cheng Cai:
On separating systems of graphs. Discret. Math. 49(1): 15-20 (1984) - 1983
- [j4]Mao-cheng Cai:
A counterexample to a conjecture of grant. Discret. Math. 44(1): 111 (1983) - [j3]Mao-cheng Cai:
Solutions to Edmonds' and Katona's problems on families of separating subsets. Discret. Math. 47: 13-21 (1983) - 1982
- [j2]Mao-cheng Cai:
A new bound on the length of the shortest string containing all r-permutations. Discret. Math. 39(3): 329-330 (1982) - [j1]Mao-cheng Cai:
Minimally k-connected graphs of low order and maximal size. Discret. Math. 41(3): 229-234 (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-06-10 21:20 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:
