Mao-Cheng Cai

From MaRDI portal
Person:1055784

Available identifiers

zbMath Open cai.maochengMaRDI QIDQ1055784

List of research outcomes





PublicationDate of PublicationType
Solution to a forcible version of a graphic sequence problem2022-05-25Paper
https://portal.mardi4nfdi.de/entity/Q50624602022-03-17Paper
A characterization of box-bounded degree sequences of graphs2018-09-14Paper
Approximation and computation of arbitrage in frictional foreign exchange market (extended abstract)2013-08-27Paper
Shortest path and maximum flow problems in networks with additive losses and gains2011-02-02Paper
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains2009-07-14Paper
The partial inverse minimum spanning tree problem when weight increase is forbidden2008-02-13Paper
Computation of arbitrage in frictional bond markets2007-01-09Paper
Algorithmic Applications in Management2005-11-30Paper
Existence of Hamiltonian \(k\)-factor2005-11-21Paper
A Min-Max Theorem on Feedback Vertex Sets2005-11-11Paper
Some new results on multi-dimension Knapsack problem2005-09-01Paper
COMPLEXITY OF SCENARIO-BASED PORTFOLIO OPTIMIZATION PROBLEM WITH VaR OBJECTIVE2005-06-22Paper
Minimum \(k\) arborescences with bandwidth constraints2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47375352004-08-11Paper
A network improvement problem under different norms2004-05-27Paper
Inapproximability and a polynomially solvable special case of a network improvement problem.2004-03-14Paper
On computational complexity of membership test in flow games and linear production games2003-11-23Paper
Approximate sequencing for variable length tasks.2003-08-17Paper
Total balancedness condition for Steiner tree games.2003-06-10Paper
https://portal.mardi4nfdi.de/entity/Q45513632002-09-05Paper
Upper bounds for the \(k\)-subdomination number of graphs2002-05-28Paper
Some results on universal minimal total dominating functions2002-05-07Paper
Minus domination number in cubic graph2002-02-18Paper
Tree decomposition2002-02-18Paper
https://portal.mardi4nfdi.de/entity/Q47096462002-01-01Paper
Inverse problems of submodular functions on digraphs2001-08-27Paper
On quasifactorability in graphs2001-07-02Paper
An approximation algorithm for feedback vertex sets in tournaments2001-06-21Paper
Edge-forwarding indices of \(2\)-edge-connected graphs.2001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q45112322001-03-06Paper
Solution to a problem on degree sequences of graphs2000-12-13Paper
Applications of matroid partition to tree decomposition2000-11-29Paper
Upper minus domination in regular graphs2000-11-19Paper
https://portal.mardi4nfdi.de/entity/Q49465452000-09-24Paper
Inverse problem of minimum cuts2000-08-07Paper
Vertices of degree \(k\) in a minimally \(k\)-edge-connected digraph2000-07-24Paper
\((3, k)\)-factor-critical graphs and toughness2000-07-05Paper
Inverse problems of matroid intersection2000-03-19Paper
\((2,k)\)-factor-critical graphs and toughness2000-02-09Paper
The complexity analysis of the inverse center location problem2000-01-05Paper
https://portal.mardi4nfdi.de/entity/Q42637031999-11-21Paper
Inverse polymatroidal flow problem1999-09-22Paper
A \([k,k+1]\)-factor containing a given Hamiltonian cycle1999-02-02Paper
https://portal.mardi4nfdi.de/entity/Q43764981998-07-06Paper
https://portal.mardi4nfdi.de/entity/Q31291891997-10-30Paper
Inverse matroid intersection problem1997-08-05Paper
Connected \([k,k+1]\)-factors of graphs1997-06-16Paper
https://portal.mardi4nfdi.de/entity/Q52846431997-01-22Paper
An eulerian trail traversing specified edges in given order1996-11-27Paper
https://portal.mardi4nfdi.de/entity/Q48876741996-11-24Paper
https://portal.mardi4nfdi.de/entity/Q48675751996-03-20Paper
https://portal.mardi4nfdi.de/entity/Q48521421995-11-26Paper
https://portal.mardi4nfdi.de/entity/Q43227121995-03-19Paper
An algorithm for an Eulerian trail traversing specified edges in given order1995-02-01Paper
An algorithm for optimum common root functions of two digraphs1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q52888851993-09-02Paper
A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph1993-01-16Paper
On some factor theorems of graphs1992-06-28Paper
[a,b]‐factorizations of graphs1992-06-25Paper
The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices1992-06-25Paper
The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph1992-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33602141990-01-01Paper
Restricted covering of digraphs with arborescences1990-01-01Paper
Common root functions of two digraphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30308541987-01-01Paper
A solution of Chartrand's problem on spanning trees1984-01-01Paper
On a problem of Katona on minimal completely separating systems with restrictions1984-01-01Paper
On separating systems of graphs1984-01-01Paper
A counterexample to a conjecture of Grant1983-01-01Paper
Arc‐disjoint arborescences of digraphs1983-01-01Paper
Solutions to Edmonds' and Katona's problems on families of separating subsets1983-01-01Paper
Minimally k-connected graphs of low order and maximal size1982-01-01Paper
A new bound on the length of the shortest string containing all r- permutations1982-01-01Paper
The maximum number of arc-disjoint arborescences in a tournament1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39562231982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569651982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39272571981-01-01Paper
Optimum Restricted Base of a Matroid1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39344111980-01-01Paper

Research outcomes over time

This page was built for person: Mao-Cheng Cai