The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jianxiu Hao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.003secs, Finished in 0.004secs
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