The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mao-cheng Cai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  35. Restricted Core Stability of Flow Games. [Citation Graph (, )][DBLP]


  36. Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002