|
581 |
MEM-Based Pangenome Indexing for k-mer Queries
Hwang, Stephen. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
582 |
Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests
Hübner, Lukas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
583 |
Methods to incorporate patient preferences into medical decision algorithms and models and their quantification, balancing and evaluation
Fusiak, Jakub. - Ludwig-Maximilians-Universität München, 2024
|
|
|
|
584 |
Mimicking Networks for Constrained Multicuts in Hypergraphs
Cho, Kyungjin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
585 |
Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard
Heeger, Klaus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
586 |
Minimum Plane Bichromatic Spanning Trees
A. Akitaya, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
587 |
More Basis Reduction for Linear Codes: Backward Reduction, BKZ, Slide Reduction, and More
Ghentiyala, Surendra. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
588 |
Move-r: Optimizing the r-index
Bertram, Nico. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
589 |
Multicoloured Hardcore Model: Fast Mixing and Its Applications as a Scheduling Algorithm
Olesker-Taylor, Sam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
590 |
Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
Anapolska, Mariia. - Augsburg : Universität Augsburg, 2024
|
|
Administration
