Mao-cheng Cai

60 papers A* 1B 3C 1Misc 2Journal 49Unranked 2
YearRankTypeTitle / Venue / Authors
2022 J jnl
Solution to a Forcible Version of a Graphic Sequence Problem.
Graphs Comb.
Mao-cheng Cai, Liying Kang
2018 J jnl
A Characterization of Box-bounded Degree Sequences of Graphs.
Graphs Comb.
Mao-cheng Cai, Liying Kang
2016 — ch.
Arbitrage in Frictional Foreign Exchange Market.
Encyclopedia of Algorithms
Mao-cheng Cai, Xiaotie Deng
2011 J jnl
Shortest path and maximum flow problems in networks with additive losses and gains.
Theor. Comput. Sci.
Franz-Josef Brandenburg, Mao-cheng Cai
2009 Misc conf
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.
FAW
Franz-Josef Brandenburg, Mao-cheng Cai
2008 — ch.
Arbitrage in Frictional Foreign Exchange Market.
Encyclopedia of Algorithms
Mao-cheng Cai, Xiaotie Deng
2008 — conf
Restricted Core Stability of Flow Games.
WINE
Mao-cheng Cai, Qizhi Fang
2008 J jnl
The partial inverse minimum spanning tree problem when weight increase is forbidden.
Eur. J. Oper. Res.
Mao-cheng Cai, C. W. Duin, Xiaoguang Yang, Jianzhong Zhang
2006 J jnl
Computation of arbitrage in frictional bond markets.
Theor. Comput. Sci.
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li
2005 C conf
Computation of Arbitrage in a Financial Market with Various Types of Frictions.
AAIM
Mao-cheng Cai, Xiaotie Deng, Zhongfei Li
2004 J jnl
A Network Improvement Problem Under Different Norms.
Comput. Optim. Appl.
Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
2004 J jnl
Inapproximability and a polynomially solvable special case of a network improvement problem.
Eur. J. Oper. Res.
Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
2004 J jnl
Minimum k Arborescences with Bandwidth Constraints.
Algorithmica
Mao-cheng Cai, Xiaotie Deng, Lusheng Wang
2003 J jnl
Approximate sequencing for variable length tasks.
Theor. Comput. Sci.
Mao-cheng Cai, Xiaotie Deng, Lusheng Wang
2003 — conf
Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market.
CATS
Mao-cheng Cai, Xiaotie Deng
2003 J jnl
Total Balancedness Condition for Steiner Tree Games.
Discret. Appl. Math.
Qizhi Fang, Mao-cheng Cai, Xiaotie Deng
2002 J jnl
A Min-Max Theorem on Feedback Vertex Sets.
Math. Oper. Res.
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
2002 B conf
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
IPCO
Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu
2002 J jnl
Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective.
Int. J. Found. Comput. Sci.
Xiaoguang Yang, Shuo Tao, Rongjun Liu, Mao-cheng Cai
2002 J jnl
On computational complexity of membership test in flow games and linear production games.
Int. J. Game Theory
Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng
2002 J jnl
Upper bounds for the
Discret. Math.
Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan
2001 Misc conf
Membership for Core of LP Games and Other Games.
COCOON
Qizhi Fang, Shanfeng Zhu, Mao-cheng Cai, Xiaotie Deng
2001 J jnl
On quasifactorability in graphs.
Discret. Math.
Mao-cheng Cai, Evelyne Flandrin, Hao Li
2000 J jnl
An Approximation Algorithm for Feedback Vertex Sets in Tournaments.
SIAM J. Comput.
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
2000 J jnl
Solution to a problem on degree sequences of graphs.
Discret. Math.
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
2000 J jnl
The number of vertices of degree
J. Graph Theory
Xudong Yuan, Liying Kang, Mao-cheng Cai
2000 J jnl
Upper minus domination in regular graphs.
Discret. Math.
Liying Kang, Mao-cheng Cai
2000 J jnl
Vertices of degree k in a minimally k-edge-connected digraph.
Discret. Math.
Xudong Yuan, Mao-cheng Cai
1999 J jnl
(2, k)-Factor-Critical Graphs and Toughness.
Graphs Comb.
Mao-cheng Cai, Odile Favaron, Hao Li
1999 J jnl
(3, k)-Factor-Critical Graphs and Toughness.
Graphs Comb.
Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron
1999 B conf
A Min-Max Theorem on Feedback Vertex Sets.
IPCO
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
1999 J jnl
A [k, k+1]-Factor Containing A Given Hamiltonian Cycle.
Electron. J. Comb.
Mao-cheng Cai, Yanjun Li, Mikio Kano
1999 J jnl
Inverse Polymatroidal Flow Problem.
J. Comb. Optim.
Mao-cheng Cai, Xiaoguang Yang, Yanjun Li
1999 J jnl
Inverse Problems of Matroid Intersection.
J. Comb. Optim.
Mao-cheng Cai
1999 B conf
Reverse Center Location Problem.
ISAAC
Jianzhong Zhang, Xiaoguang Yang, Mao-cheng Cai
1999 J jnl
The Complexity Analysis of the Inverse Center Location Problem.
J. Glob. Optim.
Mao-cheng Cai, Xiaoguang Yang, Jianzhong Zhang
1998 A* conf
A TDI System and its Application to Approximation Algorithms.
FOCS
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
1998 J jnl
A degree condition for a graph to have [
J. Graph Theory
Yanjun Li, Mao-cheng Cai
1998 J jnl
Inverse problem of minimum cuts.
Math. Methods Oper. Res.
Jianzhong Zhang, Mao-cheng Cai
1997 J jnl
Connected [k, k + 1]-factors of graphs.
Discret. Math.
Mao-cheng Cai
1997 J jnl
Inverse Matroid Intersection Problem.
Math. Methods Oper. Res.
Mao-cheng Cai, Yanjun Li
1996 J jnl
A degree condition for the existence of connected factors.
Australas. J Comb.
Yanjun Li, Mao-cheng Cai
1995 J jnl
An eulerian trail traversing specified edges in given order.
J. Graph Theory
Mao-cheng Cai, Herbert Fleischner
1994 J jnl
An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order.
Discret. Appl. Math.
Mao-cheng Cai
1993 J jnl
An algorithm for optimum common root functions of two digraphs.
Discret. Math.
Mao-cheng Cai
1993 J jnl
The Number of Vertices of Degree
J. Comb. Theory B
Mao-cheng Cai
1992 J jnl
A remark on the number of vertices of degree k in a minimally k-edge-connected graph.
Discret. Math.
Mao-cheng Cai
1991 J jnl
On some factor theorems of graphs.
Discret. Math.
Mao-cheng Cai
1991 J jnl
[
J. Graph Theory
Mao-cheng Cai
1990 J jnl
Restricted covering of digraphs with arborescences.
Discret. Math.
Mao-cheng Cai
1990 J jnl
The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices.
Discret. Math.
Mao-cheng Cai
1989 J jnl
Common root functions of two digraphs.
J. Graph Theory
Mao-cheng Cai
1984 J jnl
On a problem of Katona on minimal completely separating systems with restrictions.
Discret. Math.
Mao-cheng Cai
1984 J jnl
On separating systems of graphs.
Discret. Math.
Mao-cheng Cai
1983 J jnl
A counterexample to a conjecture of grant.
Discret. Math.
Mao-cheng Cai
1983 J jnl
Arc-disjoint arborescences of digraphs.
J. Graph Theory
Mao-cheng Cai
1983 J jnl
Solutions to Edmonds' and Katona's problems on families of separating subsets.
Discret. Math.
Mao-cheng Cai
1982 J jnl
A new bound on the length of the shortest string containing all r-permutations.
Discret. Math.
Mao-cheng Cai
1982 J jnl
Minimally k-connected graphs of low order and maximal size.
Discret. Math.
Mao-cheng Cai
1982 J jnl
The maximum number of arc-disjoint arborescences in a tournament.
J. Graph Theory
Chung-Fan Ma, Mao-cheng Cai