Jianxiu Hao

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