Xirong Xu
Orcid: 0000-0002-7558-3031
According to our database1,
Xirong Xu
authored at least 55 papers
between 2005 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Efficient hypergraph collective influence maximization in cascading processes based on general threshold model.
Inf. Sci., 2025
2024
Reinforcement learning from constraints and focal entity shifting in conversational KGQA.
Neural Comput. Appl., February, 2024
Knowl. Based Syst., 2024
Influence Maximization in Hypergraphs Using A Genetic Algorithm with New Initialization and Evaluation Methods.
CoRR, 2024
2023
ACM Trans. Asian Low Resour. Lang. Inf. Process., April, 2023
Multigranularity Pruning Model for Subject Recognition Task under Knowledge Base Question Answering When General Models Fail.
Int. J. Intell. Syst., 2023
Root cause and fault propagation analysis based on causal graph in chemical processes.
Proceedings of the CAA Symposium on Fault Detection, 2023
2022
SSMFRP: Semantic Similarity Model for Relation Prediction in KBQA Based on Pre-trained Models.
Proceedings of the Artificial Neural Networks and Machine Learning - ICANN 2022, 2022
2021
Int. J. Found. Comput. Sci., 2021
2019
Int. J. Found. Comput. Sci., 2019
Proceedings of the 15th International Conference on Computational Intelligence and Security, 2019
2018
The Feedback Number of Knodel graph W3, n.
Ars Comb., 2018
IEEE Access, 2018
Proceedings of the IEEE International Conference on Parallel & Distributed Processing with Applications, 2018
2017
The crossing number of pancake graph P<sub>4</sub> is six.
Ars Comb., 2017
An upper bound for the crossing number of locally twisted cubes.
Ars Comb., 2017
Proceedings of the 13th International Conference on Computational Intelligence and Security, 2017
2016
计算机科学, 2016
J. Parallel Distributed Comput., 2016
2015
On the Domination Number of Generalized Petersen Graphs P(ck, k).
Ars Comb., 2015
2014
Graphs Comb., 2014
Feedback Number of Generalized Kautz Digraphs GK(2, n).
Ars Comb., 2014
Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014
Proceedings of the Tenth International Conference on Computational Intelligence and Security, 2014
2013
Int. J. Comput. Math., 2013
Roman domination number of Generalized Petersen Graphs P(n, 2).
Ars Comb., 2013
2012
The crossing numbers of K<sub>m</sub> × P<sub>n</sub> and K<sub>m</sub> × C<sub>n</sub>
CoRR, 2012
The crossing numbers of K<sub>n,n</sub> - nK<sub>2</sub>, K<sub>n</sub> × P<sub>2</sub>, K<sub>n</sub> × P<sub>3</sub> and K<sub>n</sub> × C<sub>4</sub>
CoRR, 2012
2011
On the distance paired domination of generalized Petersen graphs <i>P</i>(<i>n</i>, 1) and <i>P</i>(<i>n</i>, 2).
J. Comb. Optim., 2011
Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering, 2011
Proceedings of the Seventh International Conference on Computational Intelligence and Security, 2011
2010
2009
The Graphs C<sup>(t)</sup><sub>13</sub> are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2009
On (a, d)-Antimagic Labelings of Generalized Petersen Graphs.
Ars Comb., 2009
On the Gracefulness of the Digraphs n-C<sub>m</sub>.
Ars Comb., 2009
2008
The Graphs C(t)11 are Graceful for t = 0, 1 (mod 4).
Ars Comb., 2008
2007
The Graphs C(t)9 are Graceful for t = 0, 3 (mod 4).
Ars Comb., 2007
Super Edge-Magic Labelings of Generalized Petersen Graphs P(n, 3).
Ars Comb., 2007
2006
The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4).
Ars Comb., 2006
2005
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
CoRR, 2005
On Harmonious Labelings of the Balanced Quadruple Shells.
Ars Comb., 2005