- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j41 |      | 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) |
| 2009 | ||
| c8 | | Franz-Josef Brandenburg, Mao-cheng Cai: Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. FAW 2009: 4-15 |
| 2008 | ||
| j40 | | 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) |
| c7 | | |
| r1 | | Mao-cheng Cai, Xiaotie Deng: Arbitrage in Frictional Foreign Exchange Market. Encyclopedia of Algorithms 2008 |
| 2006 | ||
| j39 | | Mao-cheng Cai, Xiaotie Deng, Zhongfei Li: Computation of arbitrage in frictional bond markets. Theor. Comput. Sci. 363(3): 248-256 (2006) |
| 2005 | ||
| c6 | | Mao-cheng Cai, Xiaotie Deng, Zhongfei Li: Computation of Arbitrage in a Financial Market with Various Types of Frictions. AAIM 2005: 270-280 |
| 2004 | ||
| j38 | | Mao-cheng Cai, Xiaotie Deng, Lusheng Wang: Minimum k Arborescences with Bandwidth Constraints. Algorithmica 38(4): 529-537 (2004) |
| 2003 | ||
| j37 | | Qizhi Fang, Mao-cheng Cai, Xiaotie Deng: Total Balancedness Condition for Steiner Tree Games. Discrete Applied Mathematics 127(3): 555-563 (2003) |
| j36 | | Mao-cheng Cai, Xiaotie Deng: Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market. Electr. Notes Theor. Comput. Sci. 78: 293-302 (2003) |
| j35 | | Mao-cheng Cai, Xiaotie Deng, Lusheng Wang: Approximate sequencing for variable length tasks. Theor. Comput. Sci. 290(3): 2037-2044 (2003) |
| 2002 | ||
| j34 | | 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) |
| j33 | | 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) |
| j32 | | 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) |
| j31 | | 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 | ||
| j30 | | Mao-cheng Cai, Evelyne Flandrin, Hao Li: On quasifactorability in graphs. Discrete Mathematics 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 | ||
| j29 | | Xudong Yuan, Mao-cheng Cai: Vertices of degree k in a minimally k-edge-connected digraph. Discrete Mathematics 218(1-3): 293-298 (2000) |
| j28 | | Liying Kang, Mao-cheng Cai: Upper minus domination in regular graphs. Discrete Mathematics 219(1-3): 135-144 (2000) |
| j27 | | Mao-cheng Cai, Xiaotie Deng, Wenan Zang: Solution to a problem on degree sequences of graphs. Discrete Mathematics 219(1-3): 253-257 (2000) |
| j26 | | Xudong Yuan, Liying Kang, Mao-cheng Cai: The number of vertices of degree k in a minimally k-edge-connected digraph. Journal of Graph Theory 33(2): 94-108 (2000) |
| j25 | | 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 | ||
| j24 | | Mao-cheng Cai, Yanjun Li, Mikio Kano: A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electr. J. Comb. 6 (1999) |
| j23 | | Mao-cheng Cai, Odile Favaron, Hao Li: (2, k)-Factor-Critical Graphs and Toughness. Graphs and Combinatorics 15(2): 137-142 (1999) |
| j22 | | Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron: (3, k)-Factor-Critical Graphs and Toughness. Graphs and Combinatorics 15(4): 463-471 (1999) |
| j21 | | Mao-cheng Cai, Xiaoguang Yang, Yanjun Li: Inverse Polymatroidal Flow Problem. J. Comb. Optim. 3(1): 115-126 (1999) |
| j20 | | |
| 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 | ||
| j19 | | Yanjun Li, Mao-cheng Cai: A degree condition for a graph to have [a, b]-factors. Journal of Graph Theory 27(1): 1-6 (1998) |
| j18 | | Jianzhong Zhang, Mao-cheng Cai: Inverse problem of minimum cuts. Math. Meth. of OR 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 | ||
| j17 | | |
| j16 | | Mao-cheng Cai, Yanjun Li: Inverse Matroid Intersection Problem. Math. Meth. of OR 45(2): 235-243 (1997) |
| 1995 | ||
| j15 | | Mao-cheng Cai, Herbert Fleischner: An eulerian trail traversing specified edges in given order. Journal of Graph Theory 19(2): 137-144 (1995) |
| 1994 | ||
| j14 | | Mao-cheng Cai: An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order. Discrete Applied Mathematics 55(3): 233-239 (1994) |
| 1993 | ||
| j13 | | Mao-cheng Cai: An algorithm for optimum common root functions of two digraphs. Discrete Mathematics 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, Ser. 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. Discrete Mathematics 104(3): 221-226 (1992) |
| 1991 | ||
| j10 | | |
| 1990 | ||
| j9 | | Mao-cheng Cai: Restricted covering of digraphs with arborescences. Discrete Mathematics 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. Discrete Mathematics 85(1): 43-52 (1990) |
| 1989 | ||
| j7 | | |
| 1984 | ||
| j6 | | Mao-cheng Cai: On a problem of Katona on minimal completely separating systems with restrictions. Discrete Mathematics 48(1): 121-123 (1984) |
| j5 | | |
| 1983 | ||
| j4 | | |
| j3 | | Mao-cheng Cai: Solutions to Edmonds' and Katona's problems on families of separating subsets. Discrete Mathematics 47: 13-21 (1983) |
| 1982 | ||
| j2 | | Mao-cheng Cai: A new bound on the length of the shortest string containing all r-permutations. Discrete Mathematics 39(3): 329-330 (1982) |
| j1 | | Mao-cheng Cai: Minimally k-connected graphs of low order and maximal size. Discrete Mathematics 41(3): 229-234 (1982) |
Data released under the ODC-BY 1.0 license — See also our legal information page