 | 2009 |
|---|
| 38 |       | Franz-Josef Brandenburg,
Mao-cheng Cai:
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.
FAW 2009: 4-15 |
| 2008 |
|---|
| 37 | | Mao-cheng Cai,
Qizhi Fang:
Restricted Core Stability of Flow Games.
WINE 2008: 454-464 |
| 36 | | Mao-cheng Cai,
Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market.
Encyclopedia of Algorithms 2008 |
| 35 | | Mao-cheng Cai,
C. W. Duin,
Xiaoguang Yang,
Jianzhong Zhang:
The partial inverse minimum spanning tree problem when weight increase is forbidden.
European Journal of Operational Research 188(2): 348-353 (2008) |
| 2006 |
|---|
| 34 | | Mao-cheng Cai,
Xiaotie Deng,
Zhongfei Li:
Computation of arbitrage in frictional bond markets.
Theor. Comput. Sci. 363(3): 248-256 (2006) |
| 2005 |
|---|
| 33 | | Mao-cheng Cai,
Xiaotie Deng,
Zhongfei Li:
Computation of Arbitrage in a Financial Market with Various Types of Frictions.
AAIM 2005: 270-280 |
| 2004 |
|---|
| 32 | | Mao-cheng Cai,
Xiaotie Deng,
Lusheng Wang:
Minimum k Arborescences with Bandwidth Constraints.
Algorithmica 38(4): 529-537 (2004) |
| 2003 |
|---|
| 31 | | Qizhi Fang,
Mao-cheng Cai,
Xiaotie Deng:
Total Balancedness Condition for Steiner Tree Games.
Discrete Applied Mathematics 127(3): 555-563 (2003) |
| 30 | | Mao-cheng Cai,
Xiaotie Deng:
Arbitrage in Frictional Foreign Exchange Market.
Electr. Notes Theor. Comput. Sci. 78: (2003) |
| 29 |  | Mao-cheng Cai,
Xiaotie Deng,
Lusheng Wang:
Approximate sequencing for variable length tasks.
Theor. Comput. Sci. 290(3): 2037-2044 (2003) |
| 2002 |
|---|
| 28 | | 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 |
| 27 | | Liying Kang,
Chuangyin Dang,
Mao-cheng Cai,
Erfang Shan:
Upper bounds for the k-subdomination number of graphs.
Discrete Mathematics 247(1-3): 229-234 (2002) |
| 26 | | 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) |
| 25 | | Mao-cheng Cai,
Xiaotie Deng,
Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets.
Math. Oper. Res. 27(2): 361-371 (2002) |
| 2001 |
|---|
| 24 | | Qizhi Fang,
Shanfeng Zhu,
Mao-cheng Cai,
Xiaotie Deng:
Membership for Core of LP Games and Other Games.
COCOON 2001: 247-256 |
| 23 | | Mao-cheng Cai,
Evelyne Flandrin,
Hao Li:
On quasifactorability in graphs.
Discrete Mathematics 233(1-3): 85-92 (2001) |
| 2000 |
|---|
| 22 | | Xu-dong Yuan,
Mao-cheng Cai:
Vertices of degree k in a minimally k-edge-connected digraph.
Discrete Mathematics 218(1-3): 293-298 (2000) |
| 21 | | Liying Kang,
Mao-cheng Cai:
Upper minus domination in regular graphs.
Discrete Mathematics 219(1-3): 135-144 (2000) |
| 20 | | Mao-cheng Cai,
Xiaotie Deng,
Wenan Zang:
Solution to a problem on degree sequences of graphs.
Discrete Mathematics 219(1-3): 253-257 (2000) |
| 19 | | Mao-cheng Cai,
Xiaotie Deng,
Wenan Zang:
An Approximation Algorithm for Feedback Vertex Sets in Tournaments.
SIAM J. Comput. 30(6): 1993-2007 (2000) |
| 1999 |
|---|
| 18 | | Mao-cheng Cai,
Xiaotie Deng,
Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets.
IPCO 1999: 73-86 |
| 17 | | Jianzhong Zhang,
Xiaoguang Yang,
Mao-cheng Cai:
Reverse Center Location Problem.
ISAAC 1999: 279-294 |
| 16 | | Mao-cheng Cai,
Yanjun Li,
Mikio Kano:
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle.
Electr. J. Comb. 6: (1999) |
| 15 | | Mao-cheng Cai,
Xiaoguang Yang,
Yanjun Li:
Inverse Polymatroidal Flow Problem.
J. Comb. Optim. 3(1): 115-126 (1999) |
| 14 | | Mao-cheng Cai:
Inverse Problems of Matroid Intersection.
J. Comb. Optim. 3(4): 465-474 (1999) |
| 1998 |
|---|
| 13 | | Mao-cheng Cai,
Xiaotie Deng,
Wenan Zang:
A TDI System and its Application to Approximation Algorithms.
FOCS 1998: 227-243 |
| 1997 |
|---|
| 12 | | Mao-cheng Cai:
Connected [k, k + 1]-factors of graphs.
Discrete Mathematics 169(1-3): 1-16 (1997) |
| 1994 |
|---|
| 11 | | Mao-cheng Cai:
An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order.
Discrete Applied Mathematics 55(3): 233-239 (1994) |
| 1993 |
|---|
| 10 | | Mao-cheng Cai:
An algorithm for optimum common root functions of two digraphs.
Discrete Mathematics 119(1-3): 13-20 (1993) |
| 9 | | Mao-cheng Cai:
The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph.
J. Comb. Theory, Ser. B 58(2): 225-239 (1993) |
| 1992 |
|---|
| 8 | | Mao-cheng Cai:
A remark on the number of vertices of degree k in a minimally k-edge-connected graph.
Discrete Mathematics 104(3): 221-226 (1992) |
| 1991 |
|---|
| 7 | | Mao-cheng Cai:
On some factor theorems of graphs.
Discrete Mathematics 98(3): 223-229 (1991) |
| 1990 |
|---|
| 6 | | Mao-cheng Cai:
Restricted covering of digraphs with arborescences.
Discrete Mathematics 82(2): 143-152 (1990) |
| 5 | | Mao-cheng Cai:
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices.
Discrete Mathematics 85(1): 43-52 (1990) |
| 1984 |
|---|
| 4 | | Mao-cheng Cai:
On separating systems of graphs.
Discrete Mathematics 49(1): 15-20 (1984) |
| 1983 |
|---|
| 3 | | Mao-cheng Cai:
A counterexample to a conjecture of grant.
Discrete Mathematics 44(1): 111 (1983) |
| 1982 |
|---|
| 2 | | Mao-cheng Cai:
A new bound on the length of the shortest string containing all r-permutations.
Discrete Mathematics 39(3): 329-330 (1982) |
| 1 | | Mao-cheng Cai:
Minimally k-connected graphs of low order and maximal size.
Discrete Mathematics 41(3): 229-234 (1982) |
