Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Lightweight Sybil-Resilient Multi-Robot Networks by Multipath Manipulation., , , , and . CoRR, (2019)A restart local search algorithm for solving maximum set k-covering problem., , , , and . Neural Comput. Appl., 29 (10): 755-765 (2018)Big-data-driven Model Construction and Empirical Analysis of SMEs Credit Assessment in China., , , , , and . IIKI, volume 147 of Procedia Computer Science, page 613-619. Elsevier, (2018)A Fast Local Search Algorithm for Minimum Weight Dominating Set Problem on Massive Graphs., , , and . IJCAI, page 1514-1522. ijcai.org, (2018)An Exact Algorithm for Maximum k-Plexes in Massive Graphs., , , , and . IJCAI, page 1449-1455. ijcai.org, (2018)Nukplex: An Efficient Local Search Algorithm for Maximum K-Plex Problem., , , , , and . IJCAI, page 7029-7037. ijcai.org, (2024)An Investigation of Influencer Marketing Factors and Moderating Effect of Gender on Purchase Intention in the Context of Live Streaming Marketing., , and . ICCBD, page 323-327. ACM, (2024)Two-goal Local Search and Inference Rules for Minimum Dominating Set., , , , and . IJCAI, page 1467-1473. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..A fast local search algorithm for minimum sum coloring problem on massive graphs., , , and . Comput. Oper. Res., (2024)Improving Local Search for Minimum Weighted Connected Dominating Set Problem by Inner-Layer Local Search., , , and . CP, volume 210 of LIPIcs, page 39:1-39:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)