 | 2005 |
|---|
| 9 |       | Jianxiu Hao:
Two-Dimensional Bandwidth of Graphs.
Ars Comb. 74: (2005) |
| 2003 |
|---|
| 8 |  | Shiying Wang,
Jianxiu Hao:
The extreme set condition of a graph.
Discrete Mathematics 260(1-3): 151-161 (2003) |
| 2002 |
|---|
| 7 | | Yan Liu,
Jianxiu Hao:
The enumeration of near-perfect matchings of factor-critical graphs.
Discrete Mathematics 243(1-3): 259-266 (2002) |
| 1998 |
|---|
| 6 | | Charu C. Aggarwal,
Ravindra K. Ahuja,
Jianxiu Hao,
James B. Orlin:
Diagnosing infeasibilities in network flow problems.
Math. Program. 81: 263-280 (1998) |
| 1994 |
|---|
| 5 | | Jianxiu Hao,
James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.
J. Algorithms 17(3): 424-446 (1994) |
| 1993 |
|---|
| 4 | | Donald Goldfarb,
Jianxiu Hao:
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.
Discrete Applied Mathematics 47(1): 9-16 (1993) |
| 1992 |
|---|
| 3 | | Jianxiu Hao,
James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Graph.
SODA 1992: 165-174 |
| 2 | | Donald Goldfarb,
Jianxiu Hao:
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem.
Algorithmica 8(2): 145-160 (1992) |
| 1990 |
|---|
| 1 | | Donald Goldfarb,
Jianxiu Hao:
A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2m) Time.
Math. Program. 47: 353-365 (1990) |
