Jianxiu Hao

Orcid: 0009-0004-9134-8754

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Design and Implementation of Chua's Chaotic Circuit Based on an Active Inductor.
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.
J. Circuits Syst. Comput., 2021

2018
The Local Diagnosability of k-Ary n-Cube.
Ars Comb., 2018

2012
PI Index of Extremal Simple Pericondensed Hexagonal Systems.
Ars Comb., 2012

Theorems About PI Indices.
Ars Comb., 2012

2010
The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs.
Ars Comb., 2010

Some Results About Modified Zagreb Indices.
Ars Comb., 2010

PI Indices For Some Classes Of Bicyclic Graphs.
Ars Comb., 2010

The Modified Zagreb Indices About Join And Composition Of Graphs.
Ars Comb., 2010

2009
PI Index of Some Simple Pericondensed Hexagonal Systems.
Ars Comb., 2009

The PI Index of Gated Amalgam.
Ars Comb., 2009

2005
Two-Dimensional Bandwidth of Graphs.
Ars Comb., 2005

2003
The extreme set condition of a graph.
Discret. Math., 2003

2002
The enumeration of near-perfect matchings of factor-critical graphs.
Discret. Math., 2002

1998
Diagnosing infeasibilities in network flow problems.
Math. Program., 1998

1994
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph.
J. Algorithms, 1994

1993
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem.
Discret. Appl. Math., 1993

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

A Faster Algorithm for Finding the Minimum Cut in a Graph.
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.
Oper. Res. Lett., 1991

Shortest path algorithms using dynamic breadth-first search.
Networks, 1991

1990
Anti-stalling pivot rules for the network simplex algorithm.
Networks, 1990

A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n<sup>2</sup>m) Time.
Math. Program., 1990

Efficient Shortest Path Simplex Algorithms.
Oper. Res., 1990


  Loading...