default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXingqin Qi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Jianliang Wu, Xingqin Qi, Zhulou Cao
:
H-sequences and 2-step coreness in graphs. Discret. Appl. Math. 343: 258-268 (2024)- [c4]Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi:
Offensive Alliances in Signed Graphs. TAMC 2024: 234-246 - 2023
- [j15]Zhidan Feng, Zhulou Cao, Xingqin Qi:
Generalized network dismantling via a novel spectral partition algorithm. Inf. Sci. 632: 285-298 (2023) - [j14]Jiaqi Song, Xingqin Qi, Zhulou Cao:
An Independent Cascade Model of Graph Burning. Symmetry 15(8): 1527 (2023) - [i2]Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf:
Defensive Alliances in Signed Networks. CoRR abs/2309.06801 (2023) - [i1]Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi:
Offensive Alliances in Signed Graphs. CoRR abs/2312.11960 (2023) - 2021
- [j13]Haoyu Wang, Xingqin Qi:
V-E Algorithm: A New Vital Vertex Identifying Algorithm Based on Vertex-Edge Interaction. Asia Pac. J. Oper. Res. 38(5): 2140013:1-2140013:23 (2021) - [j12]Yan Xu, Zhidan Feng, Xingqin Qi:
Signless-laplacian eigenvector centrality: A novel vital nodes identification method for complex networks. Pattern Recognit. Lett. 148: 7-14 (2021) - 2020
- [j11]Min Fan, Zhulou Cao, Jieting Cheng, Fang Yang, Xingqin Qi:
Degree-like centrality with structural zeroes or ones: When is a neighbor not a neighbor? Soc. Networks 63: 38-46 (2020)
2010 – 2019
- 2018
- [j10]Min Liu, Zhen Xiong, Yue Ma, Peng Zhang, Jianliang Wu, Xingqin Qi:
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix. Future Gener. Comput. Syst. 83: 376-389 (2018) - 2016
- [j9]Xingqin Qi, Ruth Luo, Edgar Fuller, Rong Luo, Cun-Quan Zhang:
Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges. Int. J. Pattern Recognit. Artif. Intell. 30(3): 1650006:1-1650006:20 (2016) - 2015
- [j8]Xingqin Qi, Edgar Fuller, Rong Luo, Guodong Guo, Cun-Quan Zhang:
Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm. Int. J. Found. Comput. Sci. 26(3): 367-380 (2015) - [j7]Xingqin Qi, Edgar Fuller, Rong Luo, Cun-Quan Zhang:
A novel centrality method for weighted networks based on the Kirchhoff polynomial. Pattern Recognit. Lett. 58: 51-60 (2015) - 2014
- [j6]Xingqin Qi, Wenliang Tang, Yezhou Wu, Guodong Guo, Eddie Fuller, Cun-Quan Zhang:
Optimal local community detection in social networks based on density drop of subgraphs. Pattern Recognit. Lett. 36: 46-53 (2014) - 2012
- [j5]Xingqin Qi, Eddie Fuller, Qin Wu, Yezhou Wu, Cun-Quan Zhang:
Laplacian centrality: A new centrality measure for weighted networks. Inf. Sci. 194: 240-253 (2012) - 2011
- [c3]Qin Wu, Robert Duval, Edgar Fuller, Xingqin Qi, Cun-Quan Zhang, Arian Spahiu, Kyle Christensen:
Modeling Network Changes: Systemic Centrality in Foreign Policy Interaction Analysis. ASONAM 2011: 690-695 - 2010
- [j4]Xingqin Qi, Guojun Li, Shuguang Li, Ying Xu:
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 365-374 (2010) - [c2]Xingqin Qi, Kyle Christensen, Robert Duval, Edgar Fuller, Arian Spahiu, Qin Wu, Cun-Quan Zhang:
A Hierarchical Algorithm for Clustering Extremist Web Pages. ASONAM 2010: 458-463
2000 – 2009
- 2008
- [j3]Xingqin Qi, Jichang Wu, Shuguang Li, Guojun Li:
Sorting by transpositions: dealing with length-weighted models. Int. J. Bioinform. Res. Appl. 4(2): 164-171 (2008) - 2006
- [j2]Xingqin Qi, Guojun Li, Jichang Wu, Bingqiang Liu:
Sorting Signed Permutations by Fixed-length Reversals. Int. J. Found. Comput. Sci. 17(4): 933-948 (2006) - [j1]Shuguang Li, Guojun Li, Xingqin Qi:
Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines. Int. J. Found. Comput. Sci. 17(6): 1441-1454 (2006) - 2004
- [c1]Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu:
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes. CPM 2004: 323-332
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 2024-10-07 22:05 CEST 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:
