Xingqin Qi

According to our database1, Xingqin Qi authored at least 13 papers between 2004 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix.
Future Generation Comp. Syst., 2018

2016
Signed Quasi-Clique Merger: A New Clustering Method for Signed Networks with Positive and Negative Edges.
IJPRAI, 2016

2015
A novel centrality method for weighted networks based on the Kirchhoff polynomial.
Pattern Recognition Letters, 2015

Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm.
Int. J. Found. Comput. Sci., 2015

2014
Optimal local community detection in social networks based on density drop of subgraphs.
Pattern Recognition Letters, 2014

2012
Laplacian centrality: A new centrality measure for weighted networks.
Inf. Sci., 2012

2011
Modeling Network Changes: Systemic Centrality in Foreign Policy Interaction Analysis.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2011

2010
Sorting Genomes by Reciprocal Translocations, Insertions, and Deletions.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

A Hierarchical Algorithm for Clustering Extremist Web Pages.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010

2008
Sorting by transpositions: dealing with length-weighted models.
IJBRA, 2008

2006
Sorting Signed Permutations by Fixed-length Reversals.
Int. J. Found. Comput. Sci., 2006

Minimizing Total Weighted Completion Time on Identical Parallel Batch Machines.
Int. J. Found. Comput. Sci., 2006

2004
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004


  Loading...