1. |
2. |
3. |
4. Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.Clément Jean Dallard, 2021, review, book review, critique Keywords: reconfiguration, dynamic programming, graph coloring Published in RUP: 26.10.2021; Views: 972; Downloads: 8 Link to full text |
5. |
6. Weighted lambda superstrings applied to vaccine designLuis Martínez, Martin Milanič, Iker Malaina, Carmen Álvarez, Martín-Blas Pérez, Ildefonso M. de la Fuente, 2019, original scientific article Keywords: vaccine design, bioinformatics, combinatorial optimization problem, weighted lambda-superstring, integer programming formulation, genetic algorithm, Nef protein Published in RUP: 13.02.2019; Views: 2336; Downloads: 165 Link to full text |
7. |
8. MIPUP : minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILPEdin Husić, Xinyue Li, Ademir Hujdurović, Miika Mehine, Romeo Rizzi, Veli Mäkinen, Martin Milanič, Alexandru I. Tomescu, 2018, original scientific article Keywords: perfect phylogeny, minimum conflict-free row split problem, branching, acyclic digraph, integer linear programming Published in RUP: 17.09.2018; Views: 1959; Downloads: 112 Link to full text |
9. |
10. |