( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fractional matching number and spectral radius of nonnegative matrix of graphs

, , , и . (2020)cite arxiv:2002.00370.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Xue-Jie Zhang

Xue Xue Zhang

Zhou Jie

Yucheng Jie

Cheng Xue

 

Другие публикации лиц с тем же именем

Global Soil Salinity Prediction by Open Soil Vis-NIR Spectral Library., , , , , , , , , и 2 other автор(ы). Remote. Sens., 14 (21): 5627 (2022)Sparsity-Based Spatiotemporal Fusion via Adaptive Multi-Band Constraints., , , , и . Remote. Sens., 10 (10): 1646 (2018)Lattice Based Communication P Systems., , и . J. Adv. Comput. Intell. Intell. Informatics, 27 (6): 1130-1136 (ноября 2023)Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs., , , , и . SODA, стр. 2063-2084. SIAM, (2022)Fair Covering of Points by Balls., , , и . CCCG, стр. 26-32. (2020)An Improved Quicksort Algorithm Based on Tissue-Like P Systems with Promoters., , и . Int. Conf. on Membrane Computing, том 11399 из Lecture Notes in Computer Science, стр. 258-274. Springer, (2018)The Research on the Application Strategies of Information and Communication Technologies to Promote the Knowledge Transfer in Regional Innovation System., и . APSCC, стр. 138-145. IEEE Computer Society, (2006)Optimal Algorithm for the Planar Two-Center Problem., , , и . SoCG, том 293 из LIPIcs, стр. 40:1-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3., , , , и . APPROX/RANDOM, том 317 из LIPIcs, стр. 6:1-6:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs., , , , и . SoCG, том 224 из LIPIcs, стр. 11:1-11:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)