Jianxiu Hao

According to our database, Jianxiu Hao authored at least 24 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Design and Implementation of Chua's Chaotic Circuit Based on an Active Inductor.

Qiancun Zhao, Jiliang Li, Jianxiu Hao, Jianqun Ding, Xianwu Mi, Lijun Huang, Yungui Deng, Juxiang He

Proceedings of the 3rd International Conference on Electronic Information Technology and Smart Agriculture, 2023

2021

A Novel Bipolar Photon-Controlled Generalized Memristor Based on Avalanche Photodiode.

Jianxiu Hao, Xiangliang Jin, Bo Peng

J. Circuits Syst. Comput., 2021

2018

The Local Diagnosability of k-Ary n-Cube.

Jianxiu Hao

Ars Comb., 2018

2012

PI Index of Extremal Simple Pericondensed Hexagonal Systems.

Jianxiu Hao, Lili He, Min Huang

Ars Comb., 2012

Theorems About PI Indices.

Jianxiu Hao

Ars Comb., 2012

2010

The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs.

Jianxiu Hao

Ars Comb., 2010

Some Results About Modified Zagreb Indices.

Jianxiu Hao

Ars Comb., 2010

PI Indices For Some Classes Of Bicyclic Graphs.

Jianxiu Hao

Ars Comb., 2010

The Modified Zagreb Indices About Join And Composition Of Graphs.

Jianxiu Hao

Ars Comb., 2010

2009

PI Index of Some Simple Pericondensed Hexagonal Systems.

Jianxiu Hao

Ars Comb., 2009

The PI Index of Gated Amalgam.

Jianxiu Hao

Ars Comb., 2009

2005

Two-Dimensional Bandwidth of Graphs.

Jianxiu Hao

Ars Comb., 2005

2003

The extreme set condition of a graph.

Shiying Wang, Jianxiu Hao

Discret. Math., 2003

2002

The enumeration of near-perfect matchings of factor-critical graphs.

Yan Liu, Jianxiu Hao

Discret. Math., 2002

1998

Diagnosing infeasibilities in network flow problems.

Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin

Math. Program., 1998

1994

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.

Jianxiu Hao, James B. Orlin

J. Algorithms, 1994

1993

On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.

Donald Goldfarb, Jianxiu Hao

Discret. Appl. Math., 1993

1992

Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem.

Donald Goldfarb, Jianxiu Hao

Algorithmica, 1992

A Faster Algorithm for Finding the Minimum Cut in a Graph.

Jianxiu Hao, James B. Orlin

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1991

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem.

Donald Goldfarb, Jianxiu Hao

Oper. Res. Lett., 1991

Shortest path algorithms using dynamic breadth-first search.

Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai

Networks, 1991

1990

Anti-stalling pivot rules for the network simplex algorithm.

Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai

Networks, 1990

A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n²m) Time.

Donald Goldfarb, Jianxiu Hao

Math. Program., 1990

Efficient Shortest Path Simplex Algorithms.

Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai

Oper. Res., 1990