|
21 |
Subsequence Matching and Analysis Problems for Formal Languages
Fazekas, Szilárd Zsolt. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
22 |
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples
Faro, Simone. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
23 |
Weighted Matching in the Random-Order Streaming and Robust Communication Models
Hashemi, Diba. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
24 |
Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
Enthalten in Algorithmica 8.11.2024: 1-24
|
|
|
|
25 |
Prediction algorithms in matching platforms
Enthalten in Economic theory 4.4.2024: 1-42
|
|
|
|
26 |
Exact-matching algorithms using administrative health claims database equivalence factors for real-world data analysis based on the target trial emulation framework
Enthalten in Health services and outcomes research methodology 2.2.2024: 1-13
|
|
|
|
27 |
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs
Dürr, Anita. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
28 |
Approximation Algorithms for the Longest Run Subsequence Problem
Asahiro, Yuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
29 |
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications
Gabory, Esteban. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
30 |
Engineering Fast Algorithms for the Bottleneck Matching Problem
Panagiotas, Ioannis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
Administration
