Mao-cheng Cai

Publication Activity (10 Years)

Years Active: 1982-2022
Publications (10 Years): 2

Top Topics

Graph Structure

Bounded Treewidth

Linear Equations

Top Venues

Publications

Mao-cheng Cai, Liying Kang
Solution to a Forcible Version of a Graphic Sequence Problem. Graphs Comb. 38 (3) (2022)
Mao-cheng Cai, Liying Kang
A Characterization of Box-bounded Degree Sequences of Graphs. Graphs Comb. 34 (4) (2018)
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) (2011)
Franz-Josef Brandenburg, Mao-cheng Cai
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. FAW (2009)
Mao-cheng Cai, Qizhi Fang
Restricted Core Stability of Flow Games. WINE (2008)
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) (2008)
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li
Computation of arbitrage in frictional bond markets. Theor. Comput. Sci. 363 (3) (2006)
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li
Computation of Arbitrage in a Financial Market with Various Types of Frictions. AAIM (2005)
Mao-cheng Cai, Xiaotie Deng, Lusheng Wang
Minimum k Arborescences with Bandwidth Constraints. Algorithmica 38 (4) (2004)
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) (2004)
Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
A Network Improvement Problem Under Different Norms. Comput. Optim. Appl. 27 (3) (2004)
Mao-cheng Cai, Xiaotie Deng, Lusheng Wang
Approximate sequencing for variable length tasks. Theor. Comput. Sci. 290 (3) (2003)
Qizhi Fang, Mao-cheng Cai, Xiaotie Deng
Total Balancedness Condition for Steiner Tree Games. Discret. Appl. Math. 127 (3) (2003)
Mao-cheng Cai, Xiaotie Deng
Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market. Electron. Notes Theor. Comput. Sci. 78 (2003)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A Min-Max Theorem on Feedback Vertex Sets. Math. Oper. Res. 27 (2) (2002)
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) (2002)
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) (2002)
Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan
-subdomination number of graphs. Discret. Math. 247 (1-3) (2002)
Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. IPCO (2002)
Mao-cheng Cai, Evelyne Flandrin, Hao Li
On quasifactorability in graphs. Discret. Math. 233 (1-3) (2001)
Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng
Membership for Core of LP Games and Other Games. COCOON (2001)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
Solution to a problem on degree sequences of graphs. Discret. Math. 219 (1-3) (2000)
Liying Kang, Mao-cheng Cai
Upper minus domination in regular graphs. Discret. Math. 219 (1-3) (2000)
Xudong Yuan, Mao-cheng Cai
Vertices of degree k in a minimally k-edge-connected digraph. Discret. Math. 218 (1-3) (2000)
Xudong Yuan, Liying Kang, Mao-cheng Cai
-edge-connected digraph. J. Graph Theory 33 (2) (2000)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
An Approximation Algorithm for Feedback Vertex Sets in Tournaments. SIAM J. Comput. 30 (6) (2000)
Mao-cheng Cai, Odile Favaron, Hao Li
(2, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15 (2) (1999)
Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
Reverse Center Location Problem. ISAAC (1999)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A Min-Max Theorem on Feedback Vertex Sets. IPCO (1999)
Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron
(3, k)-Factor-Critical Graphs and Toughness. Graphs Comb. 15 (4) (1999)
Mao-cheng Cai, Yanjun Li, Mikio Kano
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle. Electron. J. Comb. 6 (1999)
Mao-cheng Cai, Xiaoguang Yang, Yanjun Li
Inverse Polymatroidal Flow Problem. J. Comb. Optim. 3 (1) (1999)
Mao-cheng Cai
Inverse Problems of Matroid Intersection. J. Comb. Optim. 3 (4) (1999)
Mao-cheng Cai, Xiaoguang Yang, Jianzhong Zhang
The Complexity Analysis of the Inverse Center Location Problem. J. Glob. Optim. 15 (2) (1999)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A TDI System and its Application to Approximation Algorithms. FOCS (1998)
Jianzhong Zhang, Mao-cheng Cai
Inverse problem of minimum cuts. Math. Methods Oper. Res. 47 (1) (1998)
Yanjun Li, Mao-cheng Cai
]-factors. J. Graph Theory 27 (1) (1998)
Mao-cheng Cai, Yanjun Li
Inverse Matroid Intersection Problem. Math. Methods Oper. Res. 45 (2) (1997)
Mao-cheng Cai
Connected [k, k + 1]-factors of graphs. Discret. Math. 169 (1-3) (1997)
Yanjun Li, Mao-cheng Cai
A degree condition for the existence of connected factors. Australas. J Comb. 14 (1996)
Mao-cheng Cai, Herbert Fleischner
An eulerian trail traversing specified edges in given order. J. Graph Theory 19 (2) (1995)
Mao-cheng Cai
An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order. Discret. Appl. Math. 55 (3) (1994)
Mao-cheng Cai
An algorithm for optimum common root functions of two digraphs. Discret. Math. 119 (1-3) (1993)
Mao-cheng Cai
-Edge-Connected Graph. J. Comb. Theory, Ser. B 58 (2) (1993)
Mao-cheng Cai
A remark on the number of vertices of degree k in a minimally k-edge-connected graph. Discret. Math. 104 (3) (1992)
Mao-cheng Cai
On some factor theorems of graphs. Discret. Math. 98 (3) (1991)
Mao-cheng Cai
Restricted covering of digraphs with arborescences. Discret. Math. 82 (2) (1990)
Mao-cheng Cai
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. Discret. Math. 85 (1) (1990)
Mao-cheng Cai
Common root functions of two digraphs. J. Graph Theory 13 (2) (1989)
Mao-cheng Cai
On a problem of Katona on minimal completely separating systems with restrictions. Discret. Math. 48 (1) (1984)
Mao-cheng Cai
On separating systems of graphs. Discret. Math. 49 (1) (1984)
Mao-cheng Cai
Solutions to Edmonds' and Katona's problems on families of separating subsets. Discret. Math. 47 (1983)
Mao-cheng Cai
A counterexample to a conjecture of grant. Discret. Math. 44 (1) (1983)
Mao-cheng Cai
Minimally k-connected graphs of low order and maximal size. Discret. Math. 41 (3) (1982)
Mao-cheng Cai
A new bound on the length of the shortest string containing all r-permutations. Discret. Math. 39 (3) (1982)