Mao-cheng Cai

Graphs Comb., 2022

2018

A Characterization of Box-bounded Degree Sequences of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

2016

Arbitrage in Frictional Foreign Exchange Market.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2009

Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Arbitrage in Frictional Foreign Exchange Market.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The partial inverse minimum spanning tree problem when weight increase is forbidden.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Restricted Core Stability of Flow Games.

[BibT_eX]

[DOI]

Qizhi Fang

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2006

Computation of arbitrage in frictional bond markets.

[BibT_eX]

[DOI]

Zhongfei Li

Theor. Comput. Sci., 2006

2005

Computation of Arbitrage in a Financial Market with Various Types of Frictions.

[BibT_eX]

[DOI]

Zhongfei Li

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2004

Inapproximability and a polynomially solvable special case of a network improvement problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2004

A Network Improvement Problem Under Different Norms.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2004

Minimum k Arborescences with Bandwidth Constraints.

[BibT_eX]

[DOI]

Lusheng Wang

Algorithmica, 2004

2003

Approximate sequencing for variable length tasks.

[BibT_eX]

[DOI]

Lusheng Wang

Theor. Comput. Sci., 2003

Approximation and Computation of Arbitrage in Frictional Foreign Exchange Market.

[BibT_eX]

[DOI]

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

Total Balancedness Condition for Steiner Tree Games.

[BibT_eX]

[DOI]

Qizhi Fang

Discret. Appl. Math., 2003

2002

On computational complexity of membership test in flow games and linear production games.

[BibT_eX]

[DOI]

Int. J. Game Theory, 2002

Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

Upper bounds for the k-subdomination number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001

On quasifactorability in graphs.

[BibT_eX]

[DOI]

Evelyne Flandrin

Hao Li

Discret. Math., 2001

Membership for Core of LP Games and Other Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

An Approximation Algorithm for Feedback Vertex Sets in Tournaments.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

The number of vertices of degree k in a minimally k-edge-connected digraph.

[BibT_eX]

[DOI]

Xudong Yuan

J. Graph Theory, 2000

Vertices of degree k in a minimally k-edge-connected digraph.

[BibT_eX]

[DOI]

Xudong Yuan

Discret. Math., 2000

Upper minus domination in regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Solution to a problem on degree sequences of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

1999

The Complexity Analysis of the Inverse Center Location Problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 1999

Inverse Polymatroidal Flow Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Inverse Problems of Matroid Intersection.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

(3, k)-Factor-Critical Graphs and Toughness.

[BibT_eX]

[DOI]

Graphs Comb., 1999

(2, k)-Factor-Critical Graphs and Toughness.

[BibT_eX]

[DOI]

Odile Favaron

Hao Li

Graphs Comb., 1999

A [k, k+1]-Factor Containing A Given Hamiltonian Cycle.

[BibT_eX]

[DOI]

Mikio Kano

Electron. J. Comb., 1999

Reverse Center Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

A Min-Max Theorem on Feedback Vertex Sets.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Inverse problem of minimum cuts.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1998

A degree condition for a graph to have [a, b]-factors.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

A TDI System and its Application to Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Inverse Matroid Intersection Problem.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 1997

Connected [k, k + 1]-factors of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

A degree condition for the existence of connected factors.

[BibT_eX]

[DOI]

Australas. J Comb., 1996

1995

An eulerian trail traversing specified edges in given order.

[BibT_eX]

[DOI]

Herbert Fleischner

J. Graph Theory, 1995

1994

An Algorithm for an Eulerian Trail Traversing Specified Edges in Given order.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

The Number of Vertices of Degree k in a Minimally k-Edge-Connected Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

An algorithm for optimum common root functions of two digraphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

A remark on the number of vertices of degree k in a minimally k-edge-connected graph.

[BibT_eX]

[DOI]

Discret. Math., 1992

1991

On some factor theorems of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

1990

The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices.

[BibT_eX]

[DOI]

Discret. Math., 1990

Restricted covering of digraphs with arborescences.

[BibT_eX]

[DOI]

Discret. Math., 1990

1989

Common root functions of two digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1989

1984

On a problem of Katona on minimal completely separating systems with restrictions.

[BibT_eX]

[DOI]

Discret. Math., 1984

On separating systems of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

1983

Solutions to Edmonds' and Katona's problems on families of separating subsets.

[BibT_eX]

[DOI]

Discret. Math., 1983

A counterexample to a conjecture of grant.

[BibT_eX]

[DOI]

Discret. Math., 1983

1982

Minimally k-connected graphs of low order and maximal size.

[BibT_eX]

[DOI]

Discret. Math., 1982

A new bound on the length of the shortest string containing all r-permutations.

[BibT_eX]

[DOI]