The awards cover travel expenses for students attending academic conferences. In the case of journal publications, other publication costs or participation in a conference without presenting a publication may also be funded. The exact prize amount depends on the costs incurred. Approximately five awards can be granted per year.
The selection process considers the individual contribution of the student, the ranking of the conference, and the promotion of participation by underrepresented groups in the academic community as key criteria.
UNIVIE Research Awards for Students 2025/2026
Congratulations on the publication that has been accepted as a paper at the conference ALENEX2026!
G. Braun, K. Hanauer, M. Vötsch: „New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems”
The research contribution to this publication was developed as part of the Master's thesis.
The Repetition-Free Longest Common Subsequence (RFLCS) problem is a constrained variant of the classic Longest Common Subsequence problem, requiring that each character appears at most once in the solution. Unlike its well-studied counterpart, RFLCS is NP-hard and particularly challenging to solve efficiently. We introduce a new randomized heuristic based on a dominating match graph encoding of the problem, as well as an improved exact algorithm building on multivalued decision diagrams. In extensive experiments on an established benchmark set, our heuristic solves the vast majority of instances to optimality, while our exact solver outperforms the current state-of-the-art in both running time and number of solved instances.
