Best Paper Award

Thank you for your continuous support. We regret to inform you that the deadline for announcing the winner of the 2023 Best Paper Award has been postponed to 30th April 2025.

The Editorial Office would like to apologize for any inconvenience caused. If you have any questions, please do not hesitate to contact us.


Algorithms Best Paper Award is granted annually to highlight publications of high quality, scientific significance, and extensive influence. The evaluation committee members choose two articles of exceptional quality that were published in the journal the year before the previous year and announce them online by the end of April.

The Prize:

– One research article and one review will be selected.
– Each winner will receive CHF 500, a certificate, and a free voucher for article processing fees valid for one year.

 
Algorithms Best Paper Award
 

Eligibility for the Award

– Papers published in Algorithms from 1 January 2023 to 31 December 2023;
– Open to all career levels;
– Both regular and Special Issue submissions will be considered.

Selection Criteria

The papers will be selected by the journal Award Committee according to the following criteria:
– Scientific merit and broad impact;
– Originality of the research objectives and/or the ideas presented;
– Creativity of the study design or uniqueness of the approaches and concepts;
– Clarity of presentation;
– Citations and downloads.
 
Past Winners
 
Year: 

Winner

17 pages, 1788 KiB  
Article
A Novel Intelligent Method for Fault Diagnosis of Steam Turbines Based on T-SNE and XGBoost
by Zhiguo Liang, Lijun Zhang and Xizhe Wang
Algorithms 2023, 16(2), 98; https://doi.org/10.3390/a16020098 - 9 Feb 2023
30 pages, 3724 KiB  
Review
Defect Detection Methods for Industrial Products Using Deep Learning Techniques: A Review
by Alireza Saberironaghi, Jing Ren and Moustafa El-Gindy
Algorithms 2023, 16(2), 95; https://doi.org/10.3390/a16020095 - 8 Feb 2023

Winner

28 pages, 524 KiB  
Article
Reducing the False Negative Rate in Deep Learning Based Network Intrusion Detection Systems
by Jovana Mijalkovic and Angelo Spognardi
Algorithms 2022, 15(8), 258; https://doi.org/10.3390/a15080258 - 26 Jul 2022

Winner

15 pages, 367 KiB  
Article
An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks
by Salim Bouamama and Christian Blum
Algorithms 2021, 14(3), 79; https://doi.org/10.3390/a14030079 - 28 Feb 2021

Award Committee

Prof. Frank Werner Chairman
Otto-von-Guericke University Magdeburg

Winner

45 pages, 601 KiB  
Article
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
by Stuart Hadfield, Zhihui Wang, Bryan O’Gorman, Eleanor G. Rieffel, Davide Venturelli and Rupak Biswas
Algorithms 2019, 12(2), 34; https://doi.org/10.3390/a12020034 - 12 Feb 2019

Award Committee

Prof. Frank Werner Chairman
Otto-von-Guericke University Magdeburg

Winner

23 pages, 593 KiB  
Article
Generalized Kinetic Monte Carlo Framework for Organic Electronics
by Waldemar Kaiser, Johannes Popp, Michael Rinderle, Tim Albes and Alessio Gagliardi
Algorithms 2018, 11(4), 37; https://doi.org/10.3390/a11040037 - 26 Mar 2018
33 pages, 3182 KiB  
Article
The NIRS Brain AnalyzIR Toolbox
by Hendrik Santosa, Xuetong Zhai, Frank Fishburn and Theodore Huppert
Algorithms 2018, 11(5), 73; https://doi.org/10.3390/a11050073 - 16 May 2018
Back to TopTop