default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJianxiu Hao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c2]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: 148-154- 2021
- [j22]Jianxiu Hao, Xiangliang Jin, Bo Peng:
A Novel Bipolar Photon-Controlled Generalized Memristor Based on Avalanche Photodiode. J. Circuits Syst. Comput. 30(5): 2150090:1-2150090:18 (2021)
2010 – 2019
- 2018
- [j21]Jianxiu Hao:
The Local Diagnosability of k-Ary n-Cube. Ars Comb. 136: 317-325 (2018) - 2012
- [j20]Jianxiu Hao, Lili He, Min Huang:
PI Index of Extremal Simple Pericondensed Hexagonal Systems. Ars Comb. 106: 33-46 (2012) - [j19]Jianxiu Hao:
Theorems About PI Indices. Ars Comb. 106: 521-526 (2012) - 2010
- [j18]Jianxiu Hao:
The Modified Zagreb Indices About Join And Composition Of Graphs. Ars Comb. 95 (2010) - [j17]Jianxiu Hao:
PI Indices For Some Classes Of Bicyclic Graphs. Ars Comb. 96 (2010) - [j16]Jianxiu Hao:
Some Results About Modified Zagreb Indices. Ars Comb. 96 (2010) - [j15]Jianxiu Hao:
The Modified Zagreb Indices About Disjunction And Symmetric Difference Of Graphs. Ars Comb. 96 (2010)
2000 – 2009
- 2009
- [j14]Jianxiu Hao:
The PI Index of Gated Amalgam. Ars Comb. 91 (2009) - [j13]Jianxiu Hao:
PI Index of Some Simple Pericondensed Hexagonal Systems. Ars Comb. 92 (2009) - 2005
- [j12]Jianxiu Hao:
Two-Dimensional Bandwidth of Graphs. Ars Comb. 74 (2005) - 2003
- [j11]Shiying Wang, Jianxiu Hao:
The extreme set condition of a graph. Discret. Math. 260(1-3): 151-161 (2003) - 2002
- [j10]Yan Liu, Jianxiu Hao:
The enumeration of near-perfect matchings of factor-critical graphs. Discret. Math. 243(1-3): 259-266 (2002)
1990 – 1999
- 1998
- [j9]Charu C. Aggarwal, Ravindra K. Ahuja, Jianxiu Hao, James B. Orlin:
Diagnosing infeasibilities in network flow problems. Math. Program. 81: 263-280 (1998) - 1994
- [j8]Jianxiu Hao, James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph. J. Algorithms 17(3): 424-446 (1994) - 1993
- [j7]Donald Goldfarb, Jianxiu Hao:
On the Maximum Capacity Augmentation Algorithm for the Maximum Flow Problem. Discret. Appl. Math. 47(1): 9-16 (1993) - 1992
- [j6]Donald Goldfarb, Jianxiu Hao:
Polynomial-Time Primal Simplex Algorithms for the Minimum Cost Network Flow Problem. Algorithmica 8(2): 145-160 (1992) - [c1]Jianxiu Hao, James B. Orlin:
A Faster Algorithm for Finding the Minimum Cut in a Graph. SODA 1992: 165-174 - 1991
- [j5]Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Shortest path algorithms using dynamic breadth-first search. Networks 21(1): 29-50 (1991) - [j4]Donald Goldfarb, Jianxiu Hao:
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. Oper. Res. Lett. 10(7): 383-387 (1991) - 1990
- [j3]Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Efficient Shortest Path Simplex Algorithms. Oper. Res. 38(4): 624-628 (1990) - [j2]Donald Goldfarb, Jianxiu Hao:
A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n2m) Time. Math. Program. 47: 353-365 (1990) - [j1]Donald Goldfarb, Jianxiu Hao, Sheng-Roan Kai:
Anti-stalling pivot rules for the network simplex algorithm. Networks 20(1): 79-91 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
