![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jianping Ou
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j23]Yilan Cui, Jianping Ou, Saihua Liu
:
On 3-Restricted Edge Connectivity of Replacement Product Graphs. Axioms 12(5): 504 (2023) - 2021
- [j22]Ji Li, Huiqiang Zhang, Jianping Ou
, Wei Wang
:
A Multipulse Radar Signal Recognition Approach via HRF-Net Deep Learning Models. Comput. Intell. Neurosci. 2021: 9955130:1-9955130:9 (2021) - 2020
- [j21]Ji Li, Huiqiang Zhang, Jianping Ou
, Wei Wang
:
A Radar Signal Recognition Approach via IIF-Net Deep Learning Models. Comput. Intell. Neurosci. 2020: 8858588:1-8858588:8 (2020) - [j20]Wei Wang, Chengwen Zhang, Jinge Tian, Jianping Ou
, Ji Li
:
A SAR Image Target Recognition Approach via Novel SSF-Net Models. Comput. Intell. Neurosci. 2020: 8859172:1-8859172:9 (2020) - [j19]Wei Wang
, Chengwen Zhang, Jinge Tian, Xin Wang
, Jianping Ou, Jun Zhang
, Ji Li
:
High-Resolution Radar Target Recognition via Inception-Based VGG (IVGG) Networks. Comput. Intell. Neurosci. 2020: 8893419:1-8893419:11 (2020)
2010 – 2019
- 2017
- [c2]Zhikun Liao, Jiemin Hu, Dawei Lu, Jianping Ou, Jun Zhang:
A novel motion compensation method for random frequency hopping radar. CISP-BMEI 2017: 1-6 - 2015
- [j18]Jianping Ou, Weisheng Zhao:
On restricted edge connectivity of strong product graphs. Ars Comb. 123: 55-64 (2015) - 2014
- [j17]Weisheng Zhao, Jianping Ou:
On restricted edge-connectivity of lexicographic product graphs. Int. J. Comput. Math. 91(8): 1618-1626 (2014) - [j16]Jianping Ou, Xing Feng, Saihua Liu:
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree. J. Appl. Math. 2014: 316108:1-316108:9 (2014) - [c1]Min Lu, Jian Zhao, Yulan Guo, Jianping Ou, Jonathan Li
:
A 3D pointcloud registration algorithm based on fast coherent point drift. AIPR 2014: 1-6 - 2013
- [j15]Yingying Qin, Jianping Ou, Zhiping Xiong:
On equality of restricted edge connectivity and minimum edge degree of graphs. Ars Comb. 110: 65-70 (2013) - [j14]Jichang Wu, Jianping Ou:
On Edge Cut of Graphs Leaving Components of Order at Least Five. Graphs Comb. 29(6): 1973-1981 (2013) - [j13]Jianping Ou, Jiqing Li:
On m-restricted edge connectivity of undirected generalized De Bruijn graphs. Int. J. Comput. Math. 90(11): 2259-2264 (2013) - 2012
- [j12]Yingying Qin, Jianping Ou, Zhiping Xiong:
On 3-restricted edge connectivity of Cartesian product graphs. Ars Comb. 103: 233-238 (2012) - [j11]Yingying Qin, Jianping Ou:
Sufficient conditions for maximally restricted edge connected graphs. Discret. Math. 312(19): 2969-2972 (2012) - [j10]Tiedan Zhu, Jianping Ou:
On Arc Connectivity of Direct-Product Digraphs. J. Appl. Math. 2012: 424023:1-424023:6 (2012) - 2011
- [j9]Jianping Ou:
On optimizing edge connectivity of product graphs. Discret. Math. 311(6): 478-492 (2011) - 2010
- [j8]Jingyu Wang, Jianping Ou, Tiedan Zhu:
On restricted edge connectivity of regular Cartesian product graphs. Australas. J Comb. 48: 111-116 (2010) - [j7]Jianping Ou:
On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks. Appl. Math. Comput. 217(6): 2602-2607 (2010) - [j6]Jianping Ou:
Acyclic molecules with second maximal energy. Appl. Math. Lett. 23(4): 343-346 (2010) - [j5]Jianping Ou:
On maximal 3-restricted edge connectivity of regular graphs. Int. J. Comput. Math. 87(14): 3149-3156 (2010)
2000 – 2009
- 2009
- [j4]Jianping Ou:
On extremal unicyclic molecular graphs with maximal Hosoya index. Discret. Appl. Math. 157(2): 391-397 (2009) - [j3]Jianping Ou, Xiaohong Cheng, Jichang Wu:
On 3-restricted edge connectivity of undirected binary Kautz graphs. Discret. Math. 309(4): 629-638 (2009) - 2005
- [j2]Jianping Ou:
Edge cuts leaving components of order at least m. Discret. Math. 305(1-3): 365-371 (2005) - 2004
- [j1]Jianping Ou:
4-restricted edge cuts of graphs. Australas. J Comb. 30: 103-112 (2004)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 2024-08-16 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint