|
571 |
Maximal Number of Subword Occurrences in a Word
Fang, Wenjie. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
572 |
Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
Cervenjak, Philip. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
573 |
McDag: Indexing Maximal Common Subsequences in Practice
Buzzega, Giovanni. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
574 |
Measuring Group Separability in Geometrical Space for Evaluation of Pattern Recognition and Dimension Reduction Algorithms
Acevedo, Aldo. - Dresden : Technische Universität Dresden, 2024
|
|
|
|
575 |
MEM-Based Pangenome Indexing for k-mer Queries
Hwang, Stephen. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
576 |
Memoization on Shared Subtrees Accelerates Computations on Genealogical Forests
Hübner, Lukas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
577 |
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
|
|
|
|
578 |
Mimicking Networks for Constrained Multicuts in Hypergraphs
Cho, Kyungjin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
579 |
Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard
Heeger, Klaus. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
580 |
Minimum Plane Bichromatic Spanning Trees
A. Akitaya, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
