Dr. Jesper Jansson Appointed Section Editor-in-Chief of the Section "Analysis of Algorithms and Complexity Theory" in Algorithms
We are pleased to announce that Dr. Jesper Jansson has been appointed as the Editor-in-Chief of the new section “Analysis of Algorithms and Complexity Theory” in Algorithms.
Dr. Jesper Jansson is an associate professor at the Department of Computing, The Hong Kong Polytechnic University.
He is developing new mathematical theories and computational techniques for solving graph theoretical problems, with a focus on computational complexity. His goal is to design conceptually simple, efficient, and flexible algorithms that may be useful in many different situations. He is especially interested in combinatorial problems from the biological sciences that can be expressed elegantly using graphs and tree structures. His research interests include:
- Graph algorithms
- Bioinformatics
- Phylogenetic trees and phylogenetic networks
- Computational complexity
- Data structures
We warmly welcome Dr. Jesper Jansson as the Editor-in-Chief of the section " Analysis of Algorithms and Complexity Theory", and we look forward to Algorithms achieving many milestones under his leadership. For further information on the journal section, please see:
https://www.mdpi.com/journal/algorithms/sections/algorithms_analysis_complexity_theory