|
71 |
Bringing order to approximate matching: classification and attacks on similarity digest algorithms
Martín-Pérez, Miguel. - Augsburg : Universität Augsburg, 2021
|
|
|
|
72 |
Efficient Algorithms for Counting Gapped Palindromes
Popa, Andrei. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
73 |
Efficient Haplotype Block Matching in Bi-Directional PBWT
Naseri, Ardalan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
74 |
Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane
Bandyapadhyay, Sayan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
75 |
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach
Assadi, Sepehr. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
76 |
Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space
Patel, Dhrumil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
77 |
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
Lavastida, Thomas. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
78 |
Matching Drivers to Riders: A Two-Stage Robust Approach
Housni, Omar El. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
79 |
Maximum-Weight Matching in Sliding Windows and Beyond
Biabani, Leyla. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
|
|
80 |
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths
Curticapean, Radu. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
|
|
Administration
