Jianxiu Hao

Publication Activity (10 Years)

Years Active: 1990-2023
Publications (10 Years): 3

Top Topics

Design Methodologies

Global Consistency

Top Venues

J. Circuits Syst. Comput.

Publications

Qiancun Zhao, Jiliang Li, Jianxiu Hao, Jianqun Ding, Xianwu Mi, Lijun Huang, Yungui Deng, Juxiang He
Design and Implementation of Chua's Chaotic Circuit Based on an Active Inductor. ICEITSA (2023)
Jianxiu Hao, Xiangliang Jin, Bo Peng
A Novel Bipolar Photon-Controlled Generalized Memristor Based on Avalanche Photodiode. J. Circuits Syst. Comput. 30 (5) (2021)
Jianxiu Hao
The Local Diagnosability of k-Ary n-Cube. Ars Comb. 136 (2018)
Jianxiu Hao, Lili He, Min Huang
PI Index of Extremal Simple Pericondensed Hexagonal Systems. Ars Comb. 106 (2012)
Jianxiu Hao
Theorems About PI Indices. Ars Comb. 106 (2012)
Jianxiu Hao
PI Indices For Some Classes Of Bicyclic Graphs. Ars Comb. 96 (2010)
Jianxiu Hao
The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs. Ars Comb. 96 (2010)
Jianxiu Hao
Some Results About Modified Zagreb Indices. Ars Comb. 96 (2010)
Jianxiu Hao
The Modified Zagreb Indices About Join And Composition Of Graphs. Ars Comb. 95 (2010)
Jianxiu Hao
PI Index of Some Simple Pericondensed Hexagonal Systems. Ars Comb. 92 (2009)
Jianxiu Hao
The PI Index of Gated Amalgam. Ars Comb. 91 (2009)
Jianxiu Hao
Two-Dimensional Bandwidth of Graphs. Ars Comb. 74 (2005)
Shiying Wang, Jianxiu Hao
The extreme set condition of a graph. Discret. Math. 260 (1-3) (2003)
Yan Liu, Jianxiu Hao
The enumeration of near-perfect matchings of factor-critical graphs. Discret. Math. 243 (1-3) (2002)
Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin
Diagnosing infeasibilities in network flow problems. Math. Program. 81 (1998)
Jianxiu Hao, James B. Orlin
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms 17 (3) (1994)
Donald Goldfarb, Jianxiu Hao
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. Discret. Appl. Math. 47 (1) (1993)
Jianxiu Hao, James B. Orlin
A Faster Algorithm for Finding the Minimum Cut in a Graph. SODA (1992)
Donald Goldfarb, Jianxiu Hao
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. Algorithmica 8 (2) (1992)
Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
Shortest path algorithms using dynamic breadth-first search. Networks 21 (1) (1991)
Donald Goldfarb, Jianxiu Hao
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. 10 (7) (1991)
Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
Efficient Shortest Path Simplex Algorithms. Oper. Res. 38 (4) (1990)
Donald Goldfarb, Jianxiu Hao
m) Time. Math. Program. 47 (1990)
Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai
Anti-stalling pivot rules for the network simplex algorithm. Networks 20 (1) (1990)