Best Paper Award
Dear Colleagues,
We are pleased to announce the winner of the Algorithms 2021 Best Paper Award. All papers published between 1 January 2021 and 31 December 2021 in Algorithms were considered for the award. After a thorough evaluation of papers’ originality and significance, citations, and downloads, the winning paper has been selected.
Paper Title: An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks
By Salim Bouamama and Christian Blum
Volume 14, Issue 3, doi: 10.3390/a14030079
The corresponding author will receive CHF 500 and have the opportunity to publish a paper in Algorithms in 2022.
On behalf of the assessment committee, I congratulate the winner on their accomplishments. I would like to thank all the nominated research groups for their contributions to Algorithms and the Award Committee for their efforts in the evaluation process.
Kind regards,
Prof. Dr. Frank Werner, Editor-in-Chief of Algorithms
Eligibility and Requirements
– All papers published in Algorithms will be eligible (Both regular and Special Issue submissions).
Winner
Award Committee
Winner
Award Committee
Winner
