Dear Colleagues,

On behalf of the Editor-in-Chief, Prof. Dr. Frank Werner, we wish to acknowledge our reviewers who so generously offer their time to review the papers submitted to Algorithms by presenting an award to the reviewers who have demonstrated their dedication, professionalism, and timeliness in reviewing manuscripts for Algorithms.

What are the pre-requisites to be eligible for this award?
– All of the reviewers for Algorithms in 2023 will be automatically included.

Selection Criteria:
– Number of review reports;
– The quality and timeliness of review reports.

What will the winners receive?
There will be two winners this year, and each will receive the following:
– CHF 500;
– An opportunity to publish a paper free of charge in Algorithms in 2024 after peer review;
– A certificate.

When will the winners be announced?
– The winners will be announced in March 2024 on the journal website.

How can I make myself eligible?
– If you have not yet reviewed papers for Algorithms but would like to do so, you can register as a reviewer at the following link: https://susy.mdpi.com/volunteer/profile/edit.

Kind regards,
Algorithms Editorial Office

Dear Colleagues,

The journal Algorithms is inviting applications for the Algorithms 2023 Best PhD Thesis Award. This prize will be awarded to a PhD student or recently qualified PhD who has produced a highly anticipated thesis with great academic potential. The applications will be assessed by an evaluation committee led by the Editor-in-Chief, Prof. Dr. Frank Werner.

Eligibility and Requirements:
– The candidate must be a PhD student or recently qualified PhD who has produced a highly anticipated thesis with great academic potential;
– The PhD thesis must be their original work;
– The PhD thesis must be defended in 2023.

Required Application Documents:
– An executive summary of the PhD thesis in English of around 3000 words;
– A letter from the PhD supervisor recommending the candidate for consideration for this award;
– The candidate’s CV, including a list of publications connected with the thesis;
– An electronic copy of the PhD thesis;
– A scanned copy of the PhD diploma (or certificate of studying at a school or research institute as a PhD student going to graduate or participate in graduation thesis defenses).

Selection Criteria:
– Quality of resume and publications;
– Relevance of the candidate and research description;
– Novelty of the candidate’s PhD thesis;
– Strength of the recommendation letter;
– Anticipated academic potential;
– Originality and impact of the research.

The Prize:
– Bonus (CHF 500);
– A certificate;
– Offer to publish one paper free of charge in Algorithms after peer review before the end of 2024.

How to submit application?
The applications must be submitted online (https://www.mdpi.com/journal/algorithms/awards/2240).

The application deadline is 28 February 2024. The winner will be announced on the Algorithms website by the end of April 2024.

Kind regards,
Algorithms Editorial Office

Dear Colleagues, 

We are pleased to announce the winner of the 2023 Algorithms Best Paper Award. All papers published from 1 January 2022 to 31 December 2022 in Algorithms were considered for the award. After a thorough evaluation of the originality and significance of the papers, citations, and downloads, one winner was selected.

Reducing the False Negative Rate in Deep Learning Based Network Intrusion Detection Systems
By Jovana Mijalkovic and Angelo Spognardi
Algorithms 2022, 15(8), 258; doi:10.3390/a15080258 

The winner will receive CHF 500 and a chance to publish a paper free of charge in Algorithms in 2023 after peer review. 

Please join us in congratulating the winner of the 2023 Algorithms Best Paper Award. We would also like to take this opportunity to thank all of our authors for your continued support of Algorithms.

Kind regards,
Algorithms Editorial Office

Dear Colleagues,

We are pleased to announce the winners of the Algorithms 2022 Outstanding Reviewer Award. The Algorithms Editorial Board and Editorial Team would like to gratefully acknowledge the time and energy dedicated by reviewers in checking the manuscripts submitted to Algorithms. It is due to their efforts that the high quality and quick turnaround of the journal are maintained.

Dr. Stefano Ferilli
Affiliation: Department of Computer Science, University of Bari Aldo Moro, 70125 Bari, Italy
Research Interests: artificial intelligence; machine learning; digital libraries; document processing

Dr. Tomasz Hachaj
Affiliation: Institute of Computer Science, Pedagogical University of Krakow, 30-084 Krakow, Poland
Research Interest: image processing; pattern recognition; computer graphics; artificial intelligence 

Dr. Roberto Saia
Affiliation: Department of Mathematics and Computer Science, University of Cagliari, 09124 Cagliari, Italy
Research Interests: artificial intelligence; credit scoring; financial forecasting; recommender and advertising systems; blockchain-based applications; fraud detection; intrusion detection; data mining for rare events; data security 

The Prize for Each Winner:

• An opportunity to publish a paper free of charge in Algorithms in 2023 after peer review;
• A certificate.

Kind regards,
Algorithms Editorial Office

Dear Colleagues,

We are pleased to announce the winner of the Algorithms 2022 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

Dear Colleagues,

We are pleased to announce the winners of the Algorithms 2021 Outstanding Reviewer Award. The Algorithms Editorial Board and Editorial Team would like to gratefully acknowledge the time and energy dedicated by reviewers in checking the manuscripts submitted to Algorithms. It is due to their efforts that the high quality of the journal and quick turnaround are maintained.

Dr. Maxim A. Dulebenets
Civil and Environmental Engineering, SA Florida A&M University-Florida State University, Tallahassee, USA
Research Interests: operations research; optimization; simulation modeling; mathematical programming; metaheuristics; evolutionary computation; transportation engineering; freight transportation; liner shipping scheduling; GPS data processing

Dr. Artur Jez
Institute of Computer Science, University of Wrocław, Wrocław, Poland
Research Interests: stringology; word equations

Dr. Dmitry Lukyanenko
Department of Mathematics, Faculty of Physics, Lomonosov Moscow State University, Moscow, Russia
Research Interests: inverse problems; mathematics; partial differential equations; numerical and computational mathematics; numerical methods; numerical simulation

Kind regards,
Prof. Dr. Frank Werner
Editor-in-Chief, Algorithms

Dear Colleagues,

We are pleased to announce the winners of the Algorithms 2020 Outstanding Reviewer Awards. The Algorithms Editorial Board and Editorial Team would like to gratefully acknowledge our reviewers for the time and energy that they have dedicated to checking manuscripts submitted to Algorithms. It is due to their efforts that the high quality of the journal and quick turnaround are maintained. Each of the winners will receive a certificate, and an opportunity to publish a paper free of charge in 2021.

Dr. Maxim A. Dulebenets
Civil and Environmental Engineering, SA Florida A&M University-Florida State University, Tallahassee, USA
Research Interests: operations research; optimization; simulation modeling; mathematical programming; metaheuristics; evolutionary computation; transportation engineering; freight transportation; liner shipping scheduling; and GPS data processing

Dr. Jakub Nalepa
Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland
Research Interests: artificial intelligence; machine learning; deep learning; evolutionary computation

Dr. Eugenio Piasini
Computational Neuroscience Initiative, University of Pennsylvania, Philadelphia, USA
Research Interests: computational neuroscience; computational cognitive science; complexity; information theory; spiking neural networks; neural coding; neuroinformatics

Prof. Dr. Frank Werner
Editor-in-Chief, Algorithms

Dear Colleagues,

As the Editor-in-Chief of Algorithms, I am pleased to announce the winner of the Algorithms 2020 Best Paper Award.

The award has been granted to one research article:

Paper Title: 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
Volume 12, Issue 2, doi: 10.3390/a12020034

The corresponding author will receive CHF 500 and a chance to publish a paper free of charge in Algorithms in 2021. On behalf of the Assessment Committee, I congratulate the winner on the accomplishment. We would like to take this opportunity to thank all the nominated research groups of the above exceptional paper for their contributions to Algorithms and thank the Award Committee for voting and helping with the award.

Editor-in-Chief
Prof. Dr. Frank Werner, Algorithms

Dear Colleagues,

As the Editor-in-Chief of Algorithms, I am pleased to announce the winners of the Algorithms 2019 Best Paper Awards. The award recipients will each receive a certificate and 500 Swiss francs (CHF). The winners are as follows:

Hendrik Santosa, Xuetong Zhai, Frank Fishburn, Theodore Huppert, USA
Paper: The NIRS Brain AnalyzIR Toolbox (doi.org/10.3390/a11050073)

Waldemar Kaiser, Johannes Popp, Michael Rinderle, Tim Albes, Alessio Gagliardi,
Germany
Paper: Generalized Kinetic Monte Carlo Framework for Organic Electronics (doi.org/10.3390/a11040037)

The Evaluation Committee believes that the above papers represent a valuable contribution to Algorithms. We congratulate the authors and thank them for selecting Algorithms to publish their work.

Editor-in-Chief
Prof. Dr. Frank Werner
Otto-von-Guericke University, Faculty of Mathematics
Magdeburg, Germany

Dear Colleague,

As Editor-in-Chief of Algorithms, I am pleased to announce the winner of the 2019 Algorithms Travel Award on behalf of the Evaluation Committee:

The winner is Henry Förster, Ph.D. student at University of Tübingen, whose research interests concern theoretical aspects of Computer Science, focusing on algorithms and their complexity. He is planning to present his work “Planar Graphs of Bounded Degree Have Bounded Queue Number” at the 51st Annual ACM Symposium on the Theory of Computing, (STOC 2019), June 23 - 26, 2019, Phoenix, AZ. The award consists of 800 Swiss Francs towards attending this conference.

It was a difficult decision with such high quality applications for the award and we thank all applicants. We wish to congratulate Mr. Henry Förster for his accomplishments.

Dear Colleagues,

As Editor-in-Chief of Algorithms, I am pleased to announce the winner of the 2018 Algorithms Travel Award:

The winner is Saeed Seddighin, a Ph.D. student at University of Maryland. His research focuses on theoretical computer science. He is planning to present his work “Fast Algorithms for Knapsack via Convolution and Prediction” at the 50th Annual ACM Symposium on the Theory of Computing (STOC 2018). The award consists of 800 Swiss Francs to attend this conference.

Henning Fernau,
Editor-in-Chief

Dear Colleagues,

As Editor-in-Chief of Algorithms, I am pleased to announce the winner of the 2017 Algorithms Travel Award on behalf of the Evaluation Committee:

Aviad Rubinstein, Ph.D. student at the UC Berkeley, whose research focuses on computational complexity. He is planning to present his work “Settling the complexity of computing approximate two-player Nash equilibria” at the Highlights of Algorithms (HALG 2017). The award consists of 800 Swiss Francs towards attending this conference.

It was a difficult decision with such high quality applications for the award and we thank all applicants. We wish to congratulate Mr. Aviad Rubinstein for his accomplishments. 

Henning Fernau,
Editor-in-Chief

Dear Colleagues,

As Editor-in-Chief of Algorithms, I am pleased to announce the winner of the 2016 Algorithms Travel Award: Fabrizio Montecchiani, Postdoc fellow at the University of Perugia, whose research focuses on graph drawing, information visualization, algorithm engineering and computational geometry. He is planning to present his work On Visibility Representations of Non-Planar Graphs at the 32nd International Symposium on Computational Geometry (SoCG 2016). The award consists of 800 Swiss Francs to attend this conference.

Henning Fernau,
Editor-in-Chief