Dear colleagues, 

We are pleased to announce the “Algorithms 2022 Best Paper Award” for research articles published in Algorithms from 1 January 2020 to 31 December 2020. One research article will receive the award. The paper will be selected after thorough evaluation by the journal Award Committee led by the EiC, Prof. Dr. Frank Werner, and the winners will be announced on 30 April 2022. 

Eligibility for the Awards:

– Papers published in Algorithms from 1 January 2020 to 31 December 2020;
– 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 (data source: Web of Science (Clarivate Analytics)):

– Scientific merit and broad impact;
– Relevance to the journal’s field;
– 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;
– Citation and download rates in 2020. 

Prizes:

– CHF 500 and a chance to publish a paper free of charge in Algorithms in 2022;
– A certificate. 

The winners will be announced on the journal website on 30 April 2022. 

Kind regards,
Algorithms Editorial Office

Dear Colleagues,

To acknowledge the accomplishments and continued support of our esteemed authors, we are pleased to announce the Algorithms 2020 Best Paper Award. After a thorough evaluation by the Award Committee, one research article published between 1 January 2019 and 31 December 2019 will be granted the honor of this award.

Eligibility for the award: 

– The paper must have been published in Algorithms between 1 January and 31 December 2019.
– Both regular and Special Issue submissions will be considered.
– Only original research articles are eligible.

Selection criteria:

– Originality and novelty of the research objectives and/or ideas presented;
– Citation and download rates in 2020;
– Data Source: Web of Science (Clarivate Analytics).

Prizes:

– The award will be provided by a certificate and 500 Swiss Francs.
– The winner will be granted the opportunity to publish a paper free of charge in Algorithms after undergoing the normal peer review procedure.

The winners will be announced online on 30 April 2021.
Prof. Dr. Frank Werner
Editor-in-Chief of 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

We are inviting applications for a Travel Award for PhD students in the area of algorithms and their applications to attend a conference of their choice in 2020. The nominations and applications will be assessed by an Evaluation Committee consisting of senior scholars in this field.

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

Candidate Requirements:

– PhD students whose research involves algorithms and their applications
– Attend an international conference in 2020 to present research (either via an oral presentation or poster) in the area of algorithms and their applications
– Applicants are required to submit the following documents:
– An abstract for the conference
– Letter of acceptance from the conference organizer
– Curriculum Vitae, including a complete list of publications
– Letter of support from their mentors

The award will consist of 800 Swiss Francs.

Please send your applications to www.mdpi.com/journal/algorithms/awards by 1 November 2020. The winner will be announced by 30 November 2020.

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.

We are inviting applications for a Travel Award for PhD students in the area of algorithms and their applications to attend a conference of their choice in 2018. The nominations and applications will be assessed by an Evaluation Committee consisting of senior scholars in this field.

Editor-in-Chief,
Prof. Dr. Henning Fernau

Candidates’ Requirements:

• PhD students whose research involves algorithms and their applications
• Attend an international conference in 2018 to present research (either via an oral presentation or poster) in the area of algorithms and their applications, and provide a letter of acceptance from the conference organizer
• Applicants are required to submit the following documents:

1. An abstract for the conference
2. Curriculum Vitae, including a complete list of publications.
3. Letter of support from their mentors

The award will consist of 800 Swiss Francs.

Please send your applications before 31 May 2018. The winner will be announced by 15 June 2018.

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