Anytime Algorithms For Solving the Longest Common Palindromic Subsequence Problem - the additional files:

Best Paper Award at GECCO 2024 for M. Bresich, G. Raidl, and S. Limmer
2024-07-24
Maria Bresich, Günther Raidl, and Steffen Limmer received the best paper award at the 2024 Genetic and Evolutionary Computation Conference …Read More »
Welcome to our Feodor Lynen Fellow Dr. Frank Sommer
2024-06-14
On June 1, 2024, Dr. Frank Sommer has joined the Algorithms and Complexity group with a prestigious Feodor Lynen postdoc …Read More »
Esra Ceylan won the OCG Award 2024
2024-05-31
Our best Master thesis awardee last year, Esra Ceylan, won the OCG award 2024 for her Master's thesis, supervised by …Read More »
New PhD: Markus Wallinger
2024-04-26
Markus Wallinger successfully defended his PhD thesis “Exploring Graph-based Concepts for Balanced Information Density in Data Visualizations” on April 26, …Read More »
PhD completed by Soeren Terziadis
2024-01-09
Soeren Terziadis successfully defended his PhD thesis “Algorithms for Schematic Representations” on January 9, 2024. Congratulations, Dr. Terziadis! Soeren was …Read More »